{"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27062777,0.007407134,0.51210546,0.0037640412,0.0011878322,0.00013861807,0.00043612058,0.0019739375,0.20235904],"genre_scores_gemma":[0.9042942,0.0020411462,0.06628688,0.00055062794,0.00051236333,0.00018529268,0.00022340247,0.00072719157,0.025178863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986596,0.0002629943,0.000085673426,0.00029135865,0.00044286152,0.00025747158],"domain_scores_gemma":[0.99465734,0.0029565063,0.00049254857,0.00093409145,0.0006418147,0.00031765804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019839788,0.00089740823,0.0006328959,0.0026594466,0.002392984,0.0021955518,0.0017090426,0.00078658806,0.014643977],"category_scores_gemma":[0.009229305,0.00036602365,0.00076085364,0.0015301002,0.0029099844,0.011745586,0.0021152836,0.0037121435,0.0033559834],"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.00009248464,0.00003370898,0.0005733798,0.00012012254,0.0000129181835,0.000059836104,0.0003670406,0.0028273552,0.0024382495,0.9706952,0.0025039376,0.020275723],"study_design_scores_gemma":[0.000014238789,0.0000497976,0.00082902424,0.000043232238,0.000040471496,0.00026467026,0.00011340991,0.02040489,0.009431059,0.9534585,0.015286332,0.0000643088],"about_ca_topic_score_codex":0.0010802791,"about_ca_topic_score_gemma":0.0017487628,"teacher_disagreement_score":0.014643977,"about_ca_system_score_codex":0.0022962878,"about_ca_system_score_gemma":0.0012935023,"threshold_uncertainty_score":0.04898894},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64564,0.0009298514,0.16829576,0.0013254848,0.001057959,0.000101810045,0.00081034267,0.0015377178,0.180301],"genre_scores_gemma":[0.9419799,0.00048328924,0.028060723,0.000285333,0.00021515501,0.000106073574,0.0006789709,0.0006283767,0.02756224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995566,0.00006863283,0.000019160336,0.000084809726,0.00017103794,0.00009975918],"domain_scores_gemma":[0.9991467,0.00024094903,0.00011676038,0.0001502654,0.0001843114,0.00016109414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007333517,0.0008000874,0.00048303406,0.0027893959,0.0013033573,0.0022349919,0.001052888,0.00068467035,0.01721698],"category_scores_gemma":[0.002938525,0.0002290769,0.0007055713,0.0010267816,0.0021544746,0.0031467061,0.001493399,0.0015931968,0.0033443037],"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.00009550495,0.000042482847,0.00086768466,0.00009549794,0.000012344823,0.00015283977,0.00027626788,0.0034276284,0.005580922,0.9664882,0.0033169698,0.019643655],"study_design_scores_gemma":[0.000023851715,0.000055148263,0.0015593008,0.000072765164,0.000017699516,0.00043855357,0.00021330529,0.02891106,0.014021106,0.93322986,0.021371236,0.000086137276],"about_ca_topic_score_codex":0.0008648258,"about_ca_topic_score_gemma":0.0012394111,"teacher_disagreement_score":0.01721698,"about_ca_system_score_codex":0.0012203407,"about_ca_system_score_gemma":0.0005975569,"threshold_uncertainty_score":0.057596564},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46300352,0.0011578081,0.5055457,0.0007540603,0.0003089332,0.00021931477,0.0009328743,0.00054185005,0.027536051],"genre_scores_gemma":[0.82688975,0.00044646693,0.16027255,0.00033338432,0.00029112314,0.00029621745,0.0012912323,0.00019460717,0.009984695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998192,0.00043785776,0.00017297712,0.00031262214,0.00048756902,0.00039693154],"domain_scores_gemma":[0.99588495,0.0016501471,0.00039995098,0.00039154416,0.0010593382,0.0006140529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023859662,0.0005312873,0.0008420512,0.0013822932,0.0014201299,0.0033431835,0.0013909824,0.0007163863,0.003865377],"category_scores_gemma":[0.005489626,0.00077213964,0.0015472244,0.00083143194,0.0026975768,0.004021269,0.0018355971,0.0023834535,0.0010778625],"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.000059598766,0.000069784815,0.00057888305,0.000072450915,0.000023028091,0.00009336727,0.00048630874,0.0006110584,0.0042744614,0.9850535,0.0005978241,0.008079717],"study_design_scores_gemma":[0.000056145676,0.000059816033,0.0005355969,0.00004818327,0.000026928408,0.00014110851,0.00020320572,0.0068543428,0.0059872568,0.98239625,0.0036473265,0.000043804936],"about_ca_topic_score_codex":0.0013969458,"about_ca_topic_score_gemma":0.001844754,"teacher_disagreement_score":0.003865377,"about_ca_system_score_codex":0.0013644231,"about_ca_system_score_gemma":0.0018230279,"threshold_uncertainty_score":0.012931049},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29371923,0.00052948855,0.66694593,0.0071576904,0.00038970463,0.0003760513,0.0020314895,0.0074672955,0.021383148],"genre_scores_gemma":[0.7920797,0.0003752076,0.19265859,0.0010398972,0.00023430635,0.00017552568,0.0032459015,0.0011956515,0.008995288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962394,0.0006228283,0.00029044144,0.0014326014,0.0008109918,0.00060365495],"domain_scores_gemma":[0.9663274,0.025316954,0.0016350001,0.003579884,0.0022173603,0.00092344696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032755286,0.0011479296,0.0018688402,0.0009341194,0.0031719287,0.0060383454,0.0039571472,0.0027190335,0.009378434],"category_scores_gemma":[0.017072551,0.001132007,0.0039829775,0.0011729817,0.0044182106,0.01674446,0.0039553866,0.00548073,0.0024017892],"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.0018193925,0.0010466811,0.014995088,0.0014768137,0.00035648127,0.0019528355,0.0023364837,0.03269543,0.02102494,0.7815818,0.029890098,0.11082389],"study_design_scores_gemma":[0.00012468742,0.00017592803,0.00083599123,0.00009590159,0.00015558676,0.0006395394,0.0006282836,0.08932523,0.020787,0.8772222,0.009909292,0.00010038254],"about_ca_topic_score_codex":0.005134547,"about_ca_topic_score_gemma":0.005925548,"teacher_disagreement_score":0.009378434,"about_ca_system_score_codex":0.0022470783,"about_ca_system_score_gemma":0.004051599,"threshold_uncertainty_score":0.031373978},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7783708,0.0011402197,0.08186476,0.0013181486,0.00033747015,0.0001623347,0.00080984447,0.00032906563,0.13566741],"genre_scores_gemma":[0.94328064,0.00026802276,0.020176845,0.0001825579,0.00015920764,0.00014825088,0.00080418756,0.00008455995,0.034895737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955267,0.000057590827,0.000030826708,0.00011088501,0.000121464975,0.00012655884],"domain_scores_gemma":[0.9992772,0.00016012258,0.00023251263,0.0000906802,0.00009962378,0.00013997755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002623321,0.00044826942,0.00043759734,0.000990842,0.0013035733,0.001899577,0.00043710644,0.0007128464,0.010204622],"category_scores_gemma":[0.001237895,0.0002139159,0.0003634026,0.0005906057,0.0022879513,0.0025020358,0.0016291265,0.0010273258,0.002600813],"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.0002915825,0.000055966,0.002065361,0.00009536685,0.000019520952,0.00058582914,0.0013989534,0.000929748,0.010334762,0.9575985,0.0027731748,0.02385122],"study_design_scores_gemma":[0.00006549267,0.000079148405,0.0020109056,0.000045972574,0.00001603564,0.0009733476,0.0009515574,0.00238894,0.007728568,0.9453206,0.04037358,0.00004589044],"about_ca_topic_score_codex":0.00074261724,"about_ca_topic_score_gemma":0.00065228785,"teacher_disagreement_score":0.010204622,"about_ca_system_score_codex":0.0007005115,"about_ca_system_score_gemma":0.0004994798,"threshold_uncertainty_score":0.034137845},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7355402,0.00091739005,0.22829536,0.008698531,0.00015764673,0.0006221186,0.002402067,0.002357463,0.021009143],"genre_scores_gemma":[0.920575,0.00046842333,0.07163566,0.0005733709,0.00025150023,0.00024095691,0.002438933,0.00039548468,0.003420582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98800164,0.0032694968,0.0009199802,0.002312862,0.003678835,0.0018172484],"domain_scores_gemma":[0.8872479,0.09560525,0.0047469377,0.0070113754,0.0029098294,0.002478674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076301876,0.0009462459,0.0023708912,0.00222955,0.0039067324,0.007836657,0.003478548,0.003006822,0.012357218],"category_scores_gemma":[0.056363158,0.0014074127,0.0037131328,0.0023972725,0.00793606,0.024529397,0.0075946837,0.0061031072,0.00113169],"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.0021816795,0.00064481626,0.015218577,0.00083153124,0.00022701698,0.0010264568,0.0020004492,0.08416395,0.011905632,0.81645656,0.007841409,0.05750196],"study_design_scores_gemma":[0.0001935516,0.00011994065,0.0013797609,0.000050035098,0.00007330412,0.00030091085,0.00047438263,0.12076533,0.0069353306,0.8677043,0.0019210582,0.00008209054],"about_ca_topic_score_codex":0.003474098,"about_ca_topic_score_gemma":0.0027661843,"teacher_disagreement_score":0.012357218,"about_ca_system_score_codex":0.0032044763,"about_ca_system_score_gemma":0.0033019264,"threshold_uncertainty_score":0.04133898},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6775147,0.00066899986,0.19213201,0.0021056698,0.00071818125,0.00008032482,0.00020946679,0.0005319346,0.12603875],"genre_scores_gemma":[0.95689267,0.00034142603,0.015713478,0.00026499224,0.00025706427,0.000044532917,0.00012055487,0.00012153259,0.026243739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995603,0.00006175925,0.000020597072,0.00010447226,0.00014098032,0.000111889916],"domain_scores_gemma":[0.999495,0.000095381925,0.000100942845,0.00009371225,0.00009750704,0.00011751123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003958379,0.000474476,0.00034194594,0.00079787447,0.0010852091,0.0012012189,0.00039697747,0.00043830584,0.0068587386],"category_scores_gemma":[0.00069292035,0.00021063609,0.0005009188,0.0002614836,0.0019702155,0.002557183,0.0019601851,0.0012374064,0.0008311523],"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.00005692149,0.000026529635,0.00035856295,0.000037196973,0.0000073124997,0.0001853867,0.0004668508,0.000401251,0.0051839966,0.9835435,0.00090163003,0.008830861],"study_design_scores_gemma":[0.000033336557,0.0002538305,0.0012658671,0.000021715094,0.000020068666,0.0008569526,0.0005637416,0.006939976,0.01062068,0.955253,0.024134805,0.000036100177],"about_ca_topic_score_codex":0.0005622204,"about_ca_topic_score_gemma":0.000404203,"teacher_disagreement_score":0.0068587386,"about_ca_system_score_codex":0.00036650326,"about_ca_system_score_gemma":0.0002822673,"threshold_uncertainty_score":0.022944748},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5434103,0.0010810543,0.4405412,0.0018757174,0.000093054914,0.00023952169,0.0011653178,0.0019041541,0.0096896505],"genre_scores_gemma":[0.7796244,0.0004426343,0.21068545,0.00023224947,0.00009426655,0.00020147822,0.002549272,0.00022799532,0.005942316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997922,0.00044702302,0.00015606513,0.00064490206,0.0005285605,0.00030149607],"domain_scores_gemma":[0.9959143,0.0024725073,0.00036808907,0.0007523898,0.0002781783,0.0002146498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012697375,0.0007855245,0.0013471376,0.00094101107,0.0012057819,0.002160027,0.0020836438,0.0013683185,0.004186562],"category_scores_gemma":[0.00872246,0.00053107215,0.0015697351,0.0014161007,0.0013097249,0.0062039346,0.0029797605,0.0018871104,0.0006144523],"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.0012534889,0.00034213945,0.005819167,0.0008637611,0.00020053775,0.00055010815,0.0018299221,0.33605638,0.012279314,0.49504688,0.009626608,0.13613169],"study_design_scores_gemma":[0.00008765381,0.00010107489,0.00041604857,0.000025331621,0.00003740356,0.00020626023,0.00021416479,0.42097676,0.0038700472,0.56954926,0.004491562,0.000024403387],"about_ca_topic_score_codex":0.0029988878,"about_ca_topic_score_gemma":0.002829392,"teacher_disagreement_score":0.004186562,"about_ca_system_score_codex":0.0022142974,"about_ca_system_score_gemma":0.0012058354,"threshold_uncertainty_score":0.016065955},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9414624,0.000640502,0.0434041,0.00040200687,0.000057095054,0.000025535875,0.0003906672,0.0000903814,0.013527236],"genre_scores_gemma":[0.9906392,0.00016743272,0.0075342255,0.000029341965,0.000081214035,0.00003234463,0.00022088687,0.000018709516,0.0012766074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987808,0.00018360595,0.00009923528,0.00034112748,0.00030706718,0.00028822396],"domain_scores_gemma":[0.99667656,0.0013511027,0.00048405826,0.00043333857,0.00041964784,0.00063529663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011515734,0.0003012668,0.0007166366,0.003534131,0.0014440618,0.0033851038,0.0008633709,0.0005500522,0.002118004],"category_scores_gemma":[0.00278315,0.00036322474,0.00079615694,0.0013302453,0.004701178,0.004612671,0.0022585648,0.0011488764,0.00018322431],"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.00011310171,0.00003803728,0.0061381483,0.000051708404,0.000032812142,0.00016602123,0.0007952188,0.0014956767,0.004373851,0.98157436,0.00050793384,0.0047131716],"study_design_scores_gemma":[0.000043622003,0.000117150616,0.011783744,0.000072778916,0.00006964649,0.0012668894,0.0009865438,0.017913913,0.009448597,0.9490461,0.0091384,0.00011267146],"about_ca_topic_score_codex":0.00040964634,"about_ca_topic_score_gemma":0.00018879493,"teacher_disagreement_score":0.003534131,"about_ca_system_score_codex":0.0011717405,"about_ca_system_score_gemma":0.0004692379,"threshold_uncertainty_score":0.008501589},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54462004,0.0011523289,0.4136892,0.0005420046,0.00028996257,0.00013286842,0.00025108102,0.0010061834,0.03831633],"genre_scores_gemma":[0.89172316,0.00036119914,0.08721587,0.00010755504,0.00019583128,0.00013840137,0.00023219927,0.00015108228,0.019874806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982809,0.0005385215,0.000209424,0.0003688419,0.0003604755,0.00024182953],"domain_scores_gemma":[0.99667144,0.0017461283,0.00036668687,0.00048997765,0.00043702734,0.00028877973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001545106,0.00061502063,0.00051692105,0.0007782503,0.0014006731,0.0025684542,0.00064635725,0.00064333546,0.0063133533],"category_scores_gemma":[0.0036252956,0.0005303634,0.0007762693,0.00059503806,0.0026765498,0.0059953067,0.0019315336,0.0008621484,0.0012462147],"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.0001410077,0.000038390393,0.00067090086,0.00011669031,0.000015215707,0.00031717325,0.0018136121,0.0020528524,0.0070477733,0.96857756,0.00085656793,0.01835239],"study_design_scores_gemma":[0.000031071733,0.00014933718,0.00023219902,0.000026731588,0.000023286795,0.00036179586,0.00035609724,0.00956971,0.007578126,0.9680393,0.013600574,0.0000318801],"about_ca_topic_score_codex":0.00039501712,"about_ca_topic_score_gemma":0.00069231965,"teacher_disagreement_score":0.0063133533,"about_ca_system_score_codex":0.00065858726,"about_ca_system_score_gemma":0.0004421401,"threshold_uncertainty_score":0.02112025},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8293754,0.001720315,0.10099037,0.0007317511,0.00035756183,0.00007669545,0.0002566088,0.00044338615,0.06604794],"genre_scores_gemma":[0.9764199,0.0005175931,0.012116354,0.00010762334,0.00040513408,0.00005808624,0.00018304099,0.00016228478,0.010029929],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999331,0.00013129518,0.000040092902,0.00014214059,0.00016840734,0.00018704512],"domain_scores_gemma":[0.9991115,0.0003613677,0.00013917583,0.00007871883,0.00011891746,0.0001903753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008615346,0.0008181347,0.00080263865,0.0020719415,0.0015326403,0.0020455671,0.00077659264,0.0005630691,0.0071968534],"category_scores_gemma":[0.003258921,0.0003615044,0.0007938808,0.0010921956,0.0032436978,0.004185295,0.0017163303,0.001270936,0.0010493192],"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.00016759818,0.000048754646,0.0013118255,0.000093891475,0.000016904165,0.000758195,0.0012685775,0.0020181104,0.004493877,0.97891366,0.0008501047,0.01005836],"study_design_scores_gemma":[0.000039649658,0.00012838516,0.00068200263,0.000043541233,0.000023787492,0.00062139257,0.00028474693,0.007892007,0.0036483495,0.98025835,0.006346384,0.00003132905],"about_ca_topic_score_codex":0.00061376137,"about_ca_topic_score_gemma":0.0006544246,"teacher_disagreement_score":0.0071968534,"about_ca_system_score_codex":0.0009770255,"about_ca_system_score_gemma":0.00041211888,"threshold_uncertainty_score":0.024075866},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4632019,0.0037784546,0.47462824,0.0017203275,0.00021760244,0.00009013837,0.0004054809,0.0003246484,0.055633344],"genre_scores_gemma":[0.9545731,0.00063175755,0.03921394,0.00016385895,0.00018802582,0.00007390352,0.00016875306,0.000029405368,0.004957178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967399,0.00073121546,0.00026757552,0.00039185528,0.0015177428,0.0003516939],"domain_scores_gemma":[0.99562234,0.0018826688,0.0007666187,0.0004430466,0.0008207368,0.00046463267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025469966,0.0003438308,0.00045867893,0.0017331782,0.0019884252,0.0036247135,0.0008070074,0.0007493797,0.0022425652],"category_scores_gemma":[0.0056905914,0.0003943502,0.0009429258,0.0016179217,0.0048518106,0.005661846,0.002176316,0.0011700201,0.00028150645],"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.00002866977,0.000010592631,0.00022519486,0.000024192612,0.000009673819,0.000105685314,0.00027397473,0.0020729273,0.0007723075,0.9926041,0.00020042468,0.0036723232],"study_design_scores_gemma":[0.000009018729,0.000014147999,0.000155762,0.000011870701,0.000007675755,0.00010324077,0.00013463065,0.011345632,0.0008035941,0.9851333,0.0022674815,0.0000137135985],"about_ca_topic_score_codex":0.0020325312,"about_ca_topic_score_gemma":0.0018095261,"teacher_disagreement_score":0.0036247135,"about_ca_system_score_codex":0.0024912483,"about_ca_system_score_gemma":0.00128313,"threshold_uncertainty_score":0.018075347},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8994074,0.0013732023,0.041188117,0.0010565743,0.00011948903,0.00005906562,0.00012961299,0.0003147128,0.056351915],"genre_scores_gemma":[0.98049635,0.00047406528,0.0057921903,0.00010086476,0.00020755974,0.00004732181,0.000107924134,0.000017430384,0.012756266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996208,0.00011081497,0.000020810101,0.00006234507,0.00009004297,0.0000950891],"domain_scores_gemma":[0.99919254,0.0002804301,0.0002039694,0.00008817152,0.00005722894,0.0001777523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005418068,0.0005082476,0.00038087866,0.00093583873,0.00071747846,0.0015041806,0.00035526973,0.00029595062,0.0039493027],"category_scores_gemma":[0.0009808611,0.00021920931,0.00033659945,0.00062914577,0.0020145942,0.0029249485,0.0018414259,0.00066314975,0.0005312007],"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.00020540654,0.000064132146,0.0012374134,0.000094725874,0.000017830045,0.0006909331,0.0016084389,0.0026638515,0.00679821,0.97005457,0.00069905486,0.015865369],"study_design_scores_gemma":[0.00008385617,0.00023595909,0.0010710827,0.00004061568,0.000023204946,0.00052517524,0.0005230263,0.0049052914,0.0035209088,0.97956127,0.009490606,0.000019072691],"about_ca_topic_score_codex":0.0002731601,"about_ca_topic_score_gemma":0.00023941004,"teacher_disagreement_score":0.0039493027,"about_ca_system_score_codex":0.00072151364,"about_ca_system_score_gemma":0.00048247888,"threshold_uncertainty_score":0.013211787},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27803215,0.0032230278,0.53336304,0.001414351,0.0010055761,0.00018841513,0.0006691449,0.0011611789,0.18094307],"genre_scores_gemma":[0.85119796,0.0019173379,0.10117936,0.00068500894,0.00057890714,0.00017308567,0.00036785862,0.0005806268,0.043319866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955434,0.00008719929,0.000028566103,0.000054994118,0.0001968129,0.000077992714],"domain_scores_gemma":[0.99953043,0.0001763666,0.000049729213,0.000060961243,0.00013247067,0.00005010959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000662531,0.0006744714,0.0005345991,0.0013533527,0.00084732595,0.002110008,0.001176325,0.000754056,0.006803377],"category_scores_gemma":[0.0022107163,0.00031368702,0.0007571699,0.0009234123,0.0015215005,0.003097935,0.0009045476,0.0018105212,0.0017236302],"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.0000075926328,0.000010349257,0.00007355114,0.000046282556,0.0000025225534,0.00012973418,0.00018144994,0.000808074,0.0016260354,0.9907844,0.00066267594,0.0056673377],"study_design_scores_gemma":[0.000015879737,0.000021745967,0.00017264232,0.000034269335,0.000009141152,0.00035386492,0.0000789882,0.016343553,0.0037074361,0.9668384,0.0123913605,0.00003266471],"about_ca_topic_score_codex":0.0009222425,"about_ca_topic_score_gemma":0.0015463952,"teacher_disagreement_score":0.006803377,"about_ca_system_score_codex":0.0012234604,"about_ca_system_score_gemma":0.00061696157,"threshold_uncertainty_score":0.022759497},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5582774,0.0011791374,0.31383672,0.001398778,0.0016589955,0.00023930454,0.00046659142,0.0006574283,0.12228556],"genre_scores_gemma":[0.92910165,0.00048178885,0.035623673,0.00030118166,0.00060992275,0.0002000727,0.00026827454,0.00017518815,0.033238262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989213,0.00020945643,0.00010030813,0.00032666483,0.0003015632,0.0001408546],"domain_scores_gemma":[0.9984823,0.00048519223,0.00019608876,0.00023444547,0.0002972806,0.00030467744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083011115,0.0005384096,0.0004583378,0.0011515443,0.0016799466,0.003356376,0.00057632214,0.00080455263,0.0069687003],"category_scores_gemma":[0.002079279,0.00033121897,0.00081745366,0.000552391,0.0023822088,0.003765353,0.0023650052,0.0010326992,0.0016828906],"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.00006732709,0.00003544506,0.00044352136,0.000040602325,0.000008712502,0.00062265474,0.0007184905,0.00046646275,0.0061216047,0.9828075,0.00056615256,0.008101309],"study_design_scores_gemma":[0.00003908369,0.000193958,0.0005604685,0.000030834177,0.000026244452,0.0013434578,0.00035567515,0.008949427,0.011220966,0.9449407,0.03229433,0.000044967466],"about_ca_topic_score_codex":0.00024992833,"about_ca_topic_score_gemma":0.00015403314,"teacher_disagreement_score":0.0069687003,"about_ca_system_score_codex":0.0008318694,"about_ca_system_score_gemma":0.0007226288,"threshold_uncertainty_score":0.023312628},"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":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51560736,0.00038473596,0.40952918,0.0015960077,0.00046088142,0.00011986501,0.00042653966,0.0011385363,0.0707369],"genre_scores_gemma":[0.91692203,0.00016465008,0.06511723,0.00039872708,0.00015768375,0.0001174908,0.00037075658,0.00029575377,0.016455652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984817,0.00036145624,0.00009957409,0.0003018931,0.00039889166,0.00035645967],"domain_scores_gemma":[0.99702305,0.001246265,0.0002288666,0.00059610774,0.00057694205,0.00032869403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013581533,0.000533176,0.00091627135,0.0008350119,0.0017169572,0.0029330784,0.0013943586,0.0010732674,0.006430546],"category_scores_gemma":[0.0034262743,0.0007425192,0.001317173,0.0005987872,0.003832549,0.00608792,0.0022949816,0.003390273,0.0012110203],"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.00003629115,0.000024181758,0.00014572818,0.00002436491,0.000007806082,0.000083469524,0.00010960369,0.00022638208,0.0024934637,0.99316794,0.00054189627,0.0031389256],"study_design_scores_gemma":[0.000034075223,0.000029434745,0.00016582051,0.000009068039,0.000014365939,0.0001617286,0.00008047844,0.002866484,0.0039619487,0.98987365,0.0027878825,0.0000149733005],"about_ca_topic_score_codex":0.00068469637,"about_ca_topic_score_gemma":0.0012045519,"teacher_disagreement_score":0.006430546,"about_ca_system_score_codex":0.00074451877,"about_ca_system_score_gemma":0.0010707618,"threshold_uncertainty_score":0.02151227},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.763455,0.0016191528,0.1868332,0.009451057,0.0002829438,0.00059220556,0.00498548,0.0036017168,0.029179223],"genre_scores_gemma":[0.88546336,0.0006869742,0.09557594,0.0006609843,0.00026691973,0.00041666118,0.006435864,0.0007440273,0.009749194],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947371,0.0010595692,0.00040178647,0.0015018224,0.0009895439,0.0013101752],"domain_scores_gemma":[0.98099387,0.014541726,0.0010764906,0.0019639502,0.00062407367,0.0007998536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024703424,0.0013473064,0.0025006153,0.0009409094,0.0024732596,0.0061495346,0.0038896312,0.0027452454,0.014234151],"category_scores_gemma":[0.014857444,0.0008291553,0.0021687958,0.0025739893,0.002073281,0.012267207,0.0037213287,0.0027443054,0.0021043501],"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.008808476,0.0015430899,0.021285804,0.0031522303,0.00078316184,0.001828112,0.0036873785,0.33210632,0.039959904,0.25172067,0.05508307,0.2800417],"study_design_scores_gemma":[0.0010551942,0.00032204328,0.0025578735,0.00006484266,0.0003308318,0.000595983,0.00084122486,0.5961215,0.010547918,0.3808936,0.00658728,0.00008167244],"about_ca_topic_score_codex":0.007045314,"about_ca_topic_score_gemma":0.0071708057,"teacher_disagreement_score":0.014234151,"about_ca_system_score_codex":0.0032272267,"about_ca_system_score_gemma":0.0043665594,"threshold_uncertainty_score":0.047617972},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6070295,0.00080160896,0.36661088,0.0020883796,0.0001984461,0.00018714786,0.0008157213,0.0021113018,0.020156981],"genre_scores_gemma":[0.9485189,0.00024966316,0.042406023,0.00025280882,0.00015525345,0.00012772798,0.0009914191,0.00021049226,0.0070877206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807113,0.00046711284,0.00016550215,0.0004870439,0.00045312702,0.00035617314],"domain_scores_gemma":[0.99563855,0.0028321526,0.0003646335,0.00069724955,0.00030056125,0.00016696972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011490237,0.0005762453,0.0006903168,0.0008562017,0.0010562843,0.0023489986,0.0011392474,0.0009877885,0.005440599],"category_scores_gemma":[0.0046879505,0.0005144437,0.0013355592,0.00088411383,0.0034079368,0.008861038,0.0027293635,0.0021117346,0.0005812631],"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.00026689577,0.00007274513,0.00061354827,0.00018266945,0.000031169177,0.00028005452,0.001162989,0.0125786085,0.0068042227,0.9556644,0.0018478824,0.02049474],"study_design_scores_gemma":[0.00003599016,0.000042622873,0.00009521762,0.000012228148,0.000018720712,0.00008881414,0.00013051894,0.018427948,0.0043908344,0.9739974,0.0027403564,0.00001940163],"about_ca_topic_score_codex":0.0013303009,"about_ca_topic_score_gemma":0.0011064437,"teacher_disagreement_score":0.005440599,"about_ca_system_score_codex":0.0011912538,"about_ca_system_score_gemma":0.0008936513,"threshold_uncertainty_score":0.018200576},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86641693,0.00046178428,0.10754895,0.000358483,0.000076539,0.00007254429,0.00024381571,0.00022984605,0.024591068],"genre_scores_gemma":[0.97734445,0.0001183864,0.017890463,0.00003835922,0.000060672304,0.000057356014,0.00016701719,0.000031011437,0.0042923233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995541,0.00008923088,0.000035719677,0.00011642164,0.00013692935,0.00006759238],"domain_scores_gemma":[0.9987865,0.00046193495,0.0001973326,0.00013831984,0.00014624641,0.00026973404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055881223,0.00026735457,0.00035769708,0.0011347142,0.00080441235,0.002367512,0.0003854671,0.0003230716,0.0033453957],"category_scores_gemma":[0.0014805116,0.00026191448,0.0005336208,0.0005426813,0.0019173694,0.002397618,0.0014311377,0.0007067894,0.0003710045],"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.00007569296,0.00002508249,0.0011665554,0.000032128883,0.000008278762,0.00032022322,0.0007244078,0.0012350192,0.0070558744,0.9835556,0.0003841444,0.005416961],"study_design_scores_gemma":[0.0000630115,0.00007625228,0.001905395,0.000020246856,0.000017856884,0.0008153778,0.0006216395,0.013491773,0.007537064,0.96638805,0.009028505,0.00003474689],"about_ca_topic_score_codex":0.0003289322,"about_ca_topic_score_gemma":0.0003486834,"teacher_disagreement_score":0.0033453957,"about_ca_system_score_codex":0.0006338394,"about_ca_system_score_gemma":0.0003083654,"threshold_uncertainty_score":0.011191487},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4816849,0.005143337,0.3429648,0.0023720902,0.0007483746,0.00014253662,0.0005476137,0.0008762157,0.1655201],"genre_scores_gemma":[0.9548774,0.0016170035,0.02550905,0.00055274565,0.0005992695,0.00011953587,0.00040892282,0.0001925514,0.016123522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846834,0.0005353733,0.000110773595,0.00024025877,0.00036965616,0.00027546752],"domain_scores_gemma":[0.9977124,0.0009823373,0.00018673185,0.000500189,0.00036145234,0.00025691304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019032856,0.0005920502,0.0006747542,0.0026243574,0.0022040787,0.0026011567,0.0007547113,0.0011220109,0.003965207],"category_scores_gemma":[0.0039030246,0.00051428727,0.0018729807,0.0014691141,0.005672398,0.0069467155,0.0042069997,0.0019100524,0.0006415332],"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.000012696506,0.00000902869,0.00022679227,0.0000212178,0.0000053820618,0.00008273527,0.00057746464,0.00049709424,0.00046103468,0.9952218,0.0003548066,0.002530017],"study_design_scores_gemma":[0.000004678276,0.000012952587,0.00020627835,0.000011040711,0.000005236368,0.00007531656,0.00009504884,0.0012056328,0.00020893793,0.99488646,0.003280158,0.0000083228615],"about_ca_topic_score_codex":0.0014299,"about_ca_topic_score_gemma":0.0010144482,"teacher_disagreement_score":0.003965207,"about_ca_system_score_codex":0.0015508964,"about_ca_system_score_gemma":0.0005536431,"threshold_uncertainty_score":0.0132648945},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96173793,0.00030360345,0.011716639,0.000115601186,0.000032931417,0.000031530843,0.00008601876,0.00009962623,0.025876196],"genre_scores_gemma":[0.98803526,0.00011802777,0.003939055,0.000059426304,0.000042604905,0.000058241112,0.00018413019,0.000025173576,0.0075379885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965405,0.00006127393,0.000024367577,0.00007481965,0.00008230821,0.0001031707],"domain_scores_gemma":[0.99967897,0.00008314322,0.0000670275,0.000049322214,0.000043745593,0.0000779089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043109283,0.0003505009,0.00030929907,0.0011561892,0.00089068495,0.0012541752,0.0005680629,0.00038482642,0.0044042193],"category_scores_gemma":[0.0008154382,0.0001556834,0.00042061874,0.00036736988,0.0014489659,0.0016544769,0.0017656679,0.0005063371,0.00051612617],"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.00041374908,0.00009341803,0.0045833616,0.000094506686,0.000025786128,0.0008277681,0.003941196,0.0020125934,0.056429967,0.91200864,0.00056968984,0.018999316],"study_design_scores_gemma":[0.00011366699,0.00033133078,0.006416039,0.00004553086,0.000034494915,0.0009030751,0.0014860068,0.014565158,0.043956712,0.9165616,0.015518089,0.00006837978],"about_ca_topic_score_codex":0.0007864206,"about_ca_topic_score_gemma":0.0007875376,"teacher_disagreement_score":0.0044042193,"about_ca_system_score_codex":0.0009287069,"about_ca_system_score_gemma":0.00030279582,"threshold_uncertainty_score":0.014733553},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51064384,0.00074282923,0.44995734,0.007592934,0.00026120036,0.00072799454,0.0025861242,0.0019374589,0.025550311],"genre_scores_gemma":[0.8685217,0.00040484773,0.12434493,0.0006051017,0.00023887907,0.00029463076,0.0025871922,0.00027902715,0.0027237006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99023575,0.001946523,0.0007834484,0.001611193,0.003720349,0.0017027867],"domain_scores_gemma":[0.947975,0.04042802,0.0026748653,0.004475039,0.003277279,0.001169677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057908115,0.00068913586,0.0015441218,0.0017294046,0.0028932847,0.0065693515,0.0034575448,0.002127541,0.009909406],"category_scores_gemma":[0.04204828,0.00093141716,0.0028361725,0.0016201332,0.003976247,0.011424294,0.004930622,0.0048309276,0.00086066365],"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.0015520278,0.00036535648,0.013833705,0.00084466866,0.00022317197,0.0009259422,0.0010168051,0.076577485,0.008795327,0.8054069,0.0097460365,0.08071261],"study_design_scores_gemma":[0.00013442514,0.000090350906,0.002297124,0.000088095636,0.000093531155,0.0004637307,0.00067503407,0.2213671,0.011968981,0.7593509,0.0033812663,0.000089463654],"about_ca_topic_score_codex":0.0028795744,"about_ca_topic_score_gemma":0.003203462,"teacher_disagreement_score":0.009909406,"about_ca_system_score_codex":0.00326005,"about_ca_system_score_gemma":0.0036659422,"threshold_uncertainty_score":0.033150315},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6110942,0.00050099316,0.34694645,0.00054756127,0.0002669616,0.00020933914,0.00045871412,0.002124273,0.037851524],"genre_scores_gemma":[0.9249049,0.0001744647,0.060367584,0.0001140903,0.0000900236,0.00021996221,0.00043542948,0.00012286416,0.013570801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937785,0.00015748573,0.000054885393,0.00012054267,0.00014693374,0.00014232658],"domain_scores_gemma":[0.99818987,0.00077805953,0.00027687513,0.0003077991,0.00018741509,0.0002599367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005363589,0.0006961829,0.00041409145,0.0007843812,0.0009985998,0.0013722746,0.0007102936,0.000520301,0.004855793],"category_scores_gemma":[0.0018045522,0.00025754387,0.0009225752,0.00043272038,0.0013829765,0.0021527084,0.001687803,0.0006570344,0.0009981674],"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.00043904627,0.00022076929,0.002620639,0.00021477835,0.000039452978,0.000704168,0.0022441342,0.020402206,0.027623493,0.902696,0.0026062753,0.04018884],"study_design_scores_gemma":[0.00017272582,0.00036114483,0.0007340018,0.000075860946,0.000056595174,0.00036075586,0.0003942158,0.079001956,0.038682736,0.8607576,0.019280542,0.00012174216],"about_ca_topic_score_codex":0.0006061069,"about_ca_topic_score_gemma":0.0008720979,"teacher_disagreement_score":0.004855793,"about_ca_system_score_codex":0.0005824996,"about_ca_system_score_gemma":0.0006591251,"threshold_uncertainty_score":0.016244233},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9026296,0.00035880072,0.07504315,0.002978139,0.000053993645,0.00018018713,0.0010118379,0.00060086616,0.017143365],"genre_scores_gemma":[0.9612658,0.00023850208,0.030293815,0.00022249695,0.00010202286,0.00014948199,0.0019557364,0.000108968154,0.0056632846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811006,0.00039784866,0.00016386595,0.0005411169,0.0003433106,0.00044384494],"domain_scores_gemma":[0.99437803,0.0035614439,0.00052957697,0.0008436427,0.00027379405,0.0004134167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022041188,0.0005896554,0.0009432233,0.0007535937,0.00202348,0.0037693994,0.0019535664,0.0012775644,0.0076269214],"category_scores_gemma":[0.00693142,0.0004753223,0.0018799199,0.0013348979,0.0026040557,0.010934317,0.0032180564,0.0026027472,0.00048463535],"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.0014599543,0.00053281727,0.015309878,0.0009496865,0.00015287717,0.00091206684,0.0029191985,0.08326325,0.013630675,0.8214265,0.008082734,0.051360406],"study_design_scores_gemma":[0.00011920426,0.000068592315,0.0020568287,0.000036766647,0.00006310505,0.00028210902,0.0005274402,0.0876812,0.0058131497,0.89848673,0.0048183487,0.00004664053],"about_ca_topic_score_codex":0.0034757657,"about_ca_topic_score_gemma":0.004287605,"teacher_disagreement_score":0.0076269214,"about_ca_system_score_codex":0.0044053216,"about_ca_system_score_gemma":0.0020213549,"threshold_uncertainty_score":0.03196299},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6070352,0.0022824728,0.29844168,0.005407544,0.00031187365,0.000086291235,0.0004486212,0.00030000735,0.085686356],"genre_scores_gemma":[0.93250155,0.0009782712,0.027511312,0.0006170501,0.0003613987,0.00007114388,0.00039201372,0.00010561456,0.0374616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992962,0.00017169586,0.00004522533,0.00016489642,0.00016707867,0.00015477413],"domain_scores_gemma":[0.9989619,0.0004849126,0.0001106636,0.00013083915,0.00015765682,0.00015404246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014197979,0.00038470444,0.0009186639,0.0012415856,0.001758577,0.0019547672,0.00068048073,0.0011600147,0.0076833344],"category_scores_gemma":[0.0037703805,0.00029705052,0.00069054245,0.00082133454,0.0028738861,0.009244985,0.003034866,0.0012708815,0.0007285581],"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.000032260206,0.000009751366,0.0003095889,0.000030484542,0.000007987788,0.00006899521,0.0002478956,0.0008762726,0.00033747093,0.9921705,0.00093588687,0.004972995],"study_design_scores_gemma":[0.00000825349,0.000010404048,0.000116128045,0.000009219884,0.0000047556405,0.00006547071,0.00015713082,0.0046899356,0.0003393775,0.9922139,0.0023778703,0.000007484449],"about_ca_topic_score_codex":0.00223163,"about_ca_topic_score_gemma":0.0012344263,"teacher_disagreement_score":0.0076833344,"about_ca_system_score_codex":0.0011288287,"about_ca_system_score_gemma":0.00077450526,"threshold_uncertainty_score":0.025703311},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6819102,0.0018251514,0.22348768,0.0015369792,0.00027416972,0.00023835232,0.00042119558,0.00064962625,0.08965667],"genre_scores_gemma":[0.9534869,0.00080024806,0.02226715,0.00031007375,0.00040719844,0.00022658108,0.0005282703,0.00012036855,0.021853277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993661,0.00012335426,0.000037092068,0.00018969245,0.00013697307,0.0001468089],"domain_scores_gemma":[0.998689,0.0005868291,0.00020726178,0.00022436751,0.00009796377,0.00019459304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005730811,0.0006812461,0.00060661376,0.0012409757,0.0017519088,0.001924983,0.0006551335,0.0014034008,0.0051375246],"category_scores_gemma":[0.0020210075,0.0002943478,0.0014550997,0.0008128622,0.0031201788,0.003628535,0.002234337,0.0015140552,0.0007121212],"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.00005561687,0.000038207603,0.0007994998,0.000050242204,0.000013831992,0.0005174544,0.0011558799,0.0035132128,0.0040087937,0.9840364,0.00058311643,0.005227702],"study_design_scores_gemma":[0.000040004077,0.00011024769,0.00060226186,0.00002404748,0.000016025628,0.00039574495,0.0003034208,0.013007523,0.0012640617,0.97494817,0.009262713,0.000025749674],"about_ca_topic_score_codex":0.0010935465,"about_ca_topic_score_gemma":0.0007670588,"teacher_disagreement_score":0.0051375246,"about_ca_system_score_codex":0.0008712822,"about_ca_system_score_gemma":0.0005278717,"threshold_uncertainty_score":0.01718676},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.508115,0.0014272244,0.23116167,0.001444225,0.0006515457,0.00013549434,0.00038009623,0.0007819709,0.25590274],"genre_scores_gemma":[0.9595174,0.00026444907,0.020340402,0.0002352007,0.00021847372,0.00006800291,0.00022516992,0.00011389605,0.019017031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808264,0.00054221915,0.00009603464,0.0004478138,0.00048318275,0.00034818714],"domain_scores_gemma":[0.9990734,0.00018029407,0.00009004337,0.00014041974,0.00031376266,0.00020214019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012897919,0.0003477507,0.0004947131,0.0013495956,0.0019492537,0.0035577947,0.0006834854,0.0006356294,0.005902938],"category_scores_gemma":[0.0024628171,0.00042703343,0.0008292632,0.00070630125,0.0041212277,0.0045020115,0.0031351934,0.0018893821,0.0010041642],"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.000027628254,0.000013203769,0.00013644506,0.00001544123,0.0000036474214,0.00006894694,0.00041537284,0.00014934738,0.001018585,0.99547946,0.00032037005,0.0023514414],"study_design_scores_gemma":[0.00002379915,0.000046866993,0.00021530934,0.000012726758,0.000008909434,0.00026505132,0.0003008869,0.0016693223,0.002413862,0.9837673,0.011259998,0.000015963815],"about_ca_topic_score_codex":0.0005893057,"about_ca_topic_score_gemma":0.00034300084,"teacher_disagreement_score":0.005902938,"about_ca_system_score_codex":0.0016207318,"about_ca_system_score_gemma":0.00065786456,"threshold_uncertainty_score":0.019747317},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8465689,0.0010171258,0.06439952,0.00022786076,0.00009530627,0.000058330545,0.00036816852,0.00024059114,0.087024115],"genre_scores_gemma":[0.97707707,0.00028982316,0.011987402,0.00004188128,0.000084920845,0.00004653571,0.0003781786,0.000024404499,0.010069781],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948394,0.00010476507,0.000041735228,0.00015263798,0.00014138989,0.00007553376],"domain_scores_gemma":[0.99930394,0.00021916699,0.00013846465,0.00011498428,0.00011345203,0.00011003858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004548526,0.00041544484,0.0004918819,0.0014420397,0.0008339543,0.0020392733,0.00056671014,0.00037745075,0.00469018],"category_scores_gemma":[0.00092375255,0.00029587361,0.0005234224,0.0008597784,0.0023397738,0.0025374903,0.0009969301,0.00078547915,0.0007685184],"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.00007713826,0.000020604746,0.0009555821,0.00005670574,0.00001833278,0.00025579383,0.0003466582,0.0016342174,0.004572935,0.98278964,0.00046669273,0.008805742],"study_design_scores_gemma":[0.000053285086,0.0001424148,0.003524394,0.00003999136,0.000034946344,0.0011097504,0.00045832858,0.006416498,0.0060735876,0.96846014,0.013637438,0.00004916292],"about_ca_topic_score_codex":0.00019438007,"about_ca_topic_score_gemma":0.00022206885,"teacher_disagreement_score":0.00469018,"about_ca_system_score_codex":0.00041795534,"about_ca_system_score_gemma":0.0002432224,"threshold_uncertainty_score":0.015690207},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5825431,0.0010477412,0.24401718,0.0020367585,0.00030150983,0.00011654421,0.00077190786,0.00043352437,0.1687317],"genre_scores_gemma":[0.95954114,0.0002905172,0.023409937,0.0001489168,0.000114593444,0.00006716837,0.000291091,0.000050344457,0.016086267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979225,0.00051038637,0.00013912348,0.00040644384,0.0007003021,0.00032132908],"domain_scores_gemma":[0.99811614,0.00036538005,0.00021807179,0.00032654474,0.00051000685,0.0004638522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012052957,0.00028762224,0.00043279998,0.0018186884,0.002204837,0.0049683442,0.0006393587,0.00052746205,0.0048479117],"category_scores_gemma":[0.0026370136,0.0003610954,0.00047884742,0.0009062993,0.0041689416,0.006510811,0.0038091,0.0014028824,0.0007329101],"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.000019373116,0.000009244455,0.0002684029,0.000011312099,0.0000035689934,0.000034557102,0.0002323589,0.00030807196,0.00042092364,0.99496526,0.00025192826,0.00347509],"study_design_scores_gemma":[0.0000104130095,0.000023147439,0.00028892787,0.000012454661,0.000008854945,0.00016127824,0.0003823389,0.0035343596,0.00096157816,0.97874063,0.01586017,0.000015851723],"about_ca_topic_score_codex":0.00079972344,"about_ca_topic_score_gemma":0.0006909298,"teacher_disagreement_score":0.0049683442,"about_ca_system_score_codex":0.0011924544,"about_ca_system_score_gemma":0.0008449809,"threshold_uncertainty_score":0.016217887},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75831777,0.00078181905,0.17467067,0.0005533186,0.000121277306,0.00008616999,0.00022295931,0.00032737583,0.0649186],"genre_scores_gemma":[0.97369653,0.00021464356,0.015483908,0.00009082931,0.00012487707,0.0000819456,0.00015522556,0.00002143358,0.010130615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994209,0.0001232988,0.000037273818,0.00012494343,0.00019375439,0.000099900135],"domain_scores_gemma":[0.9990294,0.00027464805,0.00020805001,0.00008606948,0.00023080816,0.0001710477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058930425,0.00028210346,0.0003097039,0.0010085846,0.0007863719,0.0010807368,0.00043785668,0.00028132965,0.004313287],"category_scores_gemma":[0.0013838111,0.0001255247,0.0003287077,0.0003142851,0.0015102805,0.0015477836,0.0016279961,0.00060205825,0.000681412],"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.000027998043,0.000015780455,0.00060448935,0.000052071315,0.000007123317,0.00035516376,0.0008632846,0.0007061982,0.0077592917,0.9830063,0.00029980694,0.0063024955],"study_design_scores_gemma":[0.000018151532,0.00007408202,0.0005313876,0.000020510242,0.000009157399,0.0006348853,0.00056683255,0.00843549,0.008616647,0.9722755,0.008801397,0.000016071599],"about_ca_topic_score_codex":0.00013496431,"about_ca_topic_score_gemma":0.00016025141,"teacher_disagreement_score":0.004313287,"about_ca_system_score_codex":0.00048643758,"about_ca_system_score_gemma":0.0003620835,"threshold_uncertainty_score":0.01442939},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006141857,0.004438429,0.0032924442,0.12242781,0.84823465,0.000046966434,0.0005728265,0.0005594505,0.019813191],"genre_scores_gemma":[0.033525944,0.01583363,0.00809411,0.18189909,0.35969228,0.0002999627,0.0018480077,0.0010800784,0.39772692],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99804664,0.00044139684,0.00021371382,0.00034043557,0.0008296168,0.00012816099],"domain_scores_gemma":[0.9922652,0.0025324037,0.00026106523,0.0005331534,0.004123672,0.00028439923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001913385,0.0015990448,0.0013264352,0.0027327687,0.002934098,0.0030321172,0.002446507,0.0032825728,0.030064212],"category_scores_gemma":[0.017487038,0.0006922161,0.0013552384,0.0018498852,0.00271787,0.0028982083,0.0014623704,0.0050027207,0.013958907],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000024678837,0.0000070998153,0.000045603065,0.00013343364,0.000011425876,0.0001606015,0.000038551745,0.000050606974,0.00007015143,0.0049815006,0.9895477,0.0049284482],"study_design_scores_gemma":[0.000056514018,0.000055273093,0.0018811122,0.0002846701,0.00009339622,0.0007244305,0.0001562612,0.00096965814,0.00079392246,0.022165267,0.9727533,0.00006621862],"about_ca_topic_score_codex":0.011982892,"about_ca_topic_score_gemma":0.013194022,"teacher_disagreement_score":0.030064212,"about_ca_system_score_codex":0.002864962,"about_ca_system_score_gemma":0.0018868848,"threshold_uncertainty_score":0.10057485},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7043965,0.0015106517,0.24016641,0.0004307897,0.00024330521,0.00010104861,0.00032089837,0.00020151513,0.052628823],"genre_scores_gemma":[0.9132595,0.0006585885,0.063261464,0.00016174845,0.00017659208,0.00013646224,0.00030075238,0.00007572515,0.021969235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943393,0.00011767192,0.000045573935,0.00010770589,0.00019046271,0.00010446722],"domain_scores_gemma":[0.9994154,0.00012192595,0.00009265037,0.000102167156,0.000118674434,0.00014913654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075211405,0.00037496342,0.00034671836,0.0013984619,0.0009971405,0.0017851883,0.0005982313,0.00042415675,0.004776743],"category_scores_gemma":[0.0010062036,0.00030238414,0.00050263223,0.0006270476,0.002026016,0.0034785464,0.0017232086,0.0012898245,0.0008258746],"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.000014353858,0.0000072905295,0.0002190547,0.000019010802,0.0000027582307,0.000057490222,0.00036109262,0.00045486056,0.0019805424,0.9926319,0.00016990973,0.00408167],"study_design_scores_gemma":[0.000016067086,0.00005312441,0.00071000063,0.000024176756,0.000011390098,0.0002646044,0.00049045536,0.008069402,0.006940316,0.9678852,0.015506052,0.000029216546],"about_ca_topic_score_codex":0.0006080533,"about_ca_topic_score_gemma":0.00083898933,"teacher_disagreement_score":0.004776743,"about_ca_system_score_codex":0.0005969691,"about_ca_system_score_gemma":0.0004009192,"threshold_uncertainty_score":0.015979826},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059267912,0.14369345,0.29775965,0.036495484,0.0031941128,0.00011636264,0.00065749756,0.0005502286,0.4582653],"genre_scores_gemma":[0.8123293,0.04382835,0.081802465,0.005618078,0.00413528,0.0002274224,0.0006161058,0.00021139714,0.051231485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985594,0.0005775148,0.00011116024,0.0003258167,0.00031353126,0.0001125534],"domain_scores_gemma":[0.9973917,0.0018062589,0.00012462055,0.0002559168,0.00029126363,0.00013016503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017988698,0.0005657373,0.0005954471,0.002082089,0.0020492023,0.0046826047,0.0007651763,0.0015067412,0.008235522],"category_scores_gemma":[0.00317344,0.00035087066,0.0007224855,0.0017710952,0.007890129,0.009707917,0.0030133128,0.0030261169,0.0013359218],"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.0000041672365,0.000002721969,0.000047988455,0.000038847007,0.000002154717,0.000017422619,0.00021260972,0.00012374231,0.000091027796,0.99542576,0.0008193229,0.00321428],"study_design_scores_gemma":[0.0000025769727,0.0000067438014,0.00008463977,0.000031591364,0.0000026235095,0.000063573636,0.00008448243,0.00032392037,0.000091538444,0.9766286,0.02267556,0.000004129045],"about_ca_topic_score_codex":0.0015836157,"about_ca_topic_score_gemma":0.0012351224,"teacher_disagreement_score":0.008235522,"about_ca_system_score_codex":0.0021967764,"about_ca_system_score_gemma":0.0009330044,"threshold_uncertainty_score":0.027550519},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.343344,0.004498282,0.44264534,0.0046011806,0.00072345807,0.00011285172,0.00030709573,0.00036844335,0.20339926],"genre_scores_gemma":[0.9441099,0.0013072112,0.029091226,0.0006442547,0.0007492568,0.00013639776,0.000181072,0.00008569893,0.023694998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893576,0.00032263415,0.000044837612,0.00010794107,0.0004179092,0.00017086539],"domain_scores_gemma":[0.99906737,0.00041838817,0.00011378757,0.00012372699,0.00015919043,0.000117591415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001546812,0.0007869723,0.0007474494,0.001811247,0.0014507074,0.0022865238,0.0012128905,0.0011342695,0.0035750195],"category_scores_gemma":[0.0016378881,0.00029506767,0.0007550828,0.0010602747,0.005970567,0.0062886383,0.0021640789,0.0018279969,0.00059595413],"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.000003903872,0.0000052457044,0.000060911585,0.000018073022,0.0000016199511,0.000051898063,0.00012141879,0.00040936636,0.00029564917,0.9977386,0.0001632017,0.0011302483],"study_design_scores_gemma":[0.0000051097577,0.000013388811,0.000055569908,0.000011136581,0.0000035870332,0.000069169946,0.000076549906,0.0024390616,0.0002510509,0.9948768,0.0021921608,0.0000064803603],"about_ca_topic_score_codex":0.00044186012,"about_ca_topic_score_gemma":0.0006104317,"teacher_disagreement_score":0.0035750195,"about_ca_system_score_codex":0.0009767574,"about_ca_system_score_gemma":0.00063680427,"threshold_uncertainty_score":0.011959672},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019717354,0.100966945,0.17869471,0.017434709,0.004389792,0.00012304621,0.0014265398,0.0006632881,0.67658365],"genre_scores_gemma":[0.676537,0.029117677,0.08382786,0.00588091,0.00407824,0.0005053001,0.0016370834,0.00039313125,0.19802293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987079,0.0005615875,0.00006479147,0.00022667758,0.00031965013,0.00011935776],"domain_scores_gemma":[0.9992762,0.00019391933,0.00007331449,0.00017529412,0.00019464156,0.00008666706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001405488,0.0004905148,0.0005588234,0.0019509001,0.0016698287,0.008734321,0.0008741187,0.0009550697,0.009941458],"category_scores_gemma":[0.0017202359,0.00028237147,0.0006853075,0.002137957,0.0063791173,0.008088407,0.0022126304,0.0024351382,0.0025858989],"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.0000021617777,0.0000017151948,0.00005847746,0.000018390117,0.0000020970842,0.0000082137285,0.00023590274,0.00008043987,0.00006321486,0.99221414,0.003671024,0.0036441688],"study_design_scores_gemma":[0.0000018732788,0.0000058896026,0.00014978315,0.0000320842,0.0000024711296,0.00006423756,0.00023406901,0.00027341102,0.000053331503,0.8683961,0.13078406,0.000002712318],"about_ca_topic_score_codex":0.0019764681,"about_ca_topic_score_gemma":0.0015369745,"teacher_disagreement_score":0.009941458,"about_ca_system_score_codex":0.003507606,"about_ca_system_score_gemma":0.0018160708,"threshold_uncertainty_score":0.033257484},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3162942,0.014994371,0.5398717,0.005685559,0.00025642946,0.00006758815,0.00029196677,0.00056615815,0.12197211],"genre_scores_gemma":[0.923198,0.0031492694,0.058442056,0.0002969956,0.00037173484,0.00010856072,0.00013907618,0.000083889776,0.014210344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999132,0.0002573642,0.00006130211,0.00018872587,0.00027240018,0.000088200984],"domain_scores_gemma":[0.99776745,0.0014967681,0.00018564601,0.00019254029,0.00023377122,0.00012381253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010227239,0.00040465407,0.0006649278,0.0014808627,0.0009315237,0.0025393725,0.00069690414,0.0006164341,0.0030170556],"category_scores_gemma":[0.0027084113,0.00033671307,0.0008841547,0.0015415186,0.0037935528,0.0042695315,0.0017390505,0.0017889666,0.0003275128],"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.00000863496,0.000005003082,0.00015202216,0.00003098539,0.0000062525114,0.00003448945,0.00015968336,0.002160588,0.00058316626,0.99235946,0.00021981668,0.0042798454],"study_design_scores_gemma":[0.0000031425222,0.000008471704,0.00008863638,0.000006822218,0.000003951523,0.000030736675,0.00002780452,0.008219657,0.00032860128,0.9889331,0.0023448258,0.0000042520232],"about_ca_topic_score_codex":0.0013642352,"about_ca_topic_score_gemma":0.0010513915,"teacher_disagreement_score":0.0030170556,"about_ca_system_score_codex":0.0024675746,"about_ca_system_score_gemma":0.00060887396,"threshold_uncertainty_score":0.017903566},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78358424,0.00404817,0.1296042,0.0019993088,0.00031480263,0.000090859554,0.0006196743,0.00048857566,0.07925014],"genre_scores_gemma":[0.9722334,0.0006144287,0.016880507,0.0001396871,0.00021747696,0.000090903064,0.00034688582,0.00005936073,0.009417382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867296,0.00037114747,0.00012217443,0.00031926943,0.0003236422,0.00019077233],"domain_scores_gemma":[0.9975164,0.0011273513,0.00032072997,0.00027636843,0.00026413114,0.0004951071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017300452,0.0005835173,0.0005289365,0.0016586337,0.0014753304,0.004681327,0.0005799803,0.00079547596,0.0050631897],"category_scores_gemma":[0.0029085085,0.00060391106,0.00074455276,0.0010999888,0.0038626078,0.01093398,0.002901807,0.0011493537,0.0007998645],"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.000078065255,0.000016568161,0.0004959839,0.00005293854,0.000008446983,0.00025976106,0.0016799904,0.00056870835,0.0014595335,0.9902559,0.00036223256,0.0047620954],"study_design_scores_gemma":[0.000029719013,0.00006187238,0.0004672691,0.000022275648,0.000013173164,0.00039660247,0.0005289851,0.002739838,0.0014664948,0.9813887,0.0128690945,0.000015954813],"about_ca_topic_score_codex":0.00038501903,"about_ca_topic_score_gemma":0.00035265306,"teacher_disagreement_score":0.0050631897,"about_ca_system_score_codex":0.000880587,"about_ca_system_score_gemma":0.00035561013,"threshold_uncertainty_score":0.01693803},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8317638,0.00043175803,0.13449235,0.00018981496,0.000045454002,0.000059743314,0.00042679792,0.00034151823,0.03224881],"genre_scores_gemma":[0.97009295,0.00018625965,0.022932371,0.000029596402,0.000035619305,0.000051670624,0.00073151034,0.0000438758,0.005896105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964464,0.000049297763,0.000019874493,0.0000976496,0.000117189695,0.00007132434],"domain_scores_gemma":[0.9996728,0.00010551379,0.00004473209,0.000046616464,0.000048131467,0.000082233724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038454382,0.0002765932,0.00035022534,0.0012037267,0.00085289247,0.0022061183,0.00037997382,0.00022642444,0.004476144],"category_scores_gemma":[0.0005893877,0.0001907937,0.0005461122,0.00071988965,0.0013282147,0.001934505,0.0008887969,0.00072821695,0.0006313259],"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.00031260488,0.00006149014,0.0031075755,0.00006816191,0.000021780705,0.0005464762,0.001113099,0.0031312243,0.018930657,0.94822276,0.00097583816,0.023508368],"study_design_scores_gemma":[0.000057241396,0.00016197536,0.0069711194,0.000038650363,0.000040428047,0.0017255389,0.0009356173,0.025815692,0.029173348,0.91413087,0.020887686,0.000061778075],"about_ca_topic_score_codex":0.00037331966,"about_ca_topic_score_gemma":0.0002963346,"teacher_disagreement_score":0.004476144,"about_ca_system_score_codex":0.00049914187,"about_ca_system_score_gemma":0.0002424683,"threshold_uncertainty_score":0.014974117},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56682295,0.0016024592,0.35992098,0.009001725,0.00024921555,0.00023721714,0.0034518102,0.001718978,0.056994714],"genre_scores_gemma":[0.9538783,0.00046293598,0.03590884,0.0008608482,0.00021906277,0.00025851664,0.0016793099,0.0001598518,0.00657241],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976427,0.00044706717,0.00012890474,0.00083422515,0.0005144703,0.0004325244],"domain_scores_gemma":[0.9919139,0.0054783304,0.0005334742,0.000974455,0.00048584497,0.0006139021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011245282,0.0003889624,0.00078491727,0.0008762777,0.0019729966,0.0041734376,0.001193522,0.0012282991,0.008576407],"category_scores_gemma":[0.008262782,0.00054551027,0.0013398291,0.0013304669,0.0022617867,0.0072177993,0.0025419272,0.0057242513,0.0005887665],"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.00023986517,0.000166638,0.0014799234,0.00020063417,0.000036743244,0.0002711628,0.000641477,0.01044011,0.0033225098,0.9583949,0.00657671,0.018229324],"study_design_scores_gemma":[0.000051335213,0.000029981797,0.00054152607,0.000022506227,0.000020580204,0.0002475089,0.000228206,0.034120962,0.0014953924,0.9573466,0.00587671,0.000018572144],"about_ca_topic_score_codex":0.0017662512,"about_ca_topic_score_gemma":0.0015683449,"teacher_disagreement_score":0.008576407,"about_ca_system_score_codex":0.002198055,"about_ca_system_score_gemma":0.0012955342,"threshold_uncertainty_score":0.028690875},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37722212,0.0036055676,0.46207488,0.008628979,0.0005931396,0.000069704765,0.0003643627,0.0005429019,0.14689836],"genre_scores_gemma":[0.97415656,0.0005166588,0.019802358,0.0005512265,0.00010073344,0.000024803168,0.000101227866,0.00003653832,0.0047099134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989812,0.00027418073,0.00006906989,0.00022732484,0.00024502396,0.00020317694],"domain_scores_gemma":[0.9982943,0.000816621,0.00017243433,0.00025435796,0.00025812536,0.00020417412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018622571,0.00029693867,0.0004850985,0.0008815238,0.0016285628,0.0050939913,0.0008627376,0.0012183865,0.0044489205],"category_scores_gemma":[0.004019919,0.00019695483,0.0008764902,0.0007721595,0.006971991,0.010917702,0.0017343856,0.0017092559,0.0010510425],"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.000012051941,0.000006760262,0.00020410164,0.000019835283,0.0000051984252,0.000046386383,0.00033443677,0.00022507005,0.00040753072,0.99559194,0.00021593376,0.0029306877],"study_design_scores_gemma":[0.0000034141813,0.000012487057,0.00011326192,0.000016374652,0.000008155854,0.00011953857,0.00024363807,0.0010607779,0.0007154477,0.9938292,0.003866949,0.000010850061],"about_ca_topic_score_codex":0.0013162306,"about_ca_topic_score_gemma":0.0007043331,"teacher_disagreement_score":0.0050939913,"about_ca_system_score_codex":0.00088811584,"about_ca_system_score_gemma":0.0006219794,"threshold_uncertainty_score":0.014883101},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7102164,0.001186937,0.19038707,0.0026212027,0.00037202737,0.000117638054,0.00036474506,0.00070546294,0.09402856],"genre_scores_gemma":[0.9839802,0.00023100509,0.0080319345,0.00016415415,0.00018886334,0.00010052137,0.00015671886,0.000060467773,0.007086207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832064,0.00024665162,0.00012157643,0.00044285523,0.00051168504,0.00035645504],"domain_scores_gemma":[0.99247825,0.003769572,0.00071764784,0.0013166938,0.0005836809,0.0011341322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013613806,0.0005806922,0.0010035837,0.0013324489,0.0022660173,0.003604788,0.0008569346,0.0010768895,0.0063884603],"category_scores_gemma":[0.005012843,0.00045359303,0.0012514157,0.00094965176,0.006480369,0.011851993,0.004280598,0.0034565197,0.0006215693],"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.00013398592,0.000030727486,0.0016903239,0.000074680655,0.000014603638,0.0002439031,0.0007940285,0.0011480853,0.0028933536,0.9866219,0.000859458,0.005494892],"study_design_scores_gemma":[0.00006119864,0.00013568037,0.001970966,0.000026531037,0.000036860176,0.00045730898,0.000698461,0.006311911,0.005989643,0.97705305,0.00721273,0.000045689027],"about_ca_topic_score_codex":0.00059062993,"about_ca_topic_score_gemma":0.00039131142,"teacher_disagreement_score":0.0063884603,"about_ca_system_score_codex":0.0011193143,"about_ca_system_score_gemma":0.0005526387,"threshold_uncertainty_score":0.021371484},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.617875,0.0011846815,0.34826654,0.0052376464,0.00019685598,0.00040355834,0.002027421,0.0016040698,0.023204224],"genre_scores_gemma":[0.8371969,0.00057995017,0.14737709,0.0006232935,0.00018060957,0.0003566724,0.0026460167,0.0005260745,0.0105133755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981969,0.0003949541,0.0001747928,0.00035053605,0.000599448,0.0002833176],"domain_scores_gemma":[0.9884013,0.008815015,0.00072846847,0.0012704236,0.00054442196,0.0002402439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013352355,0.0005477222,0.0008290033,0.00095197675,0.0008372954,0.002036513,0.0012031858,0.0009971595,0.008151282],"category_scores_gemma":[0.016025372,0.000339956,0.0011930601,0.0019383646,0.0015298176,0.0059385886,0.0026095184,0.0025147386,0.0005963384],"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.001041041,0.00031018315,0.0056965654,0.0013642783,0.00016531242,0.0015569689,0.0033141342,0.13132088,0.015318793,0.6255899,0.011186005,0.20313586],"study_design_scores_gemma":[0.000099803765,0.00013949031,0.0008951037,0.00010415657,0.00006907544,0.00044027553,0.0005696515,0.28957993,0.015623063,0.68286717,0.009566169,0.000046058416],"about_ca_topic_score_codex":0.0014870663,"about_ca_topic_score_gemma":0.0016951866,"teacher_disagreement_score":0.008151282,"about_ca_system_score_codex":0.0020656383,"about_ca_system_score_gemma":0.0015181965,"threshold_uncertainty_score":0.027268767},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0110338805,0.0018305364,0.93012166,0.0017755829,0.00044062993,0.00010733081,0.0002969448,0.0007640292,0.053629365],"genre_scores_gemma":[0.5096229,0.0043077595,0.45104828,0.0022313776,0.0020359838,0.0005662648,0.000706803,0.0004142131,0.029066427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822074,0.00042119622,0.00015744881,0.00042813257,0.00058886874,0.00018358282],"domain_scores_gemma":[0.99633336,0.0020962737,0.00018583234,0.00044104902,0.00071279693,0.00023061442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029035637,0.0011032142,0.0006328841,0.0028852758,0.00218707,0.003117426,0.0016035639,0.0012441019,0.011300075],"category_scores_gemma":[0.004249911,0.00079613,0.0018299774,0.0013303777,0.003909086,0.010265536,0.003642256,0.005198346,0.0026794688],"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.00001465144,0.00002448248,0.000099659344,0.000094162024,0.0000061895444,0.00016511125,0.000283421,0.00044483176,0.0014745716,0.98500174,0.0011555968,0.011235518],"study_design_scores_gemma":[0.000009879714,0.000045211513,0.00009347001,0.000039352584,0.000015206857,0.00041274188,0.00008231905,0.003885793,0.0030691552,0.9707182,0.021603756,0.000024807485],"about_ca_topic_score_codex":0.00045732595,"about_ca_topic_score_gemma":0.00040686136,"teacher_disagreement_score":0.011300075,"about_ca_system_score_codex":0.0011295484,"about_ca_system_score_gemma":0.00063472864,"threshold_uncertainty_score":0.037802577},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5846296,0.0002687493,0.32273403,0.0011617868,0.00048556662,0.000101426136,0.000093635186,0.00049400027,0.090031244],"genre_scores_gemma":[0.9763442,0.00012732882,0.010736314,0.00029463277,0.0001683654,0.00005137411,0.00005534212,0.000061955885,0.012160426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919266,0.00016800979,0.000046845413,0.00016328249,0.00023292172,0.00019633457],"domain_scores_gemma":[0.9990707,0.00023450311,0.00014095669,0.00015759085,0.00020582811,0.00019047211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001267542,0.00030421105,0.00041104306,0.0006985219,0.0014702945,0.0016545099,0.0006031193,0.00073507597,0.0051270504],"category_scores_gemma":[0.002462618,0.00017324356,0.0005209824,0.00042668267,0.002869743,0.0037196334,0.002402356,0.0011899009,0.0010730461],"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.00003519877,0.000042211384,0.00031035728,0.000022709653,0.0000051982242,0.0002669045,0.00068021496,0.00039555496,0.002531757,0.98983824,0.00048106405,0.0053904937],"study_design_scores_gemma":[0.000021171601,0.00007444399,0.00021709182,0.000009972195,0.000009281103,0.0003577843,0.00023595925,0.0057158996,0.0052673584,0.9846674,0.0034079757,0.000015782329],"about_ca_topic_score_codex":0.00033184476,"about_ca_topic_score_gemma":0.00019275589,"teacher_disagreement_score":0.0051270504,"about_ca_system_score_codex":0.0005048012,"about_ca_system_score_gemma":0.0006422211,"threshold_uncertainty_score":0.017151654},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96810806,0.00025937278,0.023250947,0.00014464895,0.00003938411,0.000019709238,0.00010084986,0.00009026236,0.007986831],"genre_scores_gemma":[0.993576,0.00016464414,0.0038738062,0.00002256764,0.000072480914,0.00001887144,0.00014341534,0.000015670865,0.0021125933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990988,0.00016441291,0.00005809002,0.00015327278,0.000308624,0.00021680888],"domain_scores_gemma":[0.9964258,0.0011098537,0.00078046834,0.0003798363,0.00035785508,0.0009461363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017016107,0.00049887697,0.00070327276,0.0043440503,0.0013788536,0.0022237771,0.0010759045,0.0008485294,0.0030809448],"category_scores_gemma":[0.0079049235,0.00034128904,0.00061455485,0.0011802579,0.0029796145,0.004199681,0.0012669651,0.0008303619,0.0002545034],"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.00021313153,0.000099897596,0.013457642,0.00011978592,0.000025232233,0.00034227507,0.0004845153,0.012350586,0.010329437,0.9438563,0.0009884601,0.017732756],"study_design_scores_gemma":[0.000026477539,0.00009192766,0.0112226615,0.00006169223,0.00002058045,0.0005017402,0.00022513505,0.095247425,0.006437138,0.88460124,0.001502573,0.00006135639],"about_ca_topic_score_codex":0.00082655926,"about_ca_topic_score_gemma":0.0009639068,"teacher_disagreement_score":0.0043440503,"about_ca_system_score_codex":0.0013722498,"about_ca_system_score_gemma":0.00035089543,"threshold_uncertainty_score":0.010306776},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8032866,0.0006643402,0.1655202,0.0006871853,0.00006191442,0.000036561505,0.00014036593,0.0003017504,0.029300967],"genre_scores_gemma":[0.97859323,0.00014307156,0.014344729,0.00009034984,0.00004840226,0.000034105782,0.00014011135,0.000024052686,0.006581935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997203,0.00007408593,0.0000166121,0.00007376846,0.00005953909,0.000055642537],"domain_scores_gemma":[0.9994198,0.0001818476,0.00011386854,0.00011477257,0.00008206572,0.000087623346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037528257,0.00021017308,0.000234072,0.000680482,0.00062673155,0.001107579,0.0005028726,0.0003996363,0.0025318577],"category_scores_gemma":[0.0010295288,0.00015505656,0.00031412634,0.0003802012,0.0018651152,0.0027124148,0.0011571627,0.0005317967,0.00027397962],"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.00003033953,0.00000746035,0.00036349136,0.00001627147,0.0000026507203,0.00008730942,0.0004923883,0.00092722476,0.0018419283,0.9923855,0.00016719112,0.0036782238],"study_design_scores_gemma":[0.000010990011,0.000036545927,0.00030670027,0.000013000528,0.0000067010837,0.00013109359,0.0003512326,0.006702551,0.0022164907,0.9856446,0.0045697684,0.0000103618995],"about_ca_topic_score_codex":0.0006344643,"about_ca_topic_score_gemma":0.00055650884,"teacher_disagreement_score":0.0025318577,"about_ca_system_score_codex":0.00053309643,"about_ca_system_score_gemma":0.00029423978,"threshold_uncertainty_score":0.00846988},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46863312,0.0023374013,0.43920496,0.0009216489,0.00041025743,0.00010297923,0.00047661137,0.0008585135,0.087054424],"genre_scores_gemma":[0.93765926,0.0007627482,0.05052581,0.0001833905,0.00023748886,0.000021891303,0.00019870319,0.000104987594,0.010305717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995931,0.00009095921,0.000014342197,0.00007928346,0.0001228798,0.000099555145],"domain_scores_gemma":[0.99937135,0.0002472604,0.00008481504,0.000108778455,0.00010967972,0.000078063924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047809348,0.0003713587,0.00030208964,0.0014436294,0.000780899,0.0010194611,0.0005487909,0.00030637273,0.008893255],"category_scores_gemma":[0.0020718046,0.00014855264,0.00040705435,0.00091921684,0.0018099869,0.0029755954,0.0015196985,0.0010894093,0.0015656762],"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.000100025725,0.000031430067,0.0012853121,0.00011071691,0.000014426227,0.00017500235,0.00034281655,0.005022559,0.0038963489,0.9368328,0.0014920465,0.05069663],"study_design_scores_gemma":[0.000019124978,0.000083065774,0.0016220869,0.00003247354,0.000012222372,0.00030977032,0.00027909296,0.010903868,0.008035915,0.9638373,0.014813908,0.000051133968],"about_ca_topic_score_codex":0.0009739849,"about_ca_topic_score_gemma":0.0011881669,"teacher_disagreement_score":0.008893255,"about_ca_system_score_codex":0.00046924927,"about_ca_system_score_gemma":0.00039681455,"threshold_uncertainty_score":0.029750884},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80214816,0.0008683277,0.17821811,0.0032685061,0.00012553061,0.00029894736,0.00084589905,0.00076516654,0.013461294],"genre_scores_gemma":[0.91952866,0.00046607907,0.07097524,0.00030864755,0.00019649205,0.00023353152,0.00126062,0.00026385122,0.0067667873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99712473,0.0006598097,0.0002952129,0.0008036027,0.00045979407,0.0006568281],"domain_scores_gemma":[0.98150796,0.014478373,0.0010770235,0.0018190455,0.0004088101,0.00070872315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003566301,0.00084227667,0.0017968665,0.0010794351,0.0029733188,0.007426928,0.0024645787,0.002664134,0.008946897],"category_scores_gemma":[0.017465807,0.0010409058,0.003168886,0.0017407426,0.00438931,0.021844013,0.00501344,0.0039674486,0.0007550195],"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.0017050297,0.0004279474,0.0057980716,0.0007424147,0.00015658734,0.0007278957,0.0027486861,0.033908322,0.0103901215,0.89439654,0.005417951,0.04358034],"study_design_scores_gemma":[0.00011711362,0.000090555026,0.00049297104,0.000031909385,0.00007474485,0.00022080498,0.00040429292,0.046592414,0.0064282096,0.94330156,0.0021960344,0.00004937389],"about_ca_topic_score_codex":0.0021541254,"about_ca_topic_score_gemma":0.001436328,"teacher_disagreement_score":0.008946897,"about_ca_system_score_codex":0.00350053,"about_ca_system_score_gemma":0.0019932599,"threshold_uncertainty_score":0.029930353},"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003854887,0.5300739,0.18099983,0.04252206,0.010275479,0.00005437278,0.00031126518,0.00048126132,0.23142703],"genre_scores_gemma":[0.15698296,0.5129355,0.10653713,0.03398368,0.04733152,0.0002871513,0.0008499688,0.00118705,0.139905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913305,0.0003248686,0.000056856818,0.00017446153,0.00023239575,0.00007849901],"domain_scores_gemma":[0.9993075,0.00036522077,0.000041734944,0.000055749242,0.0001531781,0.000076607714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014637705,0.00071641296,0.000863881,0.0041628033,0.0012456231,0.003927389,0.0010726721,0.0017108651,0.007881657],"category_scores_gemma":[0.0019706863,0.00051160576,0.00075484795,0.0048801024,0.0041284063,0.011659893,0.0021923115,0.0033734094,0.0028312586],"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.000008526385,0.000006291563,0.000058485944,0.000184196,0.0000061833207,0.000026748487,0.00029997894,0.00019085144,0.00017887724,0.94499326,0.034077916,0.019968715],"study_design_scores_gemma":[0.000003990658,0.000011059924,0.000106096064,0.00017807509,0.000007301691,0.00013044963,0.00011138799,0.00033450674,0.0001360841,0.5405933,0.45837486,0.000012921683],"about_ca_topic_score_codex":0.0015042716,"about_ca_topic_score_gemma":0.0012171767,"teacher_disagreement_score":0.007881657,"about_ca_system_score_codex":0.0021585925,"about_ca_system_score_gemma":0.0009878173,"threshold_uncertainty_score":0.02636683},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99031013,0.00008303629,0.004558444,0.00006566769,0.000020144516,0.000015265874,0.000039751638,0.000058513495,0.004848915],"genre_scores_gemma":[0.9962793,0.00006791118,0.0012458699,0.000016315682,0.00003307562,0.000010481134,0.000079618905,0.000010258885,0.0022571108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944586,0.00007834631,0.000041277413,0.000091734764,0.00016051519,0.00018232156],"domain_scores_gemma":[0.99892896,0.00017117836,0.0002667748,0.000100090656,0.0001558607,0.00037714568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005697794,0.0005824116,0.0005513797,0.0024185784,0.0011246846,0.0017889838,0.00056441594,0.00047280642,0.0020896252],"category_scores_gemma":[0.0013103499,0.00030033733,0.0005342507,0.00096341246,0.0026210023,0.0025674906,0.0013583442,0.0007120774,0.00027546816],"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.00034487896,0.00024359251,0.019085001,0.00011967132,0.00006600917,0.0009110898,0.0032611967,0.004373634,0.022159306,0.927009,0.0008617437,0.021564905],"study_design_scores_gemma":[0.000090221845,0.00035177145,0.0143158445,0.00004884904,0.00006772619,0.0009025829,0.00089824817,0.011670414,0.007572662,0.96064854,0.0033610726,0.0000719863],"about_ca_topic_score_codex":0.0007828257,"about_ca_topic_score_gemma":0.0009774733,"teacher_disagreement_score":0.0024185784,"about_ca_system_score_codex":0.0007610672,"about_ca_system_score_gemma":0.0003039739,"threshold_uncertainty_score":0.0069904923},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9190596,0.0010548243,0.050977618,0.00020250386,0.00008899635,0.000048293587,0.00014313379,0.00030127412,0.02812376],"genre_scores_gemma":[0.9822129,0.0002155228,0.010403277,0.000039711063,0.00007292033,0.000046401667,0.00019882762,0.000029828281,0.006780672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995091,0.00010632454,0.000049528895,0.000112595364,0.00015473376,0.00006760913],"domain_scores_gemma":[0.99923074,0.00024052271,0.00009859499,0.00007310109,0.00014132929,0.0002157813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006305306,0.00038031736,0.0004256768,0.0016188024,0.001382999,0.0021821298,0.00052884396,0.00030589118,0.0024409834],"category_scores_gemma":[0.0011819657,0.0002596024,0.00068096304,0.00047256265,0.001963097,0.003053402,0.0016073817,0.00061335205,0.00032191403],"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.00017379016,0.000059005088,0.002783438,0.00008560352,0.000029892228,0.0011818069,0.002184812,0.0013263053,0.0168205,0.9608102,0.00070507795,0.013839511],"study_design_scores_gemma":[0.00007428485,0.00026586218,0.003952096,0.00006386677,0.000054196305,0.0028375895,0.0013102568,0.0099677555,0.019776527,0.942271,0.019349832,0.000076754885],"about_ca_topic_score_codex":0.00019242756,"about_ca_topic_score_gemma":0.00020536807,"teacher_disagreement_score":0.0024409834,"about_ca_system_score_codex":0.0006062178,"about_ca_system_score_gemma":0.00023538795,"threshold_uncertainty_score":0.008165896},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70358616,0.00088498637,0.26761347,0.00023109687,0.00012776944,0.000065715154,0.00012384336,0.00028220683,0.027084772],"genre_scores_gemma":[0.95694065,0.0005513265,0.033509027,0.000062870546,0.00014351109,0.000069987356,0.00020764415,0.00006500759,0.008449981],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992093,0.00014329316,0.00006690317,0.00018361853,0.00023343929,0.00016331853],"domain_scores_gemma":[0.9970348,0.0012375549,0.00061395095,0.0003742792,0.0003650498,0.00037432162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001109871,0.00054170866,0.0004377317,0.00096804975,0.0010968383,0.0014739563,0.0005704511,0.00049110845,0.0022510707],"category_scores_gemma":[0.0029187528,0.0003199476,0.00068143796,0.00055112905,0.0029855699,0.0030149908,0.0015360584,0.000871729,0.00073255535],"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.00017453302,0.00007910907,0.0020827006,0.00014915438,0.000017640194,0.001337966,0.002617182,0.0041754358,0.018356306,0.95059097,0.00042196436,0.019996986],"study_design_scores_gemma":[0.000042598323,0.00037536732,0.0019534645,0.000054653057,0.000029113211,0.0010575844,0.0006436662,0.026455263,0.016489392,0.9421444,0.0107033355,0.00005113739],"about_ca_topic_score_codex":0.00038811273,"about_ca_topic_score_gemma":0.00039903444,"teacher_disagreement_score":0.0022510707,"about_ca_system_score_codex":0.00061181246,"about_ca_system_score_gemma":0.0003689433,"threshold_uncertainty_score":0.00753057},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96856403,0.00033768982,0.013357203,0.00051540136,0.000024407895,0.000029676447,0.00016923349,0.00012652359,0.016875856],"genre_scores_gemma":[0.99371016,0.00013485036,0.0034304303,0.00006104986,0.00007684978,0.000063382,0.00022053486,0.000035366593,0.0022674494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998684,0.0002771559,0.000084504725,0.00024246376,0.00034043813,0.00037137695],"domain_scores_gemma":[0.992574,0.0048621814,0.0010404837,0.00042943456,0.00036772335,0.00072608935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019295187,0.0003409159,0.0006296653,0.0016390659,0.0012924753,0.001990796,0.00074033486,0.00074555207,0.007371147],"category_scores_gemma":[0.007062855,0.0002564552,0.0006364329,0.00074984046,0.0021770378,0.0029600537,0.0015173972,0.0010315841,0.00042650785],"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.0008328519,0.00027759254,0.01573088,0.00026182845,0.000065875676,0.0005593701,0.002792864,0.0048517482,0.018075235,0.93040067,0.0019112447,0.024239806],"study_design_scores_gemma":[0.00016584381,0.00030558874,0.006745263,0.00007213596,0.000059629743,0.0005620203,0.0006593416,0.04045844,0.0137036955,0.9326227,0.004585794,0.000059625654],"about_ca_topic_score_codex":0.00057500537,"about_ca_topic_score_gemma":0.00075794524,"teacher_disagreement_score":0.007371147,"about_ca_system_score_codex":0.0015507739,"about_ca_system_score_gemma":0.0005998911,"threshold_uncertainty_score":0.024658978},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79919547,0.0005285899,0.106879346,0.0010509959,0.00011220527,0.00004730864,0.00028389707,0.00037812622,0.091524094],"genre_scores_gemma":[0.98502374,0.00012711134,0.006121119,0.000043461172,0.0000680694,0.000013542221,0.00010996427,0.000020212265,0.0084726745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995858,0.000048865364,0.000015912248,0.000088550776,0.00016579236,0.00009508831],"domain_scores_gemma":[0.9986873,0.00040917206,0.00023790302,0.00024532966,0.00018246102,0.00023776943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003107222,0.00033902322,0.00034126104,0.0007390868,0.00061941077,0.0011070896,0.00048303642,0.0003158076,0.00594859],"category_scores_gemma":[0.002123248,0.00012274315,0.00031024058,0.00039113426,0.0020007638,0.0018298145,0.0014334121,0.0010950393,0.0010672265],"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.00008288522,0.000022691,0.0013142035,0.000049072005,0.000009049282,0.00027356023,0.0005358721,0.0029495591,0.010159858,0.97424716,0.00062938925,0.009726763],"study_design_scores_gemma":[0.000022140704,0.00010431629,0.0014118443,0.000013495199,0.000013996232,0.000379909,0.00018709525,0.015614961,0.010130444,0.9609491,0.011154435,0.000018269087],"about_ca_topic_score_codex":0.00042935376,"about_ca_topic_score_gemma":0.00040162116,"teacher_disagreement_score":0.00594859,"about_ca_system_score_codex":0.00062224356,"about_ca_system_score_gemma":0.00022634307,"threshold_uncertainty_score":0.019900084},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014762698,0.00013961393,0.97304654,0.00018240062,0.0000896002,0.00012040536,0.00019380056,0.007887541,0.0035773597],"genre_scores_gemma":[0.19346866,0.00014547125,0.7942228,0.00013650989,0.000057853045,0.00030394172,0.0014227899,0.00092100113,0.009321008],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886924,0.00019043934,0.00010002741,0.00036129646,0.00027051716,0.00020846749],"domain_scores_gemma":[0.9982835,0.00041465805,0.000074396405,0.0007254487,0.00042715413,0.00007496388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001227131,0.0010060511,0.0009813107,0.0008898205,0.0013210073,0.0013549912,0.0021022642,0.0011323069,0.0119379535],"category_scores_gemma":[0.0031214564,0.00049432565,0.0009230478,0.0011996147,0.000860382,0.002601632,0.0021696163,0.0014717929,0.005588046],"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.00067703315,0.00014396488,0.0018738001,0.00027136604,0.00006363782,0.00030581024,0.0007201841,0.045275684,0.03002833,0.10187307,0.020176338,0.79859084],"study_design_scores_gemma":[0.00017437885,0.0003058276,0.0007218702,0.000066185916,0.000075774056,0.00042840157,0.00038487333,0.57890373,0.05945383,0.2971695,0.062218692,0.00009693757],"about_ca_topic_score_codex":0.0017894453,"about_ca_topic_score_gemma":0.0015771713,"teacher_disagreement_score":0.0119379535,"about_ca_system_score_codex":0.00097531785,"about_ca_system_score_gemma":0.0013513234,"threshold_uncertainty_score":0.039936423},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.205856,0.0026077777,0.64569724,0.0022896852,0.00031989437,0.00022102782,0.0006136231,0.00054739247,0.14184733],"genre_scores_gemma":[0.9173212,0.0008768131,0.06754236,0.00045029697,0.00026216815,0.00016759666,0.0005261443,0.00008301084,0.0127703855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979633,0.0004325918,0.00018012724,0.00046627884,0.0006751471,0.00028254554],"domain_scores_gemma":[0.9980385,0.00062471663,0.00024869744,0.00028635468,0.00053840515,0.0002635066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013932037,0.0005562978,0.00048808576,0.0016345605,0.0016186929,0.0040356005,0.0007721242,0.00077105954,0.00553705],"category_scores_gemma":[0.003389632,0.0004382747,0.0008349196,0.0018713449,0.002600207,0.008322828,0.0024074616,0.0020261884,0.00070307974],"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.00001822996,0.000013608591,0.000184049,0.000024893387,0.0000070029846,0.00006183116,0.0002768674,0.00051936874,0.0008973122,0.99297804,0.00038338735,0.00463548],"study_design_scores_gemma":[0.000014008525,0.00003366366,0.00024392617,0.00002962874,0.000016776261,0.00032828114,0.00027666567,0.0077548795,0.0024487635,0.96432984,0.02450358,0.00001989242],"about_ca_topic_score_codex":0.0010100732,"about_ca_topic_score_gemma":0.00048574372,"teacher_disagreement_score":0.00553705,"about_ca_system_score_codex":0.0013027088,"about_ca_system_score_gemma":0.00084084045,"threshold_uncertainty_score":0.018523335},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059439924,0.0028294595,0.78256774,0.05067329,0.0022748662,0.00013183763,0.00056569517,0.0010025973,0.100514635],"genre_scores_gemma":[0.6101032,0.0022870807,0.3273635,0.004384489,0.001919371,0.0003693416,0.0008099397,0.00079679023,0.05196628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824464,0.000521428,0.000108086555,0.0004784701,0.0004144403,0.00023298118],"domain_scores_gemma":[0.99637645,0.00163394,0.00015057104,0.0010099318,0.0005480555,0.00028105278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003113241,0.00057217287,0.0015534156,0.0012663358,0.0033768772,0.0032010772,0.0028066305,0.0033696827,0.012372126],"category_scores_gemma":[0.0133834025,0.0006783469,0.0013485092,0.0015949794,0.0043165833,0.011679351,0.0068993936,0.006080288,0.0023701726],"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.000035010227,0.000018492427,0.00012273037,0.000045398203,0.0000095893165,0.000067798646,0.00021874798,0.00062712975,0.00020309094,0.98618996,0.0055886135,0.006873391],"study_design_scores_gemma":[0.000024524274,0.000009259518,0.000051672094,0.000017636903,0.0000050890235,0.00009392628,0.00009070422,0.0028491938,0.00017602432,0.98644614,0.010225311,0.000010444009],"about_ca_topic_score_codex":0.0008043285,"about_ca_topic_score_gemma":0.00061086303,"teacher_disagreement_score":0.012372126,"about_ca_system_score_codex":0.001103343,"about_ca_system_score_gemma":0.0016001611,"threshold_uncertainty_score":0.04138893},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93378377,0.00031044506,0.049572244,0.00022879586,0.000030114697,0.00002024721,0.00006089623,0.00012212191,0.01587136],"genre_scores_gemma":[0.9953093,0.00006228705,0.0025710873,0.000019325202,0.000018435225,0.000008103679,0.00006788163,0.000010144516,0.0019333581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995726,0.00006707798,0.00002781818,0.00008947105,0.00012337799,0.00011981378],"domain_scores_gemma":[0.9985233,0.0006214744,0.00023047948,0.00029126502,0.00015783275,0.00017570613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007611535,0.00039919312,0.00037818137,0.00067311357,0.00066724356,0.0012031008,0.0005385448,0.00036305306,0.0031290252],"category_scores_gemma":[0.002035373,0.00018193501,0.00044173337,0.00023515287,0.0031775092,0.003051455,0.0013977461,0.00081984536,0.00026086927],"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.00016472249,0.000033624972,0.0033703502,0.0000800202,0.000018432944,0.00028109338,0.0024048018,0.0018787076,0.011160976,0.96644396,0.00020460297,0.013958674],"study_design_scores_gemma":[0.000027775714,0.00018046623,0.0023396602,0.00001983239,0.000021943059,0.0004082207,0.00078097853,0.007460559,0.019957399,0.9640816,0.004692759,0.000028846167],"about_ca_topic_score_codex":0.00044232642,"about_ca_topic_score_gemma":0.00028330152,"teacher_disagreement_score":0.0031290252,"about_ca_system_score_codex":0.00046382137,"about_ca_system_score_gemma":0.00024090595,"threshold_uncertainty_score":0.0104676485},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55464125,0.00043704672,0.3796316,0.0005484395,0.00050567515,0.000117154894,0.00029811714,0.00061520917,0.06320545],"genre_scores_gemma":[0.93804836,0.00022717712,0.03902352,0.00027393596,0.00019394056,0.00008398047,0.00025587657,0.00027460215,0.021618638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996861,0.000045486464,0.00001552492,0.000055115837,0.00010314941,0.000094553994],"domain_scores_gemma":[0.9997204,0.000038819944,0.000027936356,0.0000614228,0.000059758506,0.000091789894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040591936,0.0005249495,0.0006075864,0.001366628,0.00087816414,0.0017058298,0.0007401811,0.0005336954,0.00776881],"category_scores_gemma":[0.0005426389,0.00029217536,0.0007128939,0.00058423326,0.0013987209,0.0018292973,0.0011299654,0.0011629979,0.0017961842],"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.00006158387,0.00006504237,0.0004426214,0.00004211246,0.0000094866555,0.0003218853,0.0003202719,0.006570835,0.010147569,0.96418464,0.001997829,0.015836228],"study_design_scores_gemma":[0.000019278088,0.00007238607,0.0003963962,0.000018076285,0.000012045432,0.00029000163,0.00020107071,0.060319476,0.008107993,0.9243941,0.006132041,0.000037168025],"about_ca_topic_score_codex":0.0007074542,"about_ca_topic_score_gemma":0.00074199855,"teacher_disagreement_score":0.00776881,"about_ca_system_score_codex":0.0006367008,"about_ca_system_score_gemma":0.0005439993,"threshold_uncertainty_score":0.025989234},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7611036,0.00093194057,0.19352257,0.0009718697,0.00016873711,0.0000866686,0.00019513628,0.00021737968,0.042802192],"genre_scores_gemma":[0.97697395,0.00023031396,0.013595881,0.00009555953,0.00020514888,0.00008133733,0.00013546446,0.000048885388,0.008633454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875295,0.0003233793,0.00009541505,0.00020889794,0.00036426607,0.00025510273],"domain_scores_gemma":[0.997414,0.0010411176,0.0005347859,0.00022280657,0.00034926194,0.00043798028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016872148,0.00065928843,0.00064487313,0.001644091,0.0016376575,0.0029605338,0.00072855706,0.00086157065,0.003922786],"category_scores_gemma":[0.00277158,0.00034525633,0.001169904,0.000850494,0.0041400245,0.005069165,0.0022886677,0.0012886635,0.0005083181],"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.00004665054,0.000024581606,0.00057627045,0.000029850024,0.0000089641835,0.00024300563,0.0008881007,0.00096777326,0.0022136713,0.9920155,0.0002061725,0.002779378],"study_design_scores_gemma":[0.000030136187,0.00013428938,0.0007234444,0.000025965988,0.00001488771,0.00047869777,0.0005627481,0.01064163,0.003022869,0.97991276,0.0044254283,0.000027008906],"about_ca_topic_score_codex":0.0006377818,"about_ca_topic_score_gemma":0.00039266548,"teacher_disagreement_score":0.003922786,"about_ca_system_score_codex":0.0011832116,"about_ca_system_score_gemma":0.0005322265,"threshold_uncertainty_score":0.013123035},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14557452,0.006243175,0.76410526,0.008478741,0.0005338937,0.00026147912,0.0005126172,0.0019454722,0.07234483],"genre_scores_gemma":[0.74891984,0.0040287087,0.20444348,0.0015952897,0.0009362738,0.00026941305,0.0010488525,0.0011255377,0.037632503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996203,0.0010488392,0.00029079668,0.0012011429,0.0008467029,0.00040948525],"domain_scores_gemma":[0.98822916,0.008861448,0.00053174415,0.0012159151,0.00085991446,0.00030185923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027886848,0.00072700664,0.0014444621,0.0012608238,0.0026168372,0.0042118644,0.0015097248,0.0023946967,0.010210567],"category_scores_gemma":[0.015553435,0.0008749061,0.0018206829,0.0011150807,0.0073448075,0.019033682,0.005614686,0.0053852675,0.0023835702],"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.00005315591,0.000016771051,0.00025061026,0.00020450096,0.000010515805,0.00019605261,0.0011827005,0.0025654156,0.0019414199,0.9803423,0.0013556851,0.011880731],"study_design_scores_gemma":[0.000019973402,0.000028207067,0.000059194143,0.000049983464,0.000011660076,0.00016366143,0.00032618127,0.006509841,0.0016390439,0.9780738,0.01310432,0.000014191075],"about_ca_topic_score_codex":0.001251032,"about_ca_topic_score_gemma":0.0008516886,"teacher_disagreement_score":0.010210567,"about_ca_system_score_codex":0.0017802608,"about_ca_system_score_gemma":0.0011835418,"threshold_uncertainty_score":0.034157753},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9255061,0.00038580643,0.021358103,0.00036230907,0.00018791742,0.00007242417,0.00059988827,0.00024305198,0.051284432],"genre_scores_gemma":[0.97739273,0.00026487754,0.0066103833,0.00009446968,0.000067255525,0.000038457012,0.0007979235,0.00006502076,0.0146688605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999691,0.000022114089,0.000012618362,0.00004498248,0.00006789419,0.00016138985],"domain_scores_gemma":[0.999479,0.0000885707,0.0001573685,0.0000610467,0.00006690592,0.00014705572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019987106,0.0010270308,0.0003397966,0.0022750164,0.0006985579,0.0020183271,0.0006559517,0.00057333265,0.00941862],"category_scores_gemma":[0.0009116247,0.00016059788,0.0004554535,0.0008599656,0.001255751,0.0016141689,0.0010807774,0.0010216711,0.0014855653],"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.0009136441,0.00039604274,0.020491041,0.0003604845,0.0000836544,0.0033666766,0.0036171698,0.0041499347,0.09666356,0.6958223,0.012454038,0.16168141],"study_design_scores_gemma":[0.000112600814,0.0004535243,0.036567483,0.00020304654,0.00008469907,0.0045280023,0.0026952336,0.016482122,0.07498881,0.76438004,0.099295795,0.00020863004],"about_ca_topic_score_codex":0.00037488103,"about_ca_topic_score_gemma":0.00041328734,"teacher_disagreement_score":0.00941862,"about_ca_system_score_codex":0.0004717618,"about_ca_system_score_gemma":0.00028238224,"threshold_uncertainty_score":0.031508386},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.731273,0.00088648347,0.1927594,0.0005795375,0.0001377513,0.00011152132,0.0008021533,0.0007439851,0.0727062],"genre_scores_gemma":[0.93282884,0.00034343384,0.028295735,0.00012194001,0.00019060615,0.00022200163,0.0006734588,0.00034274248,0.03698131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992131,0.00011802733,0.000049036833,0.0002578581,0.00020615352,0.00015575776],"domain_scores_gemma":[0.9986985,0.0004036066,0.00018730183,0.00017673698,0.00026420114,0.00026970822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008587685,0.0004951452,0.000462537,0.0017772203,0.0013718056,0.0031604609,0.0005682492,0.00043180602,0.009272357],"category_scores_gemma":[0.0018931682,0.00047412966,0.00065824686,0.0007397484,0.0032590881,0.005262357,0.00243381,0.0014937659,0.0010776637],"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.00016460143,0.000039431812,0.0011718539,0.00007395537,0.00002210526,0.0002633825,0.0013366492,0.0007906985,0.0069549163,0.9734352,0.0007368922,0.015010361],"study_design_scores_gemma":[0.000049664803,0.00013629891,0.0023056632,0.00003075047,0.000046425852,0.0004992604,0.0011980078,0.005789363,0.015318933,0.9547377,0.01984217,0.000045732682],"about_ca_topic_score_codex":0.00038315388,"about_ca_topic_score_gemma":0.00048915023,"teacher_disagreement_score":0.009272357,"about_ca_system_score_codex":0.0010568112,"about_ca_system_score_gemma":0.00051403046,"threshold_uncertainty_score":0.031019151},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18337327,0.00090806227,0.7484778,0.0026926226,0.00019650337,0.00010978494,0.00021516444,0.00057527475,0.06345152],"genre_scores_gemma":[0.9110963,0.00034794895,0.07438187,0.00037961034,0.0002891026,0.00013588063,0.00014404001,0.00011692124,0.013108422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989655,0.00031207383,0.00006509479,0.00025801998,0.00021830274,0.00018098035],"domain_scores_gemma":[0.99796677,0.00079328445,0.00022611892,0.0005104214,0.00025826303,0.0002451466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013146701,0.00032365767,0.000504203,0.0014824106,0.0023245509,0.002804352,0.0015673424,0.0010153871,0.008905801],"category_scores_gemma":[0.0033205491,0.0005414253,0.0010598692,0.00120678,0.006947235,0.010342575,0.005049576,0.0024524224,0.0009763904],"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.000010213727,0.0000098008495,0.00020132576,0.000016959433,0.0000025746397,0.00007209687,0.00049963937,0.00029330773,0.0009675315,0.9953318,0.0001847631,0.0024097909],"study_design_scores_gemma":[0.0000152160355,0.000060217906,0.00028555398,0.0000181628,0.0000141000455,0.00037601576,0.0005869632,0.0050168075,0.0021502185,0.9830751,0.008382591,0.000019081128],"about_ca_topic_score_codex":0.00086142664,"about_ca_topic_score_gemma":0.000706344,"teacher_disagreement_score":0.008905801,"about_ca_system_score_codex":0.0012747506,"about_ca_system_score_gemma":0.0006390343,"threshold_uncertainty_score":0.029792845},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60791254,0.001019193,0.36991557,0.0006780347,0.00013120906,0.00007975821,0.0008642448,0.00057089276,0.018828483],"genre_scores_gemma":[0.93185604,0.00050100783,0.061261892,0.00022902685,0.0003735918,0.0003103154,0.000864307,0.00020249537,0.004401299],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963224,0.0006565638,0.00038763613,0.0009090665,0.0012665052,0.0004578434],"domain_scores_gemma":[0.9602569,0.027573004,0.0028953152,0.0048505953,0.0025335187,0.0018907827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025542644,0.0006164725,0.00083783333,0.0020042611,0.0016752364,0.0024601303,0.001994557,0.0010127958,0.004850162],"category_scores_gemma":[0.02097143,0.0008680286,0.0012425611,0.0013825374,0.004391444,0.008632124,0.0033510844,0.0023104828,0.0004939549],"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.00030188198,0.000067941866,0.0039616656,0.00025013933,0.000064074426,0.00036379186,0.0009629014,0.010754853,0.012036045,0.9569945,0.0010577299,0.013184449],"study_design_scores_gemma":[0.00003165988,0.00012363173,0.0026477114,0.00006121452,0.00005027965,0.00079497916,0.00036199501,0.04273479,0.011083906,0.93667924,0.005370392,0.000060202634],"about_ca_topic_score_codex":0.00026129317,"about_ca_topic_score_gemma":0.0002898393,"teacher_disagreement_score":0.004850162,"about_ca_system_score_codex":0.0012315542,"about_ca_system_score_gemma":0.0007244536,"threshold_uncertainty_score":0.016225338},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7935763,0.0005878353,0.14922194,0.00053562096,0.0001899059,0.00006951535,0.00027681788,0.00028726298,0.055254854],"genre_scores_gemma":[0.97403145,0.00024207306,0.013922063,0.00013166343,0.00017646379,0.000040869705,0.00022803334,0.000046834826,0.011180542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997383,0.00005810913,0.000010757743,0.000048545146,0.00008952522,0.000054888013],"domain_scores_gemma":[0.9996655,0.00007646877,0.00004876228,0.000029485445,0.00007504633,0.000104698505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039495816,0.00020108468,0.00030759876,0.0010623863,0.0008474753,0.0017887052,0.0003531917,0.00024034205,0.0059947977],"category_scores_gemma":[0.00067974284,0.00016754806,0.00040240062,0.0004108938,0.0013519118,0.0017268356,0.00057703647,0.0006189697,0.00077087805],"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.000040085517,0.000022429393,0.0006224959,0.000030637468,0.0000085085785,0.00014421367,0.0002931551,0.0013133178,0.0036674007,0.98573375,0.00079047825,0.007333612],"study_design_scores_gemma":[0.000021413733,0.000084696345,0.0016857155,0.000018137584,0.000015974005,0.00033301683,0.00019054026,0.01909197,0.0037824407,0.96805465,0.0066956063,0.000025766516],"about_ca_topic_score_codex":0.0008242151,"about_ca_topic_score_gemma":0.0006160987,"teacher_disagreement_score":0.0059947977,"about_ca_system_score_codex":0.00052664895,"about_ca_system_score_gemma":0.0004293159,"threshold_uncertainty_score":0.020054579},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46141824,0.0012633664,0.48556858,0.007879346,0.00014559492,0.00013383495,0.0005538028,0.00036314322,0.042674117],"genre_scores_gemma":[0.9550781,0.0003748525,0.038498756,0.00024364267,0.00032906773,0.00011325424,0.00041770167,0.00007864278,0.0048658503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99469936,0.0015211134,0.00034186477,0.0012992539,0.001531854,0.0006065514],"domain_scores_gemma":[0.94952154,0.04152457,0.0019075193,0.0031720106,0.0025423428,0.0013320327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046060774,0.00045611907,0.0010852612,0.0017885274,0.0022603343,0.007136316,0.00235414,0.0019992352,0.0053871707],"category_scores_gemma":[0.037357006,0.0005849476,0.0015211145,0.0023146868,0.0074476856,0.022327477,0.004488453,0.0055522863,0.0006072802],"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.00007194095,0.00004260491,0.0019081645,0.000075316784,0.00002032139,0.00008566533,0.00057568046,0.00952247,0.0007578971,0.9742639,0.000987792,0.011688099],"study_design_scores_gemma":[0.000006650325,0.00000861654,0.00039796095,0.0000090708045,0.000008409541,0.00006470805,0.00008616495,0.028763462,0.0008607449,0.96884537,0.0009339489,0.000014935046],"about_ca_topic_score_codex":0.0011882778,"about_ca_topic_score_gemma":0.00067855057,"teacher_disagreement_score":0.007136316,"about_ca_system_score_codex":0.0030929572,"about_ca_system_score_gemma":0.0014176996,"threshold_uncertainty_score":0.024359584},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45921674,0.0012491051,0.4926005,0.0027161774,0.0001553756,0.00015254687,0.0010177128,0.0014637511,0.041428093],"genre_scores_gemma":[0.96500164,0.00026191337,0.02795844,0.0003001446,0.00016557517,0.00012973568,0.0005709818,0.00016948195,0.0054421052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927625,0.0013709726,0.0011045029,0.0017087229,0.0015125588,0.0015406947],"domain_scores_gemma":[0.97070396,0.014372885,0.0027313298,0.007743304,0.0024818138,0.0019666709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048224344,0.00084583275,0.0014169815,0.0024986712,0.0024144815,0.005742444,0.0039637703,0.0018846841,0.0049634646],"category_scores_gemma":[0.020078832,0.0012301913,0.0025178841,0.0024763471,0.009418509,0.026592033,0.009504126,0.0042681554,0.00090560224],"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.00017457698,0.000046857745,0.002555418,0.00010417045,0.000026871803,0.00035475398,0.001141541,0.0034395566,0.0018600655,0.9811973,0.000659458,0.008439371],"study_design_scores_gemma":[0.000032160588,0.00006242459,0.00046936778,0.000030382374,0.000038771286,0.0003378718,0.0002388542,0.009128131,0.002400792,0.9845093,0.0027192177,0.00003279255],"about_ca_topic_score_codex":0.0020769383,"about_ca_topic_score_gemma":0.0011260788,"teacher_disagreement_score":0.005742444,"about_ca_system_score_codex":0.001516579,"about_ca_system_score_gemma":0.0012656455,"threshold_uncertainty_score":0.025503755},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5420885,0.0029187333,0.37733626,0.0046886113,0.0004931807,0.00011412992,0.00034429086,0.0006780508,0.07133816],"genre_scores_gemma":[0.9154278,0.0012306384,0.044631574,0.0005351079,0.00081697496,0.0002574478,0.00044620357,0.00030266077,0.036351718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990538,0.00023007515,0.000040967072,0.00012764375,0.00034393548,0.00020364042],"domain_scores_gemma":[0.9950069,0.0026190933,0.0006575367,0.00021212138,0.0008535482,0.0006508313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018644496,0.0015365024,0.0007562872,0.0033056478,0.0012696123,0.0019661787,0.0014696011,0.0012655274,0.009386368],"category_scores_gemma":[0.0086003775,0.0005361805,0.0009041719,0.00094943185,0.0024066612,0.0050679264,0.004169706,0.003023221,0.0012558707],"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.00013170992,0.0000800303,0.0018323128,0.00025123174,0.000052123316,0.0002349047,0.0008132669,0.0077944286,0.0067570764,0.9667576,0.0021131295,0.013182302],"study_design_scores_gemma":[0.000051387982,0.00012197111,0.0014582378,0.00009642399,0.000050268773,0.00015436352,0.00032842264,0.0902951,0.0038035563,0.8989935,0.004584413,0.00006239515],"about_ca_topic_score_codex":0.0010741916,"about_ca_topic_score_gemma":0.0013261366,"teacher_disagreement_score":0.009386368,"about_ca_system_score_codex":0.0020253381,"about_ca_system_score_gemma":0.00071744533,"threshold_uncertainty_score":0.0314005},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15487479,0.003527632,0.57397777,0.002379153,0.001178959,0.00009496488,0.0003397718,0.00035273086,0.2632742],"genre_scores_gemma":[0.8428809,0.0035242694,0.09717045,0.00074348145,0.0009036381,0.000120420744,0.0002470555,0.0003632624,0.05404643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878937,0.00032787223,0.000069795446,0.00011906837,0.0005135698,0.00018036422],"domain_scores_gemma":[0.9987031,0.00046087406,0.0001340911,0.00026611867,0.0003320357,0.00010374058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017923445,0.0006659831,0.0005760127,0.0018069561,0.0011078634,0.0032479095,0.0012264444,0.0010355903,0.007309086],"category_scores_gemma":[0.0043287063,0.00036924588,0.00073639036,0.0014999828,0.0033375018,0.006418732,0.0019801173,0.002337074,0.002134106],"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.0000035023975,0.0000038138728,0.00002651557,0.000011208549,0.0000010411803,0.000018462528,0.000049555845,0.00042854325,0.0002176595,0.9970618,0.00036523154,0.0018127821],"study_design_scores_gemma":[0.0000031641143,0.0000061065152,0.00004468677,0.0000113977285,0.0000021131405,0.000050005394,0.000025258452,0.0046542375,0.00036641452,0.9925661,0.0022622573,0.000008136699],"about_ca_topic_score_codex":0.0010001604,"about_ca_topic_score_gemma":0.00088923617,"teacher_disagreement_score":0.007309086,"about_ca_system_score_codex":0.0010151573,"about_ca_system_score_gemma":0.0011950345,"threshold_uncertainty_score":0.024451315},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6381417,0.00083931064,0.33488673,0.007994781,0.000078804704,0.00023493833,0.00094613765,0.00040563673,0.016471954],"genre_scores_gemma":[0.9367484,0.0005902495,0.056847207,0.00032297152,0.0002145631,0.00015167444,0.0011110998,0.00008179491,0.0039321324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99695396,0.0008351006,0.00018132458,0.00052697374,0.0008581278,0.0006444996],"domain_scores_gemma":[0.943981,0.049224447,0.00278896,0.001978515,0.0011095426,0.0009175367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033198032,0.0006035279,0.0014647843,0.001373658,0.0020028967,0.0046106684,0.0025308246,0.0017865628,0.0076192664],"category_scores_gemma":[0.028102446,0.00054892537,0.0018880113,0.0024928795,0.0043154685,0.015090746,0.0030125855,0.0055086524,0.0004862028],"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.0003615867,0.00034744316,0.0062974608,0.0004073625,0.0001175954,0.000308159,0.0010548239,0.09504974,0.003435334,0.8648851,0.0032945962,0.024440793],"study_design_scores_gemma":[0.000044828223,0.00002979643,0.0005788991,0.000014137878,0.000027851625,0.000065098466,0.00018140493,0.13505849,0.0013526214,0.861886,0.00073967915,0.000021171536],"about_ca_topic_score_codex":0.0033101612,"about_ca_topic_score_gemma":0.0033893066,"teacher_disagreement_score":0.0076192664,"about_ca_system_score_codex":0.0029429263,"about_ca_system_score_gemma":0.0023204265,"threshold_uncertainty_score":0.025488973},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9298543,0.0009695217,0.033474352,0.00087099,0.00011340885,0.000026241649,0.00015223167,0.00011817626,0.034420762],"genre_scores_gemma":[0.992547,0.0002213148,0.0027424651,0.00004914325,0.00007554182,0.000009072573,0.00005064697,0.000012961229,0.0042919116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963665,0.000045988076,0.000011610442,0.00007699321,0.000094780335,0.00013404377],"domain_scores_gemma":[0.9996675,0.00005698486,0.00005900867,0.000036007932,0.00004872844,0.00013174485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036058694,0.00030252602,0.00043255725,0.0015216534,0.0010987865,0.0019167337,0.000726174,0.00051347347,0.005563682],"category_scores_gemma":[0.0007112842,0.0001662701,0.00028820033,0.0010130295,0.0023318068,0.002715865,0.0015922178,0.0009674988,0.00039277817],"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.000020403977,0.000015104885,0.00072419486,0.000031484375,0.000005031398,0.000089545516,0.00032506313,0.0010052902,0.0022410925,0.99223423,0.00030703188,0.0030015355],"study_design_scores_gemma":[0.000015446281,0.000060997794,0.003296142,0.000027085036,0.00001484626,0.00038315472,0.00069099915,0.01346152,0.0058924784,0.97108555,0.0050386,0.00003314309],"about_ca_topic_score_codex":0.002187374,"about_ca_topic_score_gemma":0.0011724025,"teacher_disagreement_score":0.005563682,"about_ca_system_score_codex":0.0014127123,"about_ca_system_score_gemma":0.00060524413,"threshold_uncertainty_score":0.018612325},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.829863,0.0006116963,0.13682823,0.00067720417,0.000102125894,0.00006435534,0.00013444207,0.0002811548,0.031437874],"genre_scores_gemma":[0.98515457,0.00020493098,0.010033173,0.00009803343,0.000096184056,0.000042810443,0.00014531768,0.000026445447,0.0041986294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996505,0.00006941725,0.00002422372,0.00007136402,0.00011104773,0.00007352873],"domain_scores_gemma":[0.9993999,0.0002221045,0.00013743057,0.00012325954,0.000045028562,0.00007226869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002613176,0.00033758866,0.00035661552,0.0004509754,0.00083215086,0.0011624314,0.00045911767,0.0005293975,0.0043054204],"category_scores_gemma":[0.0012952036,0.00015836552,0.00045415203,0.000557567,0.001611013,0.0023070823,0.0018830909,0.0007910701,0.00053251017],"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.00008446283,0.00003224038,0.0008961552,0.00006410316,0.00001507456,0.00046031325,0.0012320783,0.002750703,0.0067774653,0.9687334,0.00090571714,0.01804842],"study_design_scores_gemma":[0.000025600873,0.00008891626,0.00050948124,0.0000138028545,0.000012783949,0.0003446547,0.00035767583,0.01257435,0.0062183556,0.9738888,0.005952357,0.0000130498975],"about_ca_topic_score_codex":0.00062194176,"about_ca_topic_score_gemma":0.00041118867,"teacher_disagreement_score":0.0043054204,"about_ca_system_score_codex":0.00042463053,"about_ca_system_score_gemma":0.00027988388,"threshold_uncertainty_score":0.014403045},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3853266,0.0015976843,0.5566664,0.011854704,0.00040352624,0.00040955693,0.0019256173,0.0031771336,0.03863884],"genre_scores_gemma":[0.8726577,0.00072833453,0.10430234,0.0011314151,0.0005852246,0.00031986978,0.0024092803,0.0004922481,0.017373564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99490345,0.0014192514,0.00042995787,0.00149506,0.0011497868,0.000602473],"domain_scores_gemma":[0.98061013,0.014160478,0.0006964699,0.0023448835,0.0012064739,0.0009814502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040824087,0.00062427117,0.0013318793,0.0010354582,0.0024778282,0.00449781,0.002238116,0.001985013,0.010214727],"category_scores_gemma":[0.01702684,0.0009474769,0.0021166913,0.0011145445,0.003940895,0.019797832,0.004593266,0.0047297315,0.0021309764],"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.00093685876,0.0004466695,0.0030236894,0.00069592684,0.00008825722,0.0009511485,0.0035274485,0.01532983,0.010063501,0.8555898,0.010488584,0.09885834],"study_design_scores_gemma":[0.000052311298,0.00005438824,0.00022466337,0.000026246938,0.000021465237,0.0002790203,0.00029501406,0.02674689,0.0042084414,0.9624734,0.005594786,0.000023397246],"about_ca_topic_score_codex":0.0011554565,"about_ca_topic_score_gemma":0.00084359717,"teacher_disagreement_score":0.010214727,"about_ca_system_score_codex":0.0021036752,"about_ca_system_score_gemma":0.0015562692,"threshold_uncertainty_score":0.03417164},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70811266,0.0013413966,0.24344431,0.0013385328,0.00023463502,0.00012017609,0.0007860879,0.0019003109,0.0427218],"genre_scores_gemma":[0.9300854,0.0003273672,0.057665914,0.00037127064,0.00012673029,0.00012741293,0.000793784,0.00027246983,0.010229553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992836,0.00009314505,0.00006157451,0.00015977431,0.0002656603,0.0001362333],"domain_scores_gemma":[0.9975454,0.0009593294,0.00030842432,0.00033843983,0.0006701853,0.00017814874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065364764,0.0006117183,0.0005648973,0.0014316351,0.0014802587,0.0012614887,0.00094864663,0.00074956607,0.0041608387],"category_scores_gemma":[0.004325739,0.00036511093,0.00097324746,0.00072583253,0.0017413947,0.0020170722,0.00087361614,0.0016187177,0.0004976711],"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.0008652282,0.00023415146,0.013214055,0.00051922875,0.0001340197,0.011199473,0.0017078809,0.006508942,0.07499212,0.7901872,0.0074503007,0.092987396],"study_design_scores_gemma":[0.00033878238,0.00030733543,0.00798887,0.00013185773,0.00024723844,0.009740528,0.00071108335,0.05558259,0.048230022,0.8281752,0.048323426,0.00022306797],"about_ca_topic_score_codex":0.0013346112,"about_ca_topic_score_gemma":0.001162251,"teacher_disagreement_score":0.0041608387,"about_ca_system_score_codex":0.001156359,"about_ca_system_score_gemma":0.00061961624,"threshold_uncertainty_score":0.013919413},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.458602,0.0004209786,0.5243186,0.003946393,0.00020134405,0.00047057302,0.0007087445,0.0006032224,0.010728128],"genre_scores_gemma":[0.81323284,0.00025950733,0.17797478,0.00042749874,0.00018211856,0.00029533877,0.0010043506,0.000101334575,0.006522243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99573576,0.0012593041,0.0003704535,0.0014334982,0.00053379044,0.0006671337],"domain_scores_gemma":[0.98402435,0.013435843,0.0006141635,0.00052192365,0.0006586041,0.00074510643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004313226,0.0005628604,0.0012012235,0.0006395832,0.0021753202,0.0049096486,0.0020154966,0.0025004845,0.005828309],"category_scores_gemma":[0.015707579,0.0006874537,0.0016870213,0.0007196293,0.0040207915,0.0064013544,0.002498228,0.0024877423,0.0005389839],"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.0015982414,0.00049038936,0.0028333492,0.0006995206,0.00015540469,0.0011559821,0.0017390506,0.08928922,0.01034395,0.8343298,0.0050961147,0.05226893],"study_design_scores_gemma":[0.0002263824,0.00022278128,0.00040668837,0.000055057004,0.00006476112,0.00021872099,0.0005371308,0.20533732,0.007293093,0.78286433,0.0026996841,0.000074081785],"about_ca_topic_score_codex":0.0017144106,"about_ca_topic_score_gemma":0.001294593,"teacher_disagreement_score":0.005828309,"about_ca_system_score_codex":0.0022203245,"about_ca_system_score_gemma":0.0019832067,"threshold_uncertainty_score":0.022810817},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32906502,0.0011242,0.6138495,0.0047025154,0.0002617269,0.000349313,0.0018979425,0.008657985,0.040091872],"genre_scores_gemma":[0.76620734,0.0002562573,0.21757245,0.000579271,0.00024378943,0.00037041202,0.0025157058,0.0010858402,0.011168926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982534,0.00031982083,0.00010677039,0.0005408763,0.00041112496,0.0003680322],"domain_scores_gemma":[0.9937078,0.004267432,0.0002669412,0.0011750387,0.0003561459,0.00022679953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010467551,0.0009681572,0.00088641996,0.00096640753,0.0011887918,0.004021454,0.0028702603,0.0012895138,0.023930883],"category_scores_gemma":[0.007850724,0.00040977268,0.0011154371,0.0017917322,0.0016258307,0.00886827,0.0026284556,0.002524154,0.003071933],"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.0018808136,0.00064798706,0.004926959,0.0014467408,0.0001434566,0.00039894835,0.0016642478,0.07012116,0.01446167,0.6098889,0.026899558,0.2675195],"study_design_scores_gemma":[0.00016838002,0.00006654636,0.00030835703,0.000043270506,0.000051330975,0.00010144225,0.0002465292,0.17710374,0.009560717,0.80714244,0.0051812544,0.000025968035],"about_ca_topic_score_codex":0.0017978256,"about_ca_topic_score_gemma":0.003737893,"teacher_disagreement_score":0.023930883,"about_ca_system_score_codex":0.0026904857,"about_ca_system_score_gemma":0.0021041227,"threshold_uncertainty_score":0.08005679},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6926678,0.0003991558,0.2258061,0.0012262767,0.0004219473,0.00010996336,0.0004075143,0.00025484516,0.078706406],"genre_scores_gemma":[0.9807144,0.00018043909,0.01293458,0.00020160445,0.000093863106,0.0000597885,0.00030576627,0.00003300487,0.0054764887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994087,0.00008645004,0.000050782208,0.0001433573,0.00021061431,0.00010008058],"domain_scores_gemma":[0.99801207,0.00039035757,0.0003560658,0.00032605362,0.00057330105,0.00034208925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005299609,0.0004583673,0.0003533025,0.0006529438,0.00090501225,0.0017210968,0.0004893475,0.00067049975,0.005068732],"category_scores_gemma":[0.002177245,0.00027437042,0.00055952906,0.00049197784,0.001825485,0.0023258794,0.0024623103,0.0011819116,0.0007161983],"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.000050091166,0.000025698728,0.0019000483,0.000055298642,0.000012741474,0.00039208514,0.0003698126,0.00058201194,0.005479141,0.9817914,0.0013945412,0.00794708],"study_design_scores_gemma":[0.00007277069,0.0002453389,0.0047725644,0.000027921446,0.000021344837,0.0023940743,0.0011161595,0.016380755,0.006365091,0.9490872,0.019467203,0.000049643804],"about_ca_topic_score_codex":0.00084114465,"about_ca_topic_score_gemma":0.0004361535,"teacher_disagreement_score":0.005068732,"about_ca_system_score_codex":0.00030027863,"about_ca_system_score_gemma":0.00034672546,"threshold_uncertainty_score":0.016956568},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.626994,0.00085939094,0.28086817,0.00040878664,0.00020865323,0.00018586271,0.0010699603,0.0017335465,0.08767161],"genre_scores_gemma":[0.95710105,0.0002173706,0.03018532,0.00014581997,0.000100445934,0.00011107032,0.00076926965,0.0001342816,0.011235351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883324,0.00010919547,0.00011802781,0.00041799425,0.00032452063,0.00019705787],"domain_scores_gemma":[0.99855334,0.0003916821,0.00017085389,0.0003786861,0.00036661167,0.00013877968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005275722,0.0004312215,0.00050846924,0.0014275971,0.0011360846,0.0018943849,0.0009722803,0.00048606377,0.0064769126],"category_scores_gemma":[0.0019390538,0.00030198196,0.0008105862,0.000612976,0.0019643577,0.003493262,0.0016609423,0.0009091885,0.000900744],"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.00011787426,0.00008025419,0.0016729896,0.00013793283,0.000033908338,0.00055245205,0.0009668099,0.0019026435,0.016640818,0.94803476,0.0010200297,0.028839497],"study_design_scores_gemma":[0.000038162398,0.00017938657,0.0017835759,0.0000755777,0.000092108625,0.0012696652,0.0006177085,0.020333845,0.026901456,0.92281765,0.025827631,0.00006312423],"about_ca_topic_score_codex":0.0005347036,"about_ca_topic_score_gemma":0.00057817827,"teacher_disagreement_score":0.0064769126,"about_ca_system_score_codex":0.0006540452,"about_ca_system_score_gemma":0.00041583512,"threshold_uncertainty_score":0.02166742},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6112828,0.0006873033,0.36265698,0.0057455734,0.00009993587,0.00039021394,0.002548322,0.0017573691,0.014831554],"genre_scores_gemma":[0.890121,0.00044923453,0.10272307,0.00021260677,0.00017534399,0.0002599329,0.0029239918,0.00034672648,0.0027880096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9930508,0.0020692898,0.00060759194,0.0015849272,0.0019137682,0.0007736324],"domain_scores_gemma":[0.9325073,0.058247097,0.0025348158,0.0042521935,0.0016412063,0.0008173809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038159455,0.00067969225,0.0012590877,0.0017546563,0.0018496043,0.0076324847,0.0029150485,0.0017474332,0.007817486],"category_scores_gemma":[0.034220543,0.0009575146,0.0034913751,0.0021698899,0.0038800472,0.014893702,0.0026581478,0.0033646694,0.00079623127],"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.001129107,0.0004999528,0.014304163,0.0013912306,0.0003135073,0.0011430186,0.002447931,0.20062041,0.015921041,0.65264815,0.0062648924,0.10331667],"study_design_scores_gemma":[0.0000818332,0.00006219566,0.001072715,0.000043792923,0.000072118986,0.00030432368,0.00029151657,0.25295562,0.0070055122,0.7358373,0.0022314433,0.000041745436],"about_ca_topic_score_codex":0.0028255496,"about_ca_topic_score_gemma":0.002042101,"teacher_disagreement_score":0.007817486,"about_ca_system_score_codex":0.0034881847,"about_ca_system_score_gemma":0.0022555594,"threshold_uncertainty_score":0.026152074},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2572861,0.0006258863,0.7187048,0.0029491559,0.0003332845,0.00047124294,0.0018517695,0.0070608906,0.010716796],"genre_scores_gemma":[0.7413274,0.00016646524,0.24932417,0.0004938768,0.00029503278,0.00021778225,0.0031250762,0.000799786,0.0042504095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.988958,0.0022538174,0.0010733623,0.0028791034,0.0030401999,0.0017953763],"domain_scores_gemma":[0.9293596,0.056327313,0.0029109535,0.0066542593,0.0032394445,0.0015083734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064500305,0.0011477394,0.0023438402,0.001916284,0.0019044643,0.006581178,0.0054864716,0.002409353,0.011617899],"category_scores_gemma":[0.038970035,0.0009674333,0.003293892,0.002533989,0.004658295,0.019678494,0.005609746,0.0042139827,0.0024863097],"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.0057197493,0.0013733301,0.018439112,0.0021437758,0.00046789242,0.0012684427,0.0020204906,0.056640636,0.037290942,0.60123837,0.015012585,0.2583846],"study_design_scores_gemma":[0.0003548098,0.0004473682,0.00097091927,0.000086197,0.00012858964,0.00032421018,0.0005391342,0.11615338,0.02984231,0.8467448,0.004280819,0.00012749177],"about_ca_topic_score_codex":0.0016267945,"about_ca_topic_score_gemma":0.0021542923,"teacher_disagreement_score":0.011617899,"about_ca_system_score_codex":0.0023401047,"about_ca_system_score_gemma":0.0033641658,"threshold_uncertainty_score":0.038865745},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4479399,0.0022454388,0.45271584,0.00254329,0.00028609595,0.00015424642,0.00053313177,0.0012038338,0.09237822],"genre_scores_gemma":[0.971126,0.00032462896,0.022822848,0.0002872279,0.000104930565,0.000053992768,0.00014631476,0.00006552093,0.005068486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858236,0.00026554146,0.00008699793,0.00049615523,0.00037034767,0.00019855464],"domain_scores_gemma":[0.9949321,0.0033959271,0.0003653292,0.0006543671,0.00042350366,0.00022873344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015726343,0.00034251637,0.0004995377,0.0008452994,0.0013787065,0.0027416812,0.0010466625,0.0008478804,0.0035405012],"category_scores_gemma":[0.005163479,0.0003683915,0.0010265225,0.0004611698,0.0036949643,0.0075006313,0.002012354,0.0025508904,0.00040817153],"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.000046141053,0.00002116815,0.000522647,0.000058168167,0.0000068974337,0.00014324872,0.000706493,0.0010452258,0.0022124602,0.98654085,0.0004743047,0.008222419],"study_design_scores_gemma":[0.000014165686,0.000041171046,0.00020838372,0.000034816574,0.000014713052,0.00019752399,0.00022078051,0.0060891793,0.004693794,0.98090726,0.007561899,0.000016448788],"about_ca_topic_score_codex":0.00050315063,"about_ca_topic_score_gemma":0.000327989,"teacher_disagreement_score":0.0035405012,"about_ca_system_score_codex":0.00085419783,"about_ca_system_score_gemma":0.00052717555,"threshold_uncertainty_score":0.011844218},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7764862,0.0015495534,0.1432779,0.0024123518,0.00038137299,0.000087667606,0.00053124764,0.00020979285,0.07506395],"genre_scores_gemma":[0.9460915,0.0008631121,0.04254014,0.00022398603,0.00027704518,0.00005173001,0.00031840726,0.00007440438,0.009559814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995177,0.00012182068,0.000024048706,0.00007151941,0.00016889643,0.00009610597],"domain_scores_gemma":[0.99882704,0.0006364917,0.00014103687,0.0000993376,0.00017202852,0.00012407292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006856524,0.0005280904,0.0006316238,0.0012899683,0.0025453642,0.002558834,0.0011130308,0.0010817637,0.0059538796],"category_scores_gemma":[0.0026835622,0.0003623815,0.00067531265,0.0014293398,0.0036324093,0.0051233163,0.0015353411,0.0020936313,0.001047674],"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.00004677276,0.000024672674,0.00061529264,0.0000580321,0.0000049682117,0.0001517721,0.00039485563,0.000890904,0.0009970602,0.98999256,0.0009899042,0.0058332398],"study_design_scores_gemma":[0.000009052871,0.000016174881,0.00022820737,0.000020478443,0.000006464725,0.00019448221,0.00031361493,0.004789005,0.0008903137,0.9904936,0.0030256524,0.000012968331],"about_ca_topic_score_codex":0.00087174226,"about_ca_topic_score_gemma":0.0010942635,"teacher_disagreement_score":0.0059538796,"about_ca_system_score_codex":0.0008789729,"about_ca_system_score_gemma":0.00054291775,"threshold_uncertainty_score":0.019917727},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39438987,0.0015948693,0.47917232,0.0026746953,0.0007215223,0.00018443738,0.0005100477,0.00050881563,0.12024343],"genre_scores_gemma":[0.92680144,0.0008327918,0.0538881,0.0007454572,0.0011295888,0.00016245065,0.00036619222,0.00019395127,0.015880035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824,0.00030070843,0.00010547416,0.00045703904,0.000662336,0.00023449455],"domain_scores_gemma":[0.9972909,0.0009974458,0.00034629006,0.0003408001,0.0005378008,0.00048664713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025325539,0.0006070192,0.0008032538,0.003034912,0.002158498,0.0042060884,0.0012809816,0.0006449165,0.006198621],"category_scores_gemma":[0.005386887,0.00045213656,0.0007945547,0.001587971,0.007095226,0.009138499,0.002780933,0.0030551504,0.0008516666],"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.000010610918,0.000016603108,0.00014766496,0.000010455073,0.00000254924,0.000036154153,0.00013252061,0.00012390906,0.0002910377,0.99645644,0.00022891352,0.0025431127],"study_design_scores_gemma":[0.000015291747,0.00002089867,0.00034084532,0.0000079370375,0.0000048449983,0.000100684425,0.00007009139,0.0021059606,0.0007701224,0.99407864,0.0024751474,0.000009604091],"about_ca_topic_score_codex":0.00079085823,"about_ca_topic_score_gemma":0.0007847751,"teacher_disagreement_score":0.006198621,"about_ca_system_score_codex":0.0010564232,"about_ca_system_score_gemma":0.0007555431,"threshold_uncertainty_score":0.020736456},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67550844,0.0013115987,0.21308988,0.0008904036,0.00013336548,0.00008980202,0.0004028745,0.00028878695,0.10828493],"genre_scores_gemma":[0.97494113,0.0004177783,0.016230455,0.00011849849,0.000055168122,0.00004156785,0.00025436166,0.00004918617,0.007891812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996056,0.00005529408,0.000018674507,0.000102435115,0.00014732072,0.00007075728],"domain_scores_gemma":[0.99902284,0.0003131092,0.00018134252,0.0001208806,0.00011384567,0.00024792826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032586927,0.00042536686,0.00034181896,0.0012355956,0.0009796666,0.0015655675,0.0006054346,0.00036005845,0.0044013183],"category_scores_gemma":[0.0013877909,0.00022674093,0.0004469378,0.00073282246,0.002170561,0.002982317,0.0018265384,0.0013389789,0.00045104226],"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.000029849227,0.000018012677,0.0004551557,0.000032481654,0.0000052944197,0.00019678446,0.00026726437,0.0013646776,0.0020577256,0.9890531,0.00057293795,0.005946699],"study_design_scores_gemma":[0.000008870456,0.000016284768,0.0005640342,0.000011729702,0.0000068929917,0.00032828178,0.00017664487,0.0072698602,0.0025903652,0.9813091,0.007704241,0.000013750341],"about_ca_topic_score_codex":0.000971162,"about_ca_topic_score_gemma":0.0008577053,"teacher_disagreement_score":0.0044013183,"about_ca_system_score_codex":0.0010104447,"about_ca_system_score_gemma":0.00028152418,"threshold_uncertainty_score":0.014723897},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84948426,0.0015136813,0.106805295,0.0009439878,0.00015991005,0.000069991365,0.00038611842,0.00047887518,0.040157914],"genre_scores_gemma":[0.9841696,0.0003824023,0.008428776,0.000067578876,0.00020409487,0.000072653966,0.00022769862,0.000059767513,0.006387422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925584,0.00014293242,0.000042857362,0.00016752792,0.00023549868,0.00015526683],"domain_scores_gemma":[0.9965088,0.0020139522,0.00047730247,0.00024225841,0.00029258474,0.00046508224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012651175,0.00070115866,0.0008070209,0.002625442,0.0012832199,0.0020361992,0.00093350234,0.0005393953,0.005789752],"category_scores_gemma":[0.005098367,0.0003045352,0.00091062026,0.0012029387,0.002641006,0.0037361854,0.0014594218,0.0013117878,0.00074554817],"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.00010135657,0.000035853976,0.0013319507,0.00008943083,0.000011680235,0.00019803214,0.00057674095,0.0044646575,0.0019891246,0.9817281,0.0006854739,0.0087876655],"study_design_scores_gemma":[0.000023665583,0.00006501134,0.0007491543,0.000021521493,0.000017291124,0.0002480377,0.00009974174,0.030208629,0.0023034683,0.962763,0.0034801853,0.000020269523],"about_ca_topic_score_codex":0.000643051,"about_ca_topic_score_gemma":0.00048044903,"teacher_disagreement_score":0.005789752,"about_ca_system_score_codex":0.002034217,"about_ca_system_score_gemma":0.0006388327,"threshold_uncertainty_score":0.019368649},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66724837,0.0035934667,0.19447254,0.004120492,0.00042596544,0.00014947567,0.0007061587,0.0003386797,0.12894489],"genre_scores_gemma":[0.94043523,0.0007964872,0.03267052,0.00045776856,0.00031460082,0.00007769781,0.00056301075,0.00006411308,0.02462052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988098,0.0002424425,0.000082011255,0.00022083189,0.00037337403,0.00027146525],"domain_scores_gemma":[0.9988103,0.00030066108,0.00015653078,0.00014075985,0.00022052054,0.00037118632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000747454,0.00052377867,0.00048000272,0.002167959,0.0020706237,0.0024376207,0.0007480405,0.0008142634,0.006347854],"category_scores_gemma":[0.0017594118,0.00040660833,0.00073691225,0.0010176484,0.0035385387,0.0042298,0.0025977744,0.0013378991,0.0010058427],"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.000015445117,0.000007023571,0.0002388374,0.000023912102,0.0000035437888,0.000064248445,0.00063849037,0.00024724114,0.000647138,0.99569196,0.0004905051,0.0019317098],"study_design_scores_gemma":[0.000018093,0.00004111365,0.0007113531,0.000024646053,0.000007578841,0.00012295709,0.00041354494,0.004787402,0.0005089844,0.98311114,0.010233764,0.000019489957],"about_ca_topic_score_codex":0.0020237775,"about_ca_topic_score_gemma":0.0018852358,"teacher_disagreement_score":0.006347854,"about_ca_system_score_codex":0.001907426,"about_ca_system_score_gemma":0.0006085763,"threshold_uncertainty_score":0.021235704},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94889313,0.0002005275,0.026797589,0.0003356689,0.000038268277,0.00002845422,0.00017678794,0.00013364905,0.023396002],"genre_scores_gemma":[0.99549896,0.000063184765,0.0021362426,0.000033077555,0.00004222912,0.000016772996,0.00025208358,0.000018064038,0.0019393984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835974,0.00021732062,0.00015683603,0.00038867467,0.00046296293,0.0004144768],"domain_scores_gemma":[0.9946268,0.0023242093,0.0007889908,0.0007600074,0.0006470946,0.0008528918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014698509,0.00040869287,0.00074191653,0.00083185715,0.0015690954,0.0021357639,0.0008459673,0.00062488345,0.0034468344],"category_scores_gemma":[0.0056840363,0.0002539832,0.0006186727,0.00056070247,0.004013332,0.0061888886,0.003878306,0.002094544,0.0004264688],"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.0005874733,0.00012143572,0.017604291,0.00024655391,0.000042626893,0.0015242322,0.0025210467,0.004231268,0.012037712,0.94426185,0.0009702447,0.015851298],"study_design_scores_gemma":[0.000058254045,0.0002620341,0.007030416,0.00005903141,0.000044756,0.0021608623,0.0016775709,0.012780307,0.022518612,0.94608164,0.0072384723,0.00008809169],"about_ca_topic_score_codex":0.0007001907,"about_ca_topic_score_gemma":0.00046943408,"teacher_disagreement_score":0.0034468344,"about_ca_system_score_codex":0.00086026103,"about_ca_system_score_gemma":0.0006690227,"threshold_uncertainty_score":0.011530876},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008726673,0.005820571,0.043507136,0.1511095,0.7150098,0.00006704913,0.0026987079,0.0028342456,0.070226364],"genre_scores_gemma":[0.19168067,0.012806275,0.093749285,0.055204805,0.11431404,0.00031284807,0.005931344,0.011320495,0.51468027],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99675554,0.0005654693,0.00048348663,0.0006062292,0.0014055211,0.00018373183],"domain_scores_gemma":[0.9856656,0.0049938853,0.0008134688,0.0014929327,0.0065620695,0.0004720166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029175207,0.0014609256,0.0010068964,0.0027239758,0.0030360045,0.0033840982,0.0015585924,0.0023501106,0.029920869],"category_scores_gemma":[0.029039811,0.0007858,0.0010303814,0.0017459433,0.0030760118,0.005586873,0.0018187308,0.0057414942,0.016140033],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00016580893,0.00003170267,0.00043574866,0.00028708426,0.000023454017,0.00045353832,0.00038870235,0.0003117049,0.0008661245,0.088122,0.8819705,0.026943585],"study_design_scores_gemma":[0.000041704232,0.000047900856,0.0013993595,0.00036612293,0.00007982474,0.0013233313,0.00031029113,0.0018303912,0.0037234568,0.08109467,0.9096872,0.00009574831],"about_ca_topic_score_codex":0.004284927,"about_ca_topic_score_gemma":0.0035120188,"teacher_disagreement_score":0.029920869,"about_ca_system_score_codex":0.0029644633,"about_ca_system_score_gemma":0.0015521058,"threshold_uncertainty_score":0.10009533},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76559275,0.00029781688,0.15415467,0.0006753532,0.00018122759,0.00006652168,0.00023418912,0.00052089547,0.078276604],"genre_scores_gemma":[0.9486144,0.00020530008,0.027054211,0.00011248883,0.000037119862,0.00002145268,0.00016997363,0.00016688216,0.02361808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998211,0.000022310871,0.0000064726855,0.000047292015,0.000045985817,0.000056833716],"domain_scores_gemma":[0.99958664,0.00006852044,0.0000613856,0.000102704325,0.0000903592,0.000090424386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020011286,0.00038080895,0.00020211651,0.0007536286,0.0015692113,0.0017483409,0.00035068273,0.00059734273,0.005294321],"category_scores_gemma":[0.0010261558,0.00020575536,0.0005063494,0.00026999685,0.0017204505,0.0020023496,0.0015406207,0.0010299638,0.0009102689],"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.000042153664,0.000012294681,0.0011768956,0.000021734633,0.0000056064355,0.00020634843,0.0006595911,0.0014324811,0.004160124,0.98071563,0.0010067531,0.010560465],"study_design_scores_gemma":[0.000012228353,0.00005668522,0.0016761043,0.000025627782,0.00001313695,0.00045177952,0.0007394462,0.01014298,0.006184326,0.9585802,0.022090407,0.000027071686],"about_ca_topic_score_codex":0.0023544603,"about_ca_topic_score_gemma":0.0022660475,"teacher_disagreement_score":0.005294321,"about_ca_system_score_codex":0.0005528163,"about_ca_system_score_gemma":0.00031974085,"threshold_uncertainty_score":0.017711282},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3136001,0.0004266456,0.6775993,0.00013576528,0.000060597846,0.00018970983,0.0003602464,0.0015936898,0.0060339062],"genre_scores_gemma":[0.81579167,0.0002321453,0.18207237,0.000029124527,0.000049851264,0.000057458234,0.00043638714,0.00013494467,0.0011960093],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980877,0.00018311931,0.00013797231,0.0004595717,0.0008763078,0.00025524176],"domain_scores_gemma":[0.9968059,0.000762308,0.0008508517,0.0006016517,0.0007272291,0.0002521143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097199174,0.0007512344,0.001080026,0.0073662857,0.00075983565,0.0021067376,0.0011241013,0.0008556128,0.0033304207],"category_scores_gemma":[0.0075222775,0.00039320995,0.00070453825,0.003086009,0.0014968736,0.003499557,0.002452636,0.0009513003,0.0008784977],"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.0012280828,0.00023470256,0.041852895,0.00047620796,0.00020346497,0.002180211,0.0018413734,0.03325003,0.1149629,0.117717125,0.0032841733,0.6827689],"study_design_scores_gemma":[0.00017484787,0.0007928356,0.031530086,0.00015240164,0.00017720541,0.0048879413,0.0022348212,0.6661944,0.11969802,0.14781536,0.026032872,0.00030913635],"about_ca_topic_score_codex":0.0010608728,"about_ca_topic_score_gemma":0.00082002464,"teacher_disagreement_score":0.0073662857,"about_ca_system_score_codex":0.0007488525,"about_ca_system_score_gemma":0.00063429226,"threshold_uncertainty_score":0.0111413},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9153434,0.00046780147,0.039841756,0.0004936341,0.00037858562,0.00007035603,0.00012082357,0.0002258496,0.043057624],"genre_scores_gemma":[0.9783724,0.0002512283,0.0068702507,0.0001282,0.00021798637,0.000046582652,0.00012166359,0.00006876176,0.013922936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996136,0.00007251724,0.000018118715,0.00006194896,0.00010395643,0.00012998073],"domain_scores_gemma":[0.9995572,0.00008156622,0.00011819911,0.00007845703,0.00007517945,0.00008941755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040281977,0.0004900743,0.00033134685,0.0012665928,0.000990776,0.0014665248,0.00047053027,0.00055945816,0.0050883945],"category_scores_gemma":[0.0012122182,0.00020491818,0.0007718671,0.00062338356,0.0021620307,0.0017318166,0.0014928794,0.000678611,0.0009852382],"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.00012888436,0.000049923045,0.0015073053,0.000062658866,0.00001494441,0.0007557644,0.0017654928,0.0029962584,0.011781693,0.9663431,0.0011137632,0.013480207],"study_design_scores_gemma":[0.000034324603,0.000090412075,0.0015036581,0.000023857978,0.000011210764,0.00040807587,0.00029366967,0.009570433,0.0053927465,0.9730877,0.009540556,0.000043303637],"about_ca_topic_score_codex":0.001424734,"about_ca_topic_score_gemma":0.00086741755,"teacher_disagreement_score":0.0050883945,"about_ca_system_score_codex":0.0008162856,"about_ca_system_score_gemma":0.0007846797,"threshold_uncertainty_score":0.017022371},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46521935,0.0011162353,0.48147827,0.000389002,0.0001436195,0.00006384361,0.00026097987,0.00029774237,0.051031005],"genre_scores_gemma":[0.92177814,0.00050857355,0.06427819,0.00014906387,0.00017522057,0.00004554011,0.00031178858,0.00012513353,0.012628233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952674,0.000071403854,0.000031726664,0.00013900125,0.00013081217,0.00010036041],"domain_scores_gemma":[0.9991216,0.00018838637,0.00020547576,0.00017604815,0.000120903154,0.00018756051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004250276,0.00043113416,0.000331723,0.0016078753,0.00066393777,0.0012279517,0.0004055413,0.00035355063,0.0043281224],"category_scores_gemma":[0.0009451709,0.00020475841,0.00063693715,0.00076680374,0.0017556162,0.0022924216,0.0017305656,0.0010003072,0.00059653545],"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.00006426435,0.00003697832,0.0016334945,0.00005584816,0.000012007575,0.00018706641,0.0006924821,0.0044215405,0.012421999,0.9561,0.0007590809,0.023615342],"study_design_scores_gemma":[0.0000073720366,0.00006168271,0.0013770587,0.00002211163,0.000012550917,0.00036175197,0.00042394106,0.010714224,0.003666155,0.97566503,0.007668623,0.000019549841],"about_ca_topic_score_codex":0.00040858824,"about_ca_topic_score_gemma":0.0005790813,"teacher_disagreement_score":0.0043281224,"about_ca_system_score_codex":0.00036201705,"about_ca_system_score_gemma":0.00019208403,"threshold_uncertainty_score":0.014479041},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045344353,0.00037667996,0.9233648,0.0006074663,0.00018707472,0.00035114365,0.0009891067,0.020003457,0.00877583],"genre_scores_gemma":[0.23674399,0.00017834186,0.74872476,0.00025137668,0.00008178849,0.00042804002,0.0035863526,0.0015283213,0.008477101],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897647,0.00015823844,0.00010242143,0.0003410216,0.00021550145,0.00020629584],"domain_scores_gemma":[0.9984981,0.00050325313,0.00007314661,0.0006083582,0.0002366075,0.00008049804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092448207,0.0011329066,0.0010208538,0.000903699,0.0011829174,0.0015622005,0.0018979487,0.0013069466,0.017427567],"category_scores_gemma":[0.0025737197,0.0006329939,0.0012646056,0.0013665512,0.0008436221,0.00378334,0.0026331414,0.0014152372,0.004754277],"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.0008397789,0.00025395272,0.002857151,0.0005932789,0.00009350956,0.00040675295,0.000937111,0.037987616,0.03299133,0.10634516,0.03253946,0.7841548],"study_design_scores_gemma":[0.00038721555,0.00045705008,0.0010199888,0.00011638949,0.00010672466,0.00046838695,0.00075219804,0.33377442,0.045046676,0.5639243,0.05382907,0.000117580654],"about_ca_topic_score_codex":0.0019971177,"about_ca_topic_score_gemma":0.0025608148,"teacher_disagreement_score":0.017427567,"about_ca_system_score_codex":0.0011703812,"about_ca_system_score_gemma":0.0014183768,"threshold_uncertainty_score":0.05830103},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93272763,0.0003254669,0.05050427,0.00030626036,0.000026518313,0.00003750965,0.00010292107,0.00023450197,0.015734982],"genre_scores_gemma":[0.9935183,0.00008513829,0.003848225,0.00002158533,0.000022328855,0.000026570877,0.00006879346,0.000020096419,0.0023888182],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905306,0.00015397646,0.00006859832,0.0003042811,0.00019178017,0.0002283333],"domain_scores_gemma":[0.9974669,0.0012732293,0.0003841902,0.00045479057,0.00019422577,0.00022669428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080932816,0.00036250523,0.0005146315,0.0014327324,0.00095069874,0.002881181,0.00082520244,0.00058503984,0.002983253],"category_scores_gemma":[0.0035149655,0.00033409157,0.0007747082,0.00055094104,0.0042215553,0.0049011013,0.0017772145,0.001344601,0.00022787965],"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.00012657604,0.00006596555,0.0027753671,0.00006635307,0.000018257297,0.00031567586,0.0017936077,0.004525806,0.004405663,0.975371,0.00016512549,0.010370626],"study_design_scores_gemma":[0.00004769676,0.0000896273,0.0015287146,0.000025570393,0.000026734213,0.00030720502,0.0005200579,0.020255858,0.010081202,0.96351874,0.0035643782,0.00003412263],"about_ca_topic_score_codex":0.0009428832,"about_ca_topic_score_gemma":0.000550667,"teacher_disagreement_score":0.002983253,"about_ca_system_score_codex":0.0013566912,"about_ca_system_score_gemma":0.00046936673,"threshold_uncertainty_score":0.009979963},"labels":[],"label_agreement":null}]}