{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":111,"total_is_capped":false,"direct_labels_cover":1,"predictions_cover":111,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"b775345ec586","filters":{"venue":"ACM communications in computer algebra"}},"results":[{"id":"W2134848647","doi":"10.1145/2576802.2576804","title":"Asymptotic series of generalized Lambert W function","year":2014,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Sports Dynamics and Biomechanics","field":"Engineering","cited_by":41,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Lambert W function; Generalization; Series (stratigraphy); Function (biology); Mathematics; Applied mathematics; Calculus (dental); Mathematical analysis","authors":[{"name":"G. J. Fee","is_ca":true},{"name":"Johannes Grotendorst","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01404376924197346,"gpt":0.2217566534244807,"spread":0.2077128841825073,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001301729,0.0007321977,0.000671875,0.002067316,0.0005963399,0.00153499,0.001163896,0.00098644,0.006082014],"category_scores_gemma":[0.006746399,0.0002780967,0.0009149846,0.001011354,0.001767206,0.003788631,0.001148671,0.001928078,0.001277136],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006908745,"about_ca_system_score_gemma":0.0004927304,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006968165,"about_ca_topic_score_gemma":0.0005831948,"domain_scores_codex":[0.9995528,0.0001391939,0.00002132158,0.00007575654,0.0001407751,0.00007013106],"domain_scores_gemma":[0.9986956,0.0004192576,0.000141706,0.0002341195,0.0003580207,0.0001514418],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000203213,0.00001601503,0.0002667072,0.00006236079,0.0000127265,0.000172992,0.0001212685,0.01066368,0.003230738,0.9719996,0.001563563,0.01187002],"study_design_scores_gemma":[0.000008584895,0.00003507392,0.0005179574,0.00004646477,0.0000118289,0.0003197852,0.00009107031,0.2166263,0.001739662,0.7732459,0.007322044,0.00003526302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.121578,0.001924675,0.8168399,0.001140609,0.000664673,0.00005778137,0.0001403392,0.0005659635,0.05708812],"genre_scores_gemma":[0.8308001,0.003565307,0.1123888,0.0008779315,0.001350154,0.0001946944,0.0002815109,0.000543899,0.04999761],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006082014,"threshold_uncertainty_score":0.0203464,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2168645231","doi":"10.1145/1823931.1823933","title":"A package for solving parametric polynomial systems","year":2010,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Discriminant; Polynomial; Parametric statistics; Generalization; Univariate; Variety (cybernetics); Complement (music); Algebraic variety; Mathematics; Algebra over a field; Applied mathematics; Discrete mathematics; Pure mathematics; Algebraic number; Computer science; Mathematical analysis; Artificial intelligence; Multivariate statistics","authors":[{"name":"Jürgen Gerhard","is_ca":false},{"name":"David J. Jeffrey","is_ca":true},{"name":"Guillaume Moroz","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03375460156274802,"gpt":0.2942596164167215,"spread":0.2605050148539735,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009861055,0.001916367,0.001636532,0.001848356,0.0006799965,0.002163067,0.002734785,0.001128247,0.1323348],"category_scores_gemma":[0.003717159,0.001165744,0.002400858,0.001418219,0.000508629,0.002788933,0.002954857,0.003321806,0.05476983],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005448023,"about_ca_system_score_gemma":0.001022869,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008306124,"about_ca_topic_score_gemma":0.001618295,"domain_scores_codex":[0.9990934,0.0001476702,0.00007792998,0.0001337513,0.00045145,0.00009584226],"domain_scores_gemma":[0.9986945,0.0005951218,0.0000591251,0.0002722791,0.0003294109,0.00004950783],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001803256,0.0001939035,0.0008274323,0.00156265,0.0001617958,0.0005008434,0.0002785822,0.02135794,0.008793061,0.1327261,0.2647076,0.5687098],"study_design_scores_gemma":[0.0002460401,0.0001173061,0.0006914952,0.0001968019,0.00007807364,0.001004128,0.00008945818,0.1526981,0.01136074,0.1779917,0.6554209,0.0001053094],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"software","genre_scores_codex":[0.0005592163,0.0002452981,0.9413034,0.0001282306,0.00009901419,0.0001084742,0.003778443,0.04391084,0.009867202],"genre_scores_gemma":[0.02141083,0.0008557902,0.9132836,0.0004117149,0.0001931608,0.001294489,0.01404787,0.01886674,0.02963575],"genre_candidate":"software","genre_consensus":null,"teacher_disagreement_score":0.1323348,"threshold_uncertainty_score":0.442704,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2410607505","doi":"10.1145/2992274.2992275","title":"Fleshing out the generalized Lambert <i>W</i> function","year":2016,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Sports Dynamics and Biomechanics","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Université de Limoges; Simon Fraser University; Forschungszentrum Jülich","keywords":"Lambert W function; Transcendental number; Function (biology); Transcendental function; Transcendental equation; Mathematics; Algebraic number; Calculus (dental); Applied mathematics; Mathematical analysis; Differential equation","authors":[{"name":"Aude Maignan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02445126469731846,"gpt":0.2429310169494887,"spread":0.2184797522521703,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009954106,0.001034375,0.0006047082,0.001531794,0.000925355,0.001833774,0.001230576,0.00115059,0.005159163],"category_scores_gemma":[0.002397648,0.000290759,0.001022285,0.000854427,0.002883541,0.005623563,0.001814263,0.003098467,0.00135906],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007128324,"about_ca_system_score_gemma":0.000625829,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000664541,"about_ca_topic_score_gemma":0.0005595227,"domain_scores_codex":[0.9995922,0.00007724808,0.00003000418,0.0001103274,0.0001342258,0.00005603279],"domain_scores_gemma":[0.9994633,0.0001337179,0.00005763875,0.0001476108,0.0001362347,0.00006156773],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001475581,0.000007824819,0.0001375596,0.00005622528,0.00000959089,0.0002050775,0.0002153443,0.002160806,0.004816067,0.970509,0.001356609,0.02051111],"study_design_scores_gemma":[0.000006579354,0.00005472559,0.000207339,0.00003440956,0.00001430354,0.0005728619,0.0001549915,0.02712188,0.0070862,0.9383655,0.02634202,0.00003931308],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05227621,0.001404942,0.8936404,0.001886051,0.001141572,0.00003391183,0.00006719419,0.0003246969,0.049225],"genre_scores_gemma":[0.6112731,0.003723304,0.3095498,0.001556881,0.001239048,0.00007628155,0.0001372915,0.0006804459,0.07176369],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005159163,"threshold_uncertainty_score":0.01725912,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2087700323","doi":"10.1145/1838599.1838602","title":"LU factoring of non-invertible matrices","year":2010,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Factoring; Invertible matrix; Rank (graph theory); Extension (predicate logic); Mathematics; Matrix (chemical analysis); Basis (linear algebra); Fraction (chemistry); Computation; Algebra over a field; Computer science; Algorithm; Pure mathematics; Combinatorics; Programming language","authors":[{"name":"David J. Jeffrey","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02447850481722616,"gpt":0.2936675261053943,"spread":0.2691890212881681,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000945052,0.0009990133,0.0006086401,0.001033232,0.000541696,0.001640482,0.0005713497,0.0004890432,0.007915735],"category_scores_gemma":[0.006585123,0.0002839529,0.0006179279,0.0008659262,0.001791684,0.002904214,0.001430495,0.001195386,0.003024945],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004104042,"about_ca_system_score_gemma":0.0005552822,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008610606,"about_ca_topic_score_gemma":0.0009018871,"domain_scores_codex":[0.9987887,0.0002830442,0.00009434792,0.0002531454,0.0004431757,0.0001377499],"domain_scores_gemma":[0.9977003,0.0006761908,0.0002020843,0.0006507156,0.0006749184,0.00009577838],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002275422,0.00005219862,0.0007131659,0.0002849901,0.00003464197,0.0003123938,0.0007807664,0.03208143,0.02755256,0.6541434,0.008084574,0.2757323],"study_design_scores_gemma":[0.00004340509,0.0002970551,0.0004298199,0.0001296378,0.00003001887,0.0006678712,0.0002731389,0.2017244,0.05405908,0.6812697,0.06097637,0.00009947983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006973275,0.0002092111,0.9880966,0.00005969543,0.00006284378,0.00002476494,0.00006443894,0.0005121236,0.003997047],"genre_scores_gemma":[0.2719598,0.0009311495,0.7092828,0.0003371178,0.000360898,0.0001693942,0.0005759824,0.0007606431,0.01562211],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007915735,"threshold_uncertainty_score":0.02648079,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2102483896","doi":"10.1145/1151446.1151453","title":"Symbolic computation of Fenchel conjugates","year":2006,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University; Okanagan University College; University of British Columbia, Okanagan Campus","funders":"","keywords":"Subderivative; Conic optimization; Convex analysis; Convex optimization; Proper convex function; Mathematical optimization; Mathematics; Optimization problem; Computation; Computer science; Linear matrix inequality; Symbolic regression; Regular polygon; Algorithm; Genetic programming; Artificial intelligence","authors":[{"name":"Heinz H. Bauschke","is_ca":true},{"name":"Martin v. Mohrenschildt","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07513176899859404,"gpt":0.3909259048507741,"spread":0.3157941358521801,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007132616,0.0006536068,0.001069286,0.00142352,0.0008503182,0.002464157,0.001007962,0.0008463822,0.01037388],"category_scores_gemma":[0.00687024,0.0003269435,0.0006944153,0.001174185,0.002060961,0.003345723,0.002221191,0.001265064,0.002261525],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009644483,"about_ca_system_score_gemma":0.0009208118,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000738394,"about_ca_topic_score_gemma":0.00102413,"domain_scores_codex":[0.9993132,0.0001760351,0.00004432704,0.0001052674,0.0002862486,0.00007484209],"domain_scores_gemma":[0.9988758,0.00059115,0.00007617256,0.0002196411,0.0001920316,0.00004507054],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005854736,0.00001534462,0.000402545,0.00009674246,0.00001753883,0.0002033216,0.0002760734,0.05873365,0.002046283,0.8693966,0.003090748,0.06566253],"study_design_scores_gemma":[0.00001432316,0.0000223453,0.0001137743,0.00003672453,0.000009700159,0.0001257847,0.00008943534,0.3177938,0.006776406,0.6584702,0.01652373,0.00002373446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03657594,0.0003808771,0.9374395,0.0004085159,0.0001511502,0.00003339666,0.0001735191,0.001104844,0.0237323],"genre_scores_gemma":[0.6264515,0.0008430484,0.3560142,0.0002347805,0.000136381,0.0001379681,0.0004382686,0.000902391,0.01484142],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01037388,"threshold_uncertainty_score":0.03470415,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2008160486","doi":"10.1145/2110170.2110174","title":"Computing the real solutions of polynomial systems with the RegularChains library in Maple","year":2012,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"Western University","funders":"","keywords":"Citation; China; Maple; Library science; Computer science; History; Archaeology; Botany; Biology","authors":[{"name":"Changbo Chen","is_ca":true},{"name":"James H. Davenport","is_ca":false},{"name":"François Lemaire","is_ca":false},{"name":"Marc Moreno Maza","is_ca":true},{"name":"Bican Xia","is_ca":false},{"name":"Rong Xiao","is_ca":true},{"name":"Yuzhen Xie","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03529326749573489,"gpt":0.2624975572434372,"spread":0.2272042897477023,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001966824,0.0008611505,0.001106385,0.001248931,0.0009197215,0.002850411,0.001631611,0.0007507706,0.04449327],"category_scores_gemma":[0.009535429,0.0006135835,0.001129817,0.001718791,0.0009682153,0.004909346,0.004091381,0.001790553,0.01847354],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009557656,"about_ca_system_score_gemma":0.001351662,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001936169,"about_ca_topic_score_gemma":0.003772086,"domain_scores_codex":[0.9985602,0.0004271086,0.00006661125,0.0001220122,0.0006257285,0.0001981462],"domain_scores_gemma":[0.9970658,0.001394193,0.0001120803,0.0007789966,0.0004486494,0.0002001559],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0009042174,0.0002307396,0.002371306,0.0007662253,0.000115145,0.0003406321,0.0004852104,0.1293317,0.00421263,0.3265215,0.1176465,0.4170741],"study_design_scores_gemma":[0.0001707711,0.00008863302,0.0003306131,0.00007745445,0.0000243098,0.0001136757,0.00009572891,0.5775855,0.006421044,0.3586855,0.05635814,0.00004852082],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01826463,0.0005024787,0.9139001,0.0008909965,0.0002473738,0.0001165134,0.001520909,0.02475859,0.03979845],"genre_scores_gemma":[0.4426509,0.001006703,0.512414,0.0003988347,0.0003436276,0.0004844195,0.004454365,0.00513095,0.0331162],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.04449327,"threshold_uncertainty_score":0.1488449,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2003274056","doi":"10.1145/1940475.1940521","title":"Sparse polynomial multiplication and division in Maple 14","year":2011,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Maple; Division (mathematics); Multiplication (music); Speedup; Polynomial; Computer science; Mathematics; Parallel computing; Arithmetic; Combinatorics; Botany","authors":[{"name":"Michael Monagan","is_ca":true},{"name":"Roman Pearce","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05606922906255839,"gpt":0.279389569565861,"spread":0.2233203405033026,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001073333,0.0008543748,0.0007464325,0.0009641856,0.0007515895,0.001882894,0.001556438,0.0005911004,0.01922227],"category_scores_gemma":[0.005401072,0.0005102881,0.0007814502,0.001562512,0.0009033676,0.00328263,0.002440152,0.001352022,0.007436002],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008340859,"about_ca_system_score_gemma":0.001420064,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001254165,"about_ca_topic_score_gemma":0.001761818,"domain_scores_codex":[0.9984944,0.0002827242,0.00009897851,0.000208427,0.0006656282,0.0002497508],"domain_scores_gemma":[0.9976355,0.000880848,0.0001763138,0.0007107981,0.0004646925,0.0001318004],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00300687,0.0004318078,0.004480808,0.0009834239,0.0001415546,0.0006319932,0.00104286,0.06119263,0.03033815,0.184761,0.1656934,0.5472955],"study_design_scores_gemma":[0.0006796201,0.0006478882,0.001908039,0.0001553705,0.00008398388,0.0006779017,0.0002059646,0.3605467,0.1561485,0.1728771,0.3058553,0.0002135249],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08252884,0.0005055236,0.7485506,0.0005957896,0.000225864,0.0002060817,0.003103696,0.1076188,0.05666488],"genre_scores_gemma":[0.435644,0.0003186252,0.5342077,0.0004734517,0.0001522153,0.0004870424,0.00514828,0.009323621,0.01424505],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01922227,"threshold_uncertainty_score":0.06430489,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2105849952","doi":"10.1145/2429135.2429173","title":"POLY","year":2013,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Maple; Speedup; Computer science; Kernel (algebra); Scalability; Parallel computing; Overhead (engineering); Data structure; Theoretical computer science; Mathematics; Operating system; Combinatorics; Botany","authors":[{"name":"Michael Monagan","is_ca":true},{"name":"Roman Pearce","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02963639807677917,"gpt":0.2762222967101013,"spread":0.2465858986333221,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002710879,0.000585485,0.0005097394,0.0007940283,0.001060103,0.002563498,0.001059844,0.0004087383,0.09005038],"category_scores_gemma":[0.001438529,0.0002595591,0.0005977676,0.001049771,0.0005795534,0.002706934,0.00287085,0.001249739,0.04116204],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005962992,"about_ca_system_score_gemma":0.0008647916,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001424357,"about_ca_topic_score_gemma":0.002516225,"domain_scores_codex":[0.9991688,0.00007078904,0.00004819114,0.0002398955,0.0003285246,0.0001438623],"domain_scores_gemma":[0.9992533,0.00007780766,0.00005062206,0.0003078964,0.0002410697,0.00006919512],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0004094528,0.0001522062,0.00176671,0.0003320602,0.00004085045,0.0003902671,0.0002029,0.008787625,0.01272451,0.5966924,0.1538687,0.2246324],"study_design_scores_gemma":[0.0000673734,0.0001014926,0.001203631,0.00006209157,0.00002890303,0.0006017917,0.0001069757,0.05325164,0.02309165,0.2419865,0.679442,0.00005612593],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"software","genre_scores_codex":[0.02584445,0.0006991755,0.6310675,0.00133616,0.00139823,0.0001836687,0.006921395,0.01871609,0.3138333],"genre_scores_gemma":[0.3752732,0.001009037,0.3322896,0.001987736,0.0007412427,0.0006353664,0.02039432,0.007635602,0.2600339],"genre_candidate":"software","genre_consensus":null,"teacher_disagreement_score":0.09005038,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2594898845","doi":"10.1145/3055282.3055289","title":"The bohemian eigenvalue project","year":2017,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Random Matrices and Applications","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Eigenvalues and eigenvectors; Bounded function; Cardinality (data modeling); Mathematics; Universality (dynamical systems); Combinatorics; Dimension (graph theory); Integer (computer science); Computer science; Mathematical analysis; Physics","authors":[{"name":"Robert M. Corless","is_ca":true},{"name":"Steven E. Thornton","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1376623971539809,"gpt":0.4142061094430495,"spread":0.2765437122890685,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000786192,0.0005222557,0.0005532738,0.001408136,0.001820368,0.002650738,0.0007118848,0.0008168069,0.02009582],"category_scores_gemma":[0.003524042,0.0003007668,0.0004258529,0.0007545936,0.002767892,0.003863659,0.003264215,0.001716851,0.003395899],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008185378,"about_ca_system_score_gemma":0.0007992949,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007662724,"about_ca_topic_score_gemma":0.0003979188,"domain_scores_codex":[0.998863,0.0003510176,0.00003252124,0.0002276611,0.0003578843,0.0001678607],"domain_scores_gemma":[0.9992047,0.0002770195,0.00005950095,0.0001336363,0.000161182,0.0001639143],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001314659,0.00000596842,0.00006106139,0.00001801662,0.000002700063,0.00001774092,0.00009741097,0.0003663777,0.0003177552,0.9927609,0.002287562,0.004051445],"study_design_scores_gemma":[0.000007118741,0.000006718262,0.0001396081,0.00001177094,0.000001638074,0.00004200183,0.00004688423,0.003362077,0.0002723335,0.9870759,0.009024994,0.000009051555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.185214,0.003786364,0.3878334,0.005349874,0.001258087,0.0001489098,0.001402103,0.0007932154,0.4142141],"genre_scores_gemma":[0.8879282,0.001691078,0.04515928,0.001273256,0.0009438128,0.0002610087,0.0008155343,0.0004520422,0.06147566],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02009582,"threshold_uncertainty_score":0.06722724,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2168997143","doi":"10.1145/1504347.1504374","title":"The modpn library","year":2009,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"Western University","funders":"","keywords":"Citation; Library science; Media studies; Computer science; History; Sociology","authors":[{"name":"Xin Li","is_ca":true},{"name":"Marc Moreno Maza","is_ca":true},{"name":"Raqeeb Rasheed","is_ca":true},{"name":"Éric Schost","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02482336750623272,"gpt":0.2725117109034723,"spread":0.2476883433972396,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001738254,0.001747228,0.001784126,0.003502388,0.001507351,0.005347262,0.004642762,0.001333043,0.4403984],"category_scores_gemma":[0.008234641,0.001685388,0.001930602,0.004586441,0.0008589296,0.008519782,0.006319261,0.003175627,0.437252],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001533307,"about_ca_system_score_gemma":0.002820315,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001821349,"about_ca_topic_score_gemma":0.002646741,"domain_scores_codex":[0.9977614,0.0002664714,0.0001682291,0.0003194727,0.001188861,0.0002956802],"domain_scores_gemma":[0.9974543,0.0004937678,0.0001087097,0.0009543811,0.0007380148,0.0002508331],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001031751,0.00004709616,0.0002202131,0.0004675032,0.00002619192,0.0001046302,0.00009884011,0.0006850507,0.00115694,0.03172534,0.7319833,0.2333817],"study_design_scores_gemma":[0.00003814315,0.00001887733,0.0001649511,0.00008770561,0.00001079622,0.000156645,0.00002388324,0.0026011,0.002179505,0.02734778,0.9673379,0.00003273096],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"software","genre_gemma":"software","genre_scores_codex":[0.0008850291,0.001799119,0.3360099,0.001260703,0.001109996,0.0002735464,0.02405175,0.3608893,0.2737207],"genre_scores_gemma":[0.02908133,0.006279847,0.3220259,0.002792694,0.001567232,0.001143988,0.08971264,0.2044961,0.3429003],"genre_candidate":"software","genre_consensus":"software","teacher_disagreement_score":0.4403984,"threshold_uncertainty_score":0.7982037,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2049605943","doi":"10.1145/2733693.2733720","title":"The Design of Maple's Sum-of-Products and POLY Data Structures for Representing Mathematical Objects","year":2015,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Maple; Computer science; Object (grammar); Kernel (algebra); Algebra over a field; Mathematics; Pure mathematics; Artificial intelligence","authors":[{"name":"Michael Monagan","is_ca":true},{"name":"Roman Pearce","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1565860519526134,"gpt":0.345271712053709,"spread":0.1886856601010956,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005113979,0.001298819,0.001699978,0.002394428,0.002492705,0.006910592,0.004419324,0.001411242,0.007927516],"category_scores_gemma":[0.01882164,0.001931424,0.002535731,0.004063716,0.00345826,0.01417483,0.007113797,0.005185411,0.007820235],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002110773,"about_ca_system_score_gemma":0.004281732,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00224562,"about_ca_topic_score_gemma":0.002158863,"domain_scores_codex":[0.9933777,0.00140855,0.001019304,0.001253084,0.002369787,0.0005714133],"domain_scores_gemma":[0.9870739,0.002532671,0.0008718912,0.004868329,0.003987736,0.0006653702],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001318654,0.0002164428,0.002708723,0.0008625375,0.0001486574,0.0003650963,0.00121997,0.009333163,0.01149874,0.5325353,0.07605083,0.3637419],"study_design_scores_gemma":[0.0003340499,0.0006106237,0.0007038558,0.0003164582,0.0001310019,0.0008730346,0.000294985,0.07372811,0.07745972,0.263563,0.5816572,0.0003279842],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003789935,0.00034692,0.9817674,0.0003954556,0.0003331395,0.0002311184,0.0007949543,0.007708493,0.00463275],"genre_scores_gemma":[0.05600201,0.0004868405,0.9258276,0.0007870688,0.0002833967,0.00112235,0.002866242,0.003071497,0.009553083],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007927516,"threshold_uncertainty_score":0.02704561,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1984067593","doi":"10.1145/2768577.2768578","title":"The SDEval benchmarking toolkit","year":2015,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Executable; Benchmarking; Computer science; Focus (optics); Field (mathematics); Task (project management); Symbolic computation; Programming language; Software engineering; Software; Code (set theory); Systems engineering; Engineering; Set (abstract data type); Mathematics","authors":[{"name":"Albert Heinle","is_ca":true},{"name":"Viktor Levandovskyy","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.114504119115066,"gpt":0.355765799854737,"spread":0.241261680739671,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007028366,0.001814658,0.001309505,0.003161683,0.0007579593,0.003523223,0.005240604,0.001358648,0.01454547],"category_scores_gemma":[0.01987383,0.00111742,0.001406226,0.002676676,0.001096402,0.004179526,0.005243197,0.003314498,0.007293443],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001231089,"about_ca_system_score_gemma":0.002665891,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003347312,"about_ca_topic_score_gemma":0.002951726,"domain_scores_codex":[0.9892959,0.00412292,0.001149174,0.001088454,0.003502498,0.0008411002],"domain_scores_gemma":[0.9920262,0.003109003,0.0003567627,0.002514373,0.001527982,0.0004656061],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.002111519,0.001138199,0.01043009,0.004584481,0.0006004711,0.00067477,0.001023845,0.1435034,0.01006298,0.189211,0.3064502,0.3302091],"study_design_scores_gemma":[0.00053976,0.0004425011,0.003260371,0.00084109,0.0001216544,0.000525226,0.0003762276,0.3736223,0.02416371,0.1010715,0.494753,0.0002826909],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"software","genre_scores_codex":[0.03339278,0.003658926,0.5448973,0.00121572,0.00119229,0.0007879773,0.01705554,0.3266084,0.07119118],"genre_scores_gemma":[0.3287816,0.002791378,0.4737297,0.001109645,0.0001947061,0.001869049,0.08491301,0.08540942,0.02120158],"genre_candidate":"software","genre_consensus":null,"teacher_disagreement_score":0.01454547,"threshold_uncertainty_score":0.04865944,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2293719789","doi":"10.1145/2733693.2733713","title":"A Relaxed Algorithm for Online Matrix Inversion","year":2015,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"University of Waterloo","funders":"","keywords":"Inversion (geology); Algorithm; Computer science; Matrix (chemical analysis); Geology; Chemistry","authors":[{"name":"Arne Storjohann","is_ca":true},{"name":"Shiyun Yang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1002151269805669,"gpt":0.3613357831181379,"spread":0.261120656137571,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002550916,0.001940939,0.001415148,0.00143436,0.001144807,0.002257345,0.003209815,0.001907341,0.03701497],"category_scores_gemma":[0.01415026,0.001115454,0.001988621,0.002042932,0.001382992,0.00413105,0.005007708,0.004827403,0.01531736],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008617399,"about_ca_system_score_gemma":0.002685646,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003906149,"about_ca_topic_score_gemma":0.004971636,"domain_scores_codex":[0.9966919,0.00106112,0.0001855625,0.0004935836,0.001174758,0.0003930565],"domain_scores_gemma":[0.9941828,0.002666995,0.0001982738,0.001701964,0.001017214,0.0002327446],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008191708,0.0004422984,0.0005930283,0.0004171431,0.0001375635,0.0003204239,0.0003305326,0.1352336,0.009232668,0.1581659,0.07186604,0.6224416],"study_design_scores_gemma":[0.0002076097,0.0001971201,0.0002567682,0.00006225071,0.00003757578,0.0002917841,0.0001227457,0.7458897,0.004412299,0.2243609,0.02409479,0.00006646985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002060648,0.0001088255,0.9888101,0.0002763597,0.0001454591,0.0001074907,0.000201276,0.001160443,0.007129433],"genre_scores_gemma":[0.05909581,0.0001930724,0.9223318,0.0004285154,0.0002861609,0.0004362158,0.001172873,0.0009130988,0.0151425],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03701497,"threshold_uncertainty_score":0.1238274,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2001572656","doi":"10.1145/1358183.1358185","title":"Irreducible polynomials and barker sequences","year":2007,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Division of Computing and Communication Foundations","keywords":"Mathematics; Irreducibility; Combinatorics; Sequence (biology); Conjecture; Prime (order theory); Modulo; Integer (computer science); Discrete mathematics; Polynomial; Degree (music); Pure mathematics","authors":[{"name":"Peter Borwein","is_ca":true},{"name":"Erich Kaltofen","is_ca":false},{"name":"Michael J. Mossinghoff","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03818206263597906,"gpt":0.3078230699002947,"spread":0.2696410072643157,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008445164,0.0003388474,0.0004199442,0.001391315,0.001600698,0.001158122,0.0003630809,0.0005253101,0.00475275],"category_scores_gemma":[0.004098,0.0002037846,0.0004546528,0.0009890675,0.003473765,0.003288774,0.00176927,0.002085097,0.0006086668],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008981468,"about_ca_system_score_gemma":0.0005034735,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007057048,"about_ca_topic_score_gemma":0.000581758,"domain_scores_codex":[0.9993037,0.0001232315,0.00003711856,0.0001537232,0.0002040291,0.0001781349],"domain_scores_gemma":[0.9982286,0.00082387,0.0003675607,0.0001906644,0.0001660795,0.0002231981],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005415552,0.00002020526,0.0005096648,0.00004315629,0.000003295333,0.0001290588,0.0005121464,0.0007553509,0.001124683,0.9846784,0.0009293115,0.01124061],"study_design_scores_gemma":[0.00001113927,0.00004000728,0.0005449671,0.00002597761,0.000005984544,0.0002734966,0.0001559394,0.001894139,0.00128662,0.9874072,0.008339571,0.00001492926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.754095,0.006223131,0.09251738,0.003878036,0.000509844,0.0000598962,0.0003397483,0.0003374129,0.1420395],"genre_scores_gemma":[0.9743174,0.001568984,0.01037645,0.0003302734,0.0004100562,0.00002295026,0.0002029076,0.00003194628,0.0127391],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00475275,"threshold_uncertainty_score":0.01589954,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2081252282","doi":"10.1145/1940475.1940483","title":"Cache complexity and multicore implementation for univariate real root isolation","year":2011,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Computer science; Isolation (microbiology); Multi-core processor; Univariate; Parallel computing; Cache; Root (linguistics); Theoretical computer science; CPU cache; Computer architecture; Multivariate statistics; Machine learning","authors":[{"name":"Changno Chen","is_ca":true},{"name":"Marc Moreno Maza","is_ca":true},{"name":"Yuzhen Xie","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1329468354367423,"gpt":0.3614692393330454,"spread":0.228522403896303,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007003025,0.0003605084,0.000344185,0.0005888824,0.0007030158,0.001325604,0.001389857,0.0004404171,0.003466079],"category_scores_gemma":[0.004116283,0.0002322263,0.0002904997,0.001339747,0.0004929589,0.00223736,0.0007224297,0.0008130845,0.0003247168],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001699104,"about_ca_system_score_gemma":0.001903579,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0038766,"about_ca_topic_score_gemma":0.01130723,"domain_scores_codex":[0.9989129,0.0001695176,0.00007084568,0.0001470041,0.0004384517,0.0002612915],"domain_scores_gemma":[0.9972476,0.001364687,0.000283555,0.000540816,0.000461795,0.000101435],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002147405,0.0008558545,0.02707012,0.0006811949,0.0002664539,0.0006631521,0.0008512124,0.3273349,0.1182548,0.1202733,0.01575634,0.3858452],"study_design_scores_gemma":[0.00004745106,0.0002233904,0.002227284,0.00002540589,0.00005729009,0.0001185721,0.0001314726,0.9464459,0.02992618,0.01819437,0.002575585,0.00002699357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8506206,0.001842477,0.1320797,0.0009103059,0.0001067528,0.0000541072,0.0002285529,0.001710793,0.01244678],"genre_scores_gemma":[0.9464196,0.0002655276,0.05031211,0.00009854588,0.00003649412,0.0000529825,0.0001978517,0.00009525623,0.002521694],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0038766,"threshold_uncertainty_score":0.01232791,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1997380739","doi":"10.1145/1504347.1504368","title":"On the representation of constructible sets","year":2009,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Representation (politics); Computer science; Mathematics; Political science","authors":[{"name":"Changbo Chen","is_ca":true},{"name":"Liyun Li","is_ca":true},{"name":"Marc Moreno Maza","is_ca":true},{"name":"Wei Pan","is_ca":true},{"name":"Yuzhen Xie","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04385094726416316,"gpt":0.3126611112219152,"spread":0.268810163957752,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001376929,0.0007598614,0.0008248829,0.002068394,0.001424746,0.003603408,0.001288388,0.0009533655,0.01529186],"category_scores_gemma":[0.003154053,0.0003958321,0.0008849836,0.002853828,0.003969,0.007707964,0.003209844,0.003228297,0.002292059],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00178153,"about_ca_system_score_gemma":0.0005069337,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001046773,"about_ca_topic_score_gemma":0.0009660563,"domain_scores_codex":[0.9991336,0.000306643,0.00005112622,0.000135976,0.0002453635,0.0001272563],"domain_scores_gemma":[0.9987713,0.0006463645,0.00008424559,0.0002844675,0.0001241835,0.00008946217],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001480711,0.000006207671,0.00002935236,0.00002604766,0.000002626606,0.00001544523,0.0001339194,0.000462513,0.0001305737,0.9909909,0.001131914,0.007055629],"study_design_scores_gemma":[0.000004688212,0.000007032393,0.00004032458,0.00002135188,0.00000350285,0.00002663191,0.00004155378,0.001373605,0.0001319586,0.9920884,0.006256831,0.000004254036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06589235,0.005355206,0.5665033,0.005049036,0.001072455,0.0001244096,0.001015405,0.0008540188,0.3541338],"genre_scores_gemma":[0.7683628,0.006005459,0.1421166,0.0009252587,0.001042932,0.0002683029,0.00186865,0.0004295718,0.07898045],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01529186,"threshold_uncertainty_score":0.0511564,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3045916595","doi":"10.1145/3457341.3457342","title":"Computing one billion roots using the tangent Graeffe method","year":2020,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Tangent; Degree (music); Factorization; Prime factor; Polynomial; Fast Fourier transform; Prime (order theory); Tangent vector; Combinatorics; Algorithm; Discrete mathematics; Geometry; Mathematical analysis","authors":[{"name":"Joris van der Hoeven","is_ca":true},{"name":"Michael Monagan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1204595982238576,"gpt":0.345415546345897,"spread":0.2249559481220393,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006653648,0.001025536,0.001020656,0.001546227,0.0006832865,0.00138507,0.001207307,0.0009240514,0.01979434],"category_scores_gemma":[0.005592202,0.0004522898,0.0009191337,0.001525406,0.0008820187,0.002898594,0.001282071,0.001157954,0.005608648],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008740086,"about_ca_system_score_gemma":0.001363246,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003586132,"about_ca_topic_score_gemma":0.005947978,"domain_scores_codex":[0.9993536,0.00008862896,0.00005102796,0.0001060737,0.0002719596,0.0001287026],"domain_scores_gemma":[0.9985527,0.0006682641,0.00007795714,0.0002820653,0.0003547892,0.00006414929],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008129511,0.0002493174,0.004249083,0.0005783971,0.0001317993,0.0007174131,0.0006725931,0.2006971,0.02733296,0.1574187,0.03463728,0.5725024],"study_design_scores_gemma":[0.0001882227,0.0001465655,0.0006350033,0.00005979786,0.00003215741,0.0002833664,0.0002183359,0.8495409,0.02107,0.1057255,0.02203721,0.00006291157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1047499,0.0004717348,0.8625443,0.0004682976,0.0002771512,0.0001111327,0.000757457,0.0107906,0.01982947],"genre_scores_gemma":[0.2805545,0.0002204545,0.7052737,0.0001441312,0.0000552052,0.000122575,0.00112231,0.001738358,0.01076867],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01979434,"threshold_uncertainty_score":0.06621867,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2042361512","doi":"10.1145/1940475.1940488","title":"Optimization techniques for small matrix multiplication","year":2011,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Strassen algorithm; Multiplication (music); Matrix multiplication; Mathematics; Multiplication algorithm; Base (topology); Matrix (chemical analysis); Code (set theory); Differential (mechanical device); Computer science; Arithmetic; Algebra over a field; Algorithm; Combinatorics; Pure mathematics","authors":[{"name":"Charles Éric Drevet","is_ca":false},{"name":"Md. Nazrul Islam","is_ca":true},{"name":"Éric Schost","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09747031034217751,"gpt":0.3175422735804849,"spread":0.2200719632383074,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001214728,0.001182622,0.0006638194,0.001193267,0.0005983835,0.001064081,0.001338022,0.0006073536,0.01986603],"category_scores_gemma":[0.007314457,0.0003211554,0.000690682,0.001744648,0.000646691,0.002277997,0.0009436196,0.001584584,0.003675983],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008591982,"about_ca_system_score_gemma":0.001655393,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001834784,"about_ca_topic_score_gemma":0.003527782,"domain_scores_codex":[0.9987943,0.0002731032,0.00006696767,0.000150178,0.0005044326,0.0002109653],"domain_scores_gemma":[0.9970869,0.001541181,0.0002500895,0.0005417674,0.0005028221,0.00007725962],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005094254,0.0003454608,0.00133916,0.0005288116,0.00006669225,0.0001167878,0.0001288341,0.3779896,0.01529604,0.08405189,0.02103666,0.4985906],"study_design_scores_gemma":[0.000123089,0.0002788268,0.0005713456,0.00005794667,0.0000504084,0.0001692713,0.00006340183,0.8819818,0.01980079,0.07707047,0.01979259,0.00004014963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0292018,0.0009524521,0.9450979,0.0004545256,0.0001561758,0.0001514783,0.000273046,0.003139732,0.02057273],"genre_scores_gemma":[0.2194609,0.000598978,0.7710738,0.0002045995,0.0001244179,0.0002828411,0.0004826729,0.001164782,0.006606996],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01986603,"threshold_uncertainty_score":0.06645846,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2066880569","doi":"10.1145/2576802.2576811","title":"Newton-like iteration for determinantal systems and structured low rank approximation","year":2014,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Statistical and numerical algorithms","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Rank (graph theory); Mathematics; Applied mathematics; Determinantal point process; Newton's method; Mathematical economics; Combinatorics; Physics; Nonlinear system; Eigenvalues and eigenvectors; Random matrix","authors":[{"name":"Éric Schost","is_ca":true},{"name":"Pierre-Jean Spaenlehauer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04577739578534687,"gpt":0.3257585690847457,"spread":0.2799811732993989,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007672466,0.0004181068,0.0006196151,0.0005554693,0.0003499518,0.0008398916,0.0006735088,0.0006140033,0.004854141],"category_scores_gemma":[0.004986139,0.0002370975,0.0004146346,0.000626298,0.0013774,0.001074682,0.001164114,0.001482163,0.001357171],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004906778,"about_ca_system_score_gemma":0.0007513625,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001455856,"about_ca_topic_score_gemma":0.002556024,"domain_scores_codex":[0.9995147,0.0002405523,0.00001397022,0.00004594012,0.0001465775,0.00003825573],"domain_scores_gemma":[0.9989125,0.0005730475,0.0001032039,0.0001692258,0.0001491461,0.00009297327],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001145624,0.00006270811,0.0004853986,0.0001916606,0.00003960832,0.0001018218,0.0001680895,0.1463303,0.002708027,0.7790573,0.01223677,0.05850377],"study_design_scores_gemma":[0.000009327104,0.00002429442,0.0000957116,0.00001358539,0.000003814956,0.00004398568,0.00001766941,0.6979051,0.0006583943,0.2976171,0.003600688,0.00001032225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01486887,0.0005934166,0.9698835,0.0004895452,0.0001668472,0.00003094924,0.00009578966,0.0002704729,0.01360056],"genre_scores_gemma":[0.5179979,0.001240138,0.4366172,0.0003503747,0.0003091989,0.0001404368,0.0005072408,0.0004709504,0.04236661],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004854141,"threshold_uncertainty_score":0.01623875,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2594425395","doi":"10.1145/3055282.3055299","title":"Fermat benchmarks for rational expressionals in maple","year":2017,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Cancer Treatment and Pharmacology","field":"Medicine","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Maple; Fermat's Last Theorem; Benchmark (surveying); Set (abstract data type); Undo; Factor (programming language); Computer science; Fermat number; Mathematics; Algebra over a field; Discrete mathematics; Programming language; Pure mathematics","authors":[{"name":"Michael Monagan","is_ca":true},{"name":"Roman Pearce","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1057838314287284,"gpt":0.4335389077643416,"spread":0.3277550763356132,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003949033,0.002283495,0.001370687,0.002465786,0.001622898,0.003987814,0.00378554,0.001359795,0.05397853],"category_scores_gemma":[0.0190448,0.0009386941,0.002047969,0.004191025,0.001272962,0.007584071,0.003155167,0.003076493,0.02128711],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002464365,"about_ca_system_score_gemma":0.002283254,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002385856,"about_ca_topic_score_gemma":0.004647372,"domain_scores_codex":[0.9943321,0.001248541,0.0004978477,0.0006644021,0.002440896,0.0008162445],"domain_scores_gemma":[0.9910657,0.004720628,0.0003615892,0.002037954,0.001562719,0.0002513562],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002368897,0.0005441851,0.003232754,0.001897938,0.0001397005,0.0005820153,0.0006003656,0.02683247,0.01593945,0.2324074,0.3326938,0.3827611],"study_design_scores_gemma":[0.0009282623,0.0005770474,0.002129423,0.0004016494,0.0001283622,0.0008140816,0.0004184658,0.3372965,0.1023005,0.2256218,0.329143,0.0002408977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06904588,0.002131226,0.5415829,0.001780225,0.0008303937,0.0004272134,0.009293788,0.219164,0.1557443],"genre_scores_gemma":[0.3314828,0.0009156859,0.5845236,0.0009765397,0.0003403331,0.0007299861,0.0204138,0.03397217,0.02664508],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.05397853,"threshold_uncertainty_score":0.1805762,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2594872624","doi":"10.1145/3055282.3055288","title":"Fibonacci-mandelbrot polynomials and matrices","year":2017,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Nonlinear Waves and Solitons","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Mandelbrot set; Fibonacci polynomials; Fibonacci number; Mathematics; Pure mathematics; Combinatorics; Eigenvalues and eigenvectors; Orthogonal polynomials; Classical orthogonal polynomials; Mathematical analysis; Fractal; Physics","authors":[{"name":"Eunice Y. S. Chan","is_ca":true},{"name":"Robert M. Corless","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03662771994516754,"gpt":0.3367330267204845,"spread":0.3001053067753169,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005558231,0.0004154029,0.0003002096,0.001334359,0.001069024,0.000991733,0.0006041512,0.0009045627,0.003671923],"category_scores_gemma":[0.002460908,0.0002375718,0.0004804893,0.001101532,0.001568328,0.001596091,0.0005138928,0.0007607123,0.0005831448],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007159396,"about_ca_system_score_gemma":0.0006382114,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002816922,"about_ca_topic_score_gemma":0.002807785,"domain_scores_codex":[0.9997043,0.00007748017,0.000008064191,0.00004326616,0.00008914409,0.00007765266],"domain_scores_gemma":[0.9996098,0.0001905451,0.00005841547,0.00003844778,0.00006327637,0.00003960587],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001941029,0.00001149465,0.0002779923,0.00002561379,0.000003372563,0.00009365447,0.0001077079,0.01785384,0.002255582,0.969795,0.0006059903,0.00895024],"study_design_scores_gemma":[0.00001866365,0.00004582379,0.0005413807,0.0000235065,0.000004160076,0.0002511019,0.0001035043,0.1890132,0.002902346,0.7987202,0.008342487,0.00003369856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2651776,0.002509972,0.6767021,0.001047983,0.0003006938,0.00009614343,0.0001829777,0.0003933056,0.05358921],"genre_scores_gemma":[0.7762722,0.001201205,0.2099932,0.0002099299,0.0001896176,0.00009120519,0.0001195725,0.00009730118,0.01182574],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003671923,"threshold_uncertainty_score":0.0122838,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2108508505","doi":"10.1145/2644288.2644297","title":"Some definite integrals containing the Tree T function","year":2014,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Sports Dynamics and Biomechanics","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Symbolic computation; Point (geometry); Mathematics; Function (biology); Order of integration (calculus); Algebra over a field; Pure mathematics; Mathematical analysis; Geometry","authors":[{"name":"Robert M. Corless","is_ca":true},{"name":"Junrui Hu","is_ca":true},{"name":"David J. Jeffrey","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02272716408871433,"gpt":0.2358043100325837,"spread":0.2130771459438693,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001240493,0.0006942711,0.0006110857,0.002197384,0.001680695,0.002631097,0.001007722,0.001823139,0.004757805],"category_scores_gemma":[0.004376278,0.0003157317,0.001006818,0.001291055,0.002190429,0.004028973,0.001030967,0.00188147,0.0009387728],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001036372,"about_ca_system_score_gemma":0.0006952066,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000742734,"about_ca_topic_score_gemma":0.0004842177,"domain_scores_codex":[0.9993197,0.0001592125,0.00003590082,0.0001112172,0.0002648846,0.0001091108],"domain_scores_gemma":[0.9990441,0.0002849694,0.0001519993,0.0001195269,0.000228247,0.0001711499],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002062496,0.00001116183,0.00009225667,0.0000198727,0.000004633467,0.0002211127,0.000139722,0.001356814,0.0009360643,0.9929569,0.0008693326,0.003371542],"study_design_scores_gemma":[0.00001251108,0.00003649982,0.0001780023,0.00001699964,0.000007678504,0.000398201,0.00008464809,0.02874167,0.001323214,0.9654071,0.003766817,0.00002667052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2441761,0.001147414,0.6370838,0.001398671,0.0006859339,0.00005473071,0.0002292197,0.0006454487,0.1145788],"genre_scores_gemma":[0.8979549,0.0008221787,0.06912072,0.0004716951,0.0005228997,0.0000778875,0.0002548133,0.0006003611,0.0301745],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004757805,"threshold_uncertainty_score":0.01591641,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2592304289","doi":"10.1145/3055282.3055284","title":"Proof of a series solution for euler's trinomial equation","year":2017,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Sports Dynamics and Biomechanics","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Transcendental function; Lambert W function; Euler's formula; Transcendental number; Series (stratigraphy); Trinomial; Mathematics; Transcendental equation; Applied mathematics; Mathematical analysis; Calculus (dental); Differential equation; Discrete mathematics","authors":[{"name":"Fei Wang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04891690804353627,"gpt":0.281187554966511,"spread":0.2322706469229748,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001092867,0.0009564889,0.0007511865,0.001464895,0.000883125,0.0008292063,0.0008424789,0.0009394804,0.01859056],"category_scores_gemma":[0.00518751,0.0003083096,0.001364591,0.0008613343,0.001581778,0.002336078,0.002595395,0.004474598,0.003245275],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000965033,"about_ca_system_score_gemma":0.0009701091,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001084984,"about_ca_topic_score_gemma":0.0008256957,"domain_scores_codex":[0.9995102,0.00009526165,0.00003710669,0.00007795699,0.0002141685,0.00006541882],"domain_scores_gemma":[0.9989975,0.0003873832,0.00005771181,0.00007804768,0.0003995334,0.00007975905],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001360542,0.00002108117,0.0001033088,0.0001076856,0.00001064594,0.0002596397,0.0002324285,0.0007935464,0.001724096,0.9738766,0.01008734,0.01277005],"study_design_scores_gemma":[0.00001655914,0.00003157964,0.0001913619,0.0000822677,0.00001298811,0.0003662158,0.00008708024,0.005558607,0.001446979,0.9496449,0.04254158,0.00001989635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04367984,0.00567323,0.5770859,0.01573303,0.008288198,0.0001998166,0.001022841,0.001024721,0.3472924],"genre_scores_gemma":[0.6016074,0.01044687,0.201262,0.007934533,0.005145945,0.000588639,0.001228674,0.001170068,0.1706159],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01859056,"threshold_uncertainty_score":0.06219167,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2343589186","doi":"10.1145/2850449.2850459","title":"Using sparse interpolation to solve multivariate diophantine equations","year":2015,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Multivariate statistics; Diophantine equation; Mathematics; Interpolation (computer graphics); Combinatorics; Prime (order theory); Ideal (ethics); Polynomial interpolation; Polynomial; Multivariate analysis; Discrete mathematics; Applied mathematics; Computer science; Statistics; Linear interpolation; Mathematical analysis; Artificial intelligence","authors":[{"name":"Michael Monagan","is_ca":true},{"name":"Baris Tuncer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1557968958554707,"gpt":0.3596140019620466,"spread":0.2038171061065759,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004047914,0.0004165263,0.0006248623,0.0004429283,0.0003039887,0.000414534,0.000544495,0.0003543181,0.002168298],"category_scores_gemma":[0.002119681,0.000247099,0.0004214152,0.0007220209,0.0006210228,0.0008005369,0.001154506,0.001311535,0.0002817728],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000423493,"about_ca_system_score_gemma":0.0005918294,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00180645,"about_ca_topic_score_gemma":0.003871833,"domain_scores_codex":[0.9998451,0.00003506266,0.000005426043,0.00001986313,0.00006654263,0.00002785763],"domain_scores_gemma":[0.9996889,0.0001761177,0.0000295709,0.00004575538,0.00003636287,0.00002334279],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001922493,0.0001207608,0.001951115,0.0001748662,0.00006232697,0.0002654471,0.0002897844,0.5327175,0.01058935,0.2822389,0.00377014,0.1676275],"study_design_scores_gemma":[0.00002590826,0.00003431338,0.0001422075,0.000007175266,0.000006690801,0.00003073837,0.00002595114,0.9359317,0.001890744,0.0597246,0.002171696,0.000008342614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06942017,0.0001813753,0.9238673,0.0002925467,0.00006682156,0.00003603694,0.00007337226,0.0003013609,0.005760999],"genre_scores_gemma":[0.5408255,0.0004124029,0.4497169,0.0001043247,0.0001478781,0.00008033124,0.0001992623,0.00013158,0.008381671],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002168298,"threshold_uncertainty_score":0.007253706,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2614861664","doi":"10.1145/3096730.3096731","title":"Some steps to improve software information","year":2017,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Scientific Computing and Data Management","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Mathematical software; Software; Metadata; Key (lock); Citation; Software engineering; Data science; World Wide Web; Programming language; Computer security","authors":[{"name":"Albert Heinle","is_ca":true},{"name":"Wolfram Koepf","is_ca":false},{"name":"Wolfram Sperber","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1379811044514334,"gpt":0.4059243614771584,"spread":0.267943257025725,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03129962,0.002609285,0.001642103,0.01076639,0.004460212,0.01128584,0.005889399,0.007322775,0.02499644],"category_scores_gemma":[0.06114054,0.00135587,0.003058501,0.007309515,0.004525956,0.04021141,0.008458447,0.01040911,0.01344265],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003716867,"about_ca_system_score_gemma":0.009398919,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007945177,"about_ca_topic_score_gemma":0.004910913,"domain_scores_codex":[0.979961,0.007326012,0.002484084,0.001650697,0.007119291,0.001458944],"domain_scores_gemma":[0.9231855,0.01851639,0.002000905,0.0201103,0.03318194,0.00300502],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001452118,0.000925765,0.003275935,0.00282431,0.0001344081,0.000466178,0.002236101,0.002689517,0.003929432,0.2380489,0.124459,0.6208652],"study_design_scores_gemma":[0.000102219,0.000437493,0.0030409,0.003520178,0.0002010554,0.0007713794,0.003326447,0.009025265,0.006472897,0.2780929,0.6947609,0.0002484071],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01373829,0.04717489,0.5555922,0.2933941,0.008468295,0.001445511,0.00100574,0.01032892,0.06885204],"genre_scores_gemma":[0.06578439,0.04376487,0.8343801,0.01663337,0.004263029,0.000892929,0.003539715,0.001743305,0.02899815],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03129962,"threshold_uncertainty_score":0.1655302,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2005397991","doi":"10.1145/1358183.1358188","title":"Symbolic computation techniques for solving large expression problems from mathematics and engineering","year":2007,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Real-time simulation and control systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Computation; Expression (computer science); Symbolic computation; Symbolic-numeric computation; Computer science; Theoretical computer science; Algebra over a field; Mathematics education; Mathematics; Algorithm; Programming language; Pure mathematics","authors":[{"name":"Wenqin Zhou","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01936791232623127,"gpt":0.2701982429427147,"spread":0.2508303306164834,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009625569,0.001125707,0.001194361,0.0009684007,0.0009381043,0.001189794,0.001578096,0.0007663285,0.01803569],"category_scores_gemma":[0.004693084,0.0003888299,0.0009506557,0.002271253,0.001588402,0.002109959,0.002056708,0.00343234,0.004464557],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007292791,"about_ca_system_score_gemma":0.0009564629,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009929806,"about_ca_topic_score_gemma":0.002066767,"domain_scores_codex":[0.9992061,0.0002498328,0.00004390139,0.00005883593,0.0003804293,0.00006087733],"domain_scores_gemma":[0.9986883,0.0009318375,0.00005317388,0.0001882797,0.0001065875,0.00003186646],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001153624,0.00006919986,0.0002352545,0.0006605047,0.00007568049,0.0001914109,0.0002829994,0.09574167,0.005824516,0.6293154,0.0124476,0.2550404],"study_design_scores_gemma":[0.00004829481,0.00003571242,0.00007383129,0.00007766899,0.00002673362,0.0001042294,0.00005645396,0.2607551,0.003062672,0.713515,0.02223032,0.00001395034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0020191,0.0008202191,0.9872174,0.0003410123,0.00008521941,0.00003625384,0.00007354,0.0006450152,0.008762297],"genre_scores_gemma":[0.1278407,0.003287629,0.851778,0.0001820251,0.0003186476,0.0003953464,0.0005980713,0.0008105545,0.01478906],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01803569,"threshold_uncertainty_score":0.06033534,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2090885898","doi":"10.1145/2733693.2733698","title":"A Truncated Fourier Transform middle product","year":2015,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University; University of Waterloo","funders":"","keywords":"Product (mathematics); Fast Fourier transform; Power–delay product; Mathematics; Fourier transform; Polynomial; Fourier series; Multiplication (music); Power (physics); Computer science; Algorithm; Combinatorics; Mathematical analysis; Physics; Power consumption; Geometry","authors":[{"name":"Andrew Arnold","is_ca":true},{"name":"Éric Schost","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1550108062520106,"gpt":0.3264301351854981,"spread":0.1714193289334875,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001006366,0.0009993608,0.0008682444,0.00100067,0.0008071536,0.002531609,0.001453956,0.001208901,0.01700174],"category_scores_gemma":[0.004251344,0.000371843,0.001013744,0.001129038,0.001333364,0.004003275,0.002013348,0.001806141,0.00710674],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007541479,"about_ca_system_score_gemma":0.001289479,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009473704,"about_ca_topic_score_gemma":0.0008720725,"domain_scores_codex":[0.9987569,0.000160771,0.00006631363,0.0002266461,0.0006689332,0.0001205036],"domain_scores_gemma":[0.9986902,0.0002927106,0.00007779874,0.0003720707,0.0004840252,0.00008324219],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006711642,0.00009843874,0.0005696815,0.0001775714,0.0000693371,0.0006053059,0.0002834783,0.03958143,0.06166326,0.422387,0.01212048,0.4617729],"study_design_scores_gemma":[0.00009407779,0.000405566,0.0003973565,0.0001031636,0.00007211502,0.001457517,0.0001237793,0.5802436,0.1009057,0.2407857,0.0752992,0.0001121891],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005652258,0.0001697498,0.9864885,0.0001120602,0.0001750182,0.00003080087,0.00005514658,0.000855541,0.006460948],"genre_scores_gemma":[0.1304763,0.0003741158,0.8490717,0.0002825697,0.0002480103,0.0001035227,0.0003424471,0.0006050984,0.01849629],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01700174,"threshold_uncertainty_score":0.05687654,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2615873886","doi":"10.1145/3096730.3096740","title":"Finding maximum rank moment matrices by facial reduction on primal form and Douglas-Rachford iteration","year":2017,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Western University","funders":"","keywords":"Reduction (mathematics); Semidefinite programming; Rank (graph theory); Mathematics; Matrix (chemical analysis); Moment (physics); Positive-definite matrix; Mathematical optimization; Dimension (graph theory); Algorithm; Computer science; Combinatorics; Eigenvalues and eigenvectors","authors":[{"name":"Fei Wang","is_ca":true},{"name":"Greg Reid","is_ca":true},{"name":"Henry Wolkowicz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0893228140613989,"gpt":0.3974851967803344,"spread":0.3081623827189355,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001211527,0.001070784,0.001123633,0.0006833806,0.0005309114,0.000848687,0.0008923656,0.0008569509,0.004411707],"category_scores_gemma":[0.003683216,0.0004438381,0.001086122,0.0003835875,0.001530709,0.0008807795,0.001850729,0.002237063,0.001453157],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006964666,"about_ca_system_score_gemma":0.001172545,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001369599,"about_ca_topic_score_gemma":0.001960793,"domain_scores_codex":[0.9993967,0.000198526,0.00002081292,0.00006495511,0.0002485367,0.00007042155],"domain_scores_gemma":[0.9991438,0.0004104321,0.00006764994,0.000164159,0.0001646314,0.00004930042],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002392332,0.0001917274,0.0008845378,0.000275679,0.00004692974,0.0002907574,0.0003766953,0.460609,0.01991801,0.2817017,0.008110515,0.2273553],"study_design_scores_gemma":[0.00002397666,0.00008323388,0.00009589174,0.00001553907,0.000007018149,0.00006164858,0.00003239658,0.9037815,0.005008793,0.08805261,0.002821736,0.00001561593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007810915,0.000037391,0.9897343,0.00008461592,0.00002079932,0.000051448,0.00003447641,0.0002260855,0.002000059],"genre_scores_gemma":[0.1663884,0.0001010763,0.8272465,0.0001183144,0.00004890067,0.0002225405,0.0002009797,0.0003135715,0.0053597],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004411707,"threshold_uncertainty_score":0.01475859,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2548940749","doi":"10.1145/3015306.3015311","title":"Computing limits with the regularchains and powerseries libraries","year":2016,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Symbolic computation; Computation; Rational function; Algebra over a field; Algebraic number; Maple; Computer science; Mathematics; Theoretical computer science; Pure mathematics; Algorithm","authors":[{"name":"Parisa Alvandi","is_ca":true},{"name":"Mahsa Kazemi","is_ca":true},{"name":"Marc Moreno Maza","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02583585462445199,"gpt":0.2535602183242677,"spread":0.2277243636998157,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003717802,0.0008475637,0.00125194,0.003008479,0.001623591,0.00596543,0.002479597,0.001068297,0.01357668],"category_scores_gemma":[0.02109566,0.001062062,0.001376715,0.003049064,0.003719798,0.02414815,0.006368747,0.002038425,0.007022803],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001031692,"about_ca_system_score_gemma":0.001614803,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001272357,"about_ca_topic_score_gemma":0.00190537,"domain_scores_codex":[0.9958119,0.0009531049,0.0004208877,0.0007955697,0.001668967,0.000349467],"domain_scores_gemma":[0.9928057,0.002357107,0.0004242861,0.003144188,0.0008034377,0.0004653099],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0004590632,0.0001737698,0.002775243,0.0003180963,0.0000703132,0.0003330363,0.0007526377,0.02705033,0.00453434,0.7483132,0.01040205,0.204818],"study_design_scores_gemma":[0.00003148017,0.00004351142,0.0001183506,0.00005425101,0.00001992354,0.0001157955,0.00008833884,0.07912383,0.007099688,0.8956738,0.01759399,0.00003682321],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"software","genre_scores_codex":[0.04091743,0.0004981781,0.924852,0.0005945168,0.000125513,0.0001087716,0.0006764976,0.01370824,0.01851893],"genre_scores_gemma":[0.5239838,0.0008571106,0.4526422,0.0003562994,0.0002807815,0.0003336032,0.00207348,0.0030073,0.01646543],"genre_candidate":"software","genre_consensus":null,"teacher_disagreement_score":0.01357668,"threshold_uncertainty_score":0.04541856,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2058898308","doi":"10.1145/1358190.1358195","title":"Fast algorithms, modular methods, parallel approaches and software engineering for solving polynomial systems symbolically","year":2007,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Computer science; Modular design; Theoretical computer science; Task (project management); Software; Decomposition; Symbolic computation; Polynomial; Symbolic execution; Symbolic-numeric computation; Algorithm; Parallel computing; Mathematics; Programming language; Computation","authors":[{"name":"Yuzhen Xie","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05350815632308686,"gpt":0.3047080198103695,"spread":0.2511998634872827,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001699251,0.001309388,0.0006907142,0.001075077,0.000652856,0.001325398,0.001127834,0.0007841779,0.003993643],"category_scores_gemma":[0.006083992,0.0004930482,0.001125692,0.00171679,0.001933953,0.003058855,0.001465229,0.002136576,0.001601567],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009129446,"about_ca_system_score_gemma":0.001487818,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008856395,"about_ca_topic_score_gemma":0.0009688133,"domain_scores_codex":[0.9985555,0.0004018218,0.00006006134,0.0001640582,0.0007075073,0.0001110167],"domain_scores_gemma":[0.9980947,0.001043006,0.0001589957,0.0003791367,0.0002818803,0.00004229258],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00007112505,0.00006678133,0.0004425346,0.0004794853,0.00007879509,0.00006481675,0.0002263188,0.1220106,0.007456063,0.5919344,0.005193788,0.2719753],"study_design_scores_gemma":[0.00009099599,0.0001028313,0.0002647401,0.0001091836,0.00004912959,0.0001213048,0.00005981811,0.4234444,0.01024312,0.5310277,0.03444747,0.00003933592],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004368246,0.001407738,0.9888177,0.0004067272,0.00008820394,0.00004007173,0.00002175035,0.0003861521,0.004463362],"genre_scores_gemma":[0.0926453,0.00512334,0.8961625,0.0002056707,0.0003550487,0.0002857128,0.0001224481,0.0003413469,0.004758632],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003993643,"threshold_uncertainty_score":0.01336002,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2995572343","doi":"10.1145/3377006.3377014","title":"Bit complexity for critical point computation in smooth and compact real hypersurfaces","year":2019,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Hypersurface; Jacobian matrix and determinant; Mathematics; Extension (predicate logic); Polynomial; Projection (relational algebra); Rank (graph theory); Algebraic number; Discrete mathematics; Algebra over a field; Pure mathematics; Algorithm; Computer science; Mathematical analysis; Applied mathematics; Combinatorics","authors":[{"name":"Jesse Elliott","is_ca":true},{"name":"Éric Schost","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06155402739645428,"gpt":0.337018664761806,"spread":0.2754646373653517,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002816876,0.0007104205,0.001283678,0.002643166,0.001086709,0.003328459,0.001734765,0.001006008,0.005089826],"category_scores_gemma":[0.02172813,0.0004670824,0.0009067221,0.0017013,0.004063959,0.008239667,0.003745139,0.002460658,0.0005112615],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002393486,"about_ca_system_score_gemma":0.001036972,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001305755,"about_ca_topic_score_gemma":0.001097674,"domain_scores_codex":[0.9978201,0.0005077659,0.0001403661,0.0003265921,0.000810272,0.0003948932],"domain_scores_gemma":[0.9824961,0.01250484,0.001186253,0.002130005,0.001063765,0.0006190583],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007891066,0.00007534093,0.005997201,0.000306849,0.00007383299,0.000172844,0.0004570968,0.1590081,0.007207782,0.7943396,0.002601421,0.02897087],"study_design_scores_gemma":[0.0000218138,0.00006108009,0.0009295797,0.0000212632,0.00001883998,0.0000567328,0.00004630935,0.4920014,0.002808899,0.5033761,0.0006273398,0.00003061649],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4182656,0.0006676275,0.5708858,0.001120527,0.00005577553,0.0001094627,0.0004919976,0.0006094832,0.007793849],"genre_scores_gemma":[0.9477969,0.0002959768,0.04896455,0.0001004278,0.00009942624,0.00015799,0.0004655441,0.0001783698,0.001940824],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005089826,"threshold_uncertainty_score":0.01736605,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2071215756","doi":"10.1145/2768577.2768654","title":"Unwinding paths on the Riemann sphere for continuous integrals of rational functions","year":2015,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Meromorphic and Entire Functions","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Riemann sphere; Mathematics; Riemann hypothesis; Pure mathematics; Mathematical analysis; Riemann surface","authors":[{"name":"Robert H. C. Moir","is_ca":true},{"name":"Robert M. Corless","is_ca":true},{"name":"David J. Jeffrey","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2228857899928305,"gpt":0.3555724606302907,"spread":0.1326866706374603,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001501976,0.0008492403,0.0008188261,0.002765989,0.001759473,0.003516909,0.0009685003,0.00139079,0.01582424],"category_scores_gemma":[0.008360743,0.0005681674,0.001191416,0.001672194,0.003149498,0.008003362,0.005031215,0.00428555,0.003005329],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001284657,"about_ca_system_score_gemma":0.0008043683,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007515369,"about_ca_topic_score_gemma":0.0006092431,"domain_scores_codex":[0.9987308,0.0002829743,0.00006836469,0.0002422687,0.0004107604,0.0002648417],"domain_scores_gemma":[0.9959648,0.002433599,0.00019938,0.0007019937,0.0004249544,0.0002753699],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004621195,0.00001881772,0.0001528984,0.00003668147,0.000005664325,0.000121546,0.0003126173,0.0008609823,0.0006781512,0.9846777,0.001353693,0.01173513],"study_design_scores_gemma":[0.000008352704,0.000009978151,0.00007264596,0.00001549304,0.000003724927,0.00006535939,0.00007426962,0.001894776,0.00068355,0.9930749,0.004089909,0.00000707289],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2883255,0.001492319,0.5559059,0.001952303,0.0008789392,0.0001290843,0.0004811599,0.001545176,0.1492895],"genre_scores_gemma":[0.8365016,0.001580844,0.1115687,0.0004537947,0.000348308,0.0001004497,0.0006110478,0.001235858,0.04759935],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01582424,"threshold_uncertainty_score":0.05293733,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2917622917","doi":"10.1145/3313880.3313889","title":"The SAT+CAS paradigm and the Williamson conjecture","year":2019,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Conjecture; Preprint; Construct (python library); Symbolic computation; Set (abstract data type); Order (exchange); Satisfiability; Computer science; Computation; Mathematics; Discrete mathematics; Algebra over a field; Combinatorics; Pure mathematics; Algorithm; Programming language","authors":[{"name":"Curtis Bright","is_ca":true},{"name":"Ilias Kotsireas","is_ca":true},{"name":"Vijay Ganesh","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009385561501334055,"gpt":0.2227611122381482,"spread":0.2133755507368141,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001587545,0.000635026,0.0007060764,0.001336164,0.00195061,0.003129311,0.001546147,0.001538081,0.009659884],"category_scores_gemma":[0.005007837,0.0004424006,0.0009334036,0.001619407,0.004674462,0.008679124,0.002252961,0.003828057,0.001352935],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001696565,"about_ca_system_score_gemma":0.001516062,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002079206,"about_ca_topic_score_gemma":0.003094465,"domain_scores_codex":[0.9982945,0.0005399971,0.00006900871,0.0004312271,0.0004202443,0.0002449962],"domain_scores_gemma":[0.9958301,0.002656521,0.0002904077,0.0007664544,0.0002880123,0.0001685261],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002707492,0.00001207042,0.0001521158,0.00002445518,0.000003198795,0.00002598654,0.00005303808,0.001430467,0.0002170699,0.9914559,0.001498337,0.005100273],"study_design_scores_gemma":[0.000007847335,0.00001112373,0.00006400957,0.00001121991,0.00000319594,0.00003934358,0.0000386434,0.01060672,0.0003423888,0.984721,0.004148655,0.000005771094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1587549,0.002181535,0.6139933,0.01535452,0.0008441018,0.0001476661,0.001011414,0.0007222953,0.2069903],"genre_scores_gemma":[0.8163086,0.001428051,0.150697,0.002707533,0.0009786966,0.0002832039,0.0008523056,0.0001827037,0.02656201],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009659884,"threshold_uncertainty_score":0.03231555,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2050816636","doi":"10.1145/2733693.2733723","title":"Basic Polynomial Algebra Subprograms","year":2015,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Multiplication (music); Computer science; Polynomial; Univariate; Prime (order theory); Division (mathematics); Integer (computer science); Algebra over a field; Isolation (microbiology); Variety (cybernetics); Arithmetic; Mathematics; Theoretical computer science; Programming language; Multivariate statistics; Pure mathematics; Combinatorics","authors":[{"name":"Changbo Chen","is_ca":false},{"name":"Svyatoslav Covanov","is_ca":true},{"name":"Farnam Mansouri","is_ca":true},{"name":"Marc Moreno Maza","is_ca":true},{"name":"Ning Xie","is_ca":true},{"name":"Yuzhen Xie","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0583955977594663,"gpt":0.3002814068623436,"spread":0.2418858091028773,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001502573,0.001052871,0.001120929,0.001763372,0.001409682,0.00289385,0.002524711,0.0009961752,0.09021201],"category_scores_gemma":[0.004288184,0.0008874189,0.00199108,0.002019724,0.001229709,0.003553546,0.002969526,0.003378476,0.05875722],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001307721,"about_ca_system_score_gemma":0.00221183,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001447615,"about_ca_topic_score_gemma":0.001443249,"domain_scores_codex":[0.9981395,0.000266899,0.0001483865,0.0003738449,0.0007940504,0.0002773297],"domain_scores_gemma":[0.9982011,0.0006038048,0.0001184985,0.0003548538,0.0005987087,0.0001230197],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0004947501,0.0003339433,0.001530861,0.001304388,0.00006460871,0.0002777219,0.0007216957,0.005323316,0.008560897,0.5397324,0.1706103,0.2710452],"study_design_scores_gemma":[0.0001287722,0.0000966825,0.0007017811,0.0001358045,0.0000449726,0.0006571843,0.0001069,0.02125564,0.01466247,0.4048525,0.5572916,0.00006562542],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"software","genre_scores_codex":[0.00843213,0.001031855,0.7865816,0.001061876,0.0003476534,0.0008214372,0.01422118,0.0540603,0.1334419],"genre_scores_gemma":[0.1484167,0.001981782,0.6698194,0.002003287,0.0008278203,0.002252093,0.04240684,0.0228862,0.1094059],"genre_candidate":"software","genre_consensus":null,"teacher_disagreement_score":0.09021201,"threshold_uncertainty_score":0.3017893,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2018206679","doi":"10.1145/2576802.2576817","title":"A parallel algorithm to compute the greatest common divisor of sparse multivariate polynomials","year":2014,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Multivariate statistics; Divisor (algebraic geometry); Mathematics; Greatest common divisor; Combinatorics; Algorithm; Statistics","authors":[{"name":"Jiaxiong Hu","is_ca":true},{"name":"Michael Monagan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03876171908900557,"gpt":0.2948750600822716,"spread":0.256113340993266,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000721648,0.001397593,0.001102234,0.001873156,0.001424256,0.001565094,0.001585106,0.0008117425,0.01605637],"category_scores_gemma":[0.002406439,0.000542612,0.0009857424,0.002444102,0.0007740197,0.002435084,0.002487445,0.001354228,0.004912489],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001088888,"about_ca_system_score_gemma":0.00263958,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004047605,"about_ca_topic_score_gemma":0.009743439,"domain_scores_codex":[0.9993523,0.0000885794,0.00005154595,0.0001800711,0.0002078925,0.0001195676],"domain_scores_gemma":[0.9990061,0.0003138972,0.00006127844,0.0003179245,0.0001984562,0.0001023378],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001181703,0.0004299926,0.001859615,0.0002935263,0.000137378,0.0002952628,0.0002180392,0.03938744,0.02733671,0.03261953,0.02804046,0.8682004],"study_design_scores_gemma":[0.001347009,0.0007185959,0.001938619,0.00006657754,0.0001840419,0.0008906464,0.0002467666,0.7857496,0.03883918,0.1399428,0.02997114,0.0001050323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05081044,0.0007693248,0.9273412,0.0007590086,0.0003573621,0.0003490998,0.0006433708,0.005500527,0.01346966],"genre_scores_gemma":[0.2243561,0.0003950361,0.7573152,0.0002153429,0.000295652,0.0004214275,0.00196364,0.0004523435,0.01458528],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01605637,"threshold_uncertainty_score":0.05371386,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2767728188","doi":"10.1145/3338637.3338642","title":"Computing the integer points of a polyhedron","year":2019,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Polyhedron; Integer (computer science); Integer programming; Omega; Computer science; Discrete mathematics; Combinatorics; Quantifier elimination; Constructive; Loop (graph theory); Mathematics; Algorithm; Theoretical computer science; Programming language","authors":[{"name":"Rui-Juan Jing","is_ca":false},{"name":"Marc Moreno Maza","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02432456423391149,"gpt":0.2834346234914631,"spread":0.2591100592575517,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000471632,0.000508901,0.0008001408,0.001482163,0.0009302385,0.002500147,0.0009386427,0.0007676336,0.008064413],"category_scores_gemma":[0.005903103,0.0004794955,0.0009111844,0.001393144,0.00182022,0.004957626,0.001707404,0.001441614,0.00158019],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005634935,"about_ca_system_score_gemma":0.000549558,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001648094,"about_ca_topic_score_gemma":0.0012356,"domain_scores_codex":[0.9988778,0.0001331798,0.0001095048,0.000257834,0.0004294051,0.0001922215],"domain_scores_gemma":[0.9970688,0.00142763,0.00029663,0.0005776716,0.0004816805,0.0001474871],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001132847,0.0002274713,0.01550121,0.0007229008,0.0001150601,0.0007379575,0.001162862,0.1415055,0.02500699,0.5141771,0.009871679,0.2898383],"study_design_scores_gemma":[0.00006678342,0.000269512,0.002413339,0.0001308449,0.00003846191,0.000329512,0.0006397509,0.3043645,0.02176544,0.6555709,0.01434193,0.00006905847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2870594,0.0002974316,0.6879304,0.0004226456,0.0001339467,0.0001307376,0.001739647,0.001951414,0.02033443],"genre_scores_gemma":[0.7145297,0.0002265471,0.2776482,0.0001015344,0.00006945796,0.0001166674,0.002316468,0.0003273806,0.004664055],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008064413,"threshold_uncertainty_score":0.02697819,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2102702231","doi":"10.1145/1838599.1838624","title":"transalpyne","year":2010,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Computer science; Scripting language; Feature (linguistics); Theoretical computer science; Programming language; Function (biology); Transposition (logic); Computer program; Algorithm; Artificial intelligence","authors":[{"name":"Luca De Feo","is_ca":false},{"name":"Éric Schost","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03813590271820459,"gpt":0.2919257759695366,"spread":0.253789873251332,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001186444,0.0007171828,0.0006257158,0.000479064,0.0005182519,0.002349871,0.00178945,0.0005768616,0.02324211],"category_scores_gemma":[0.002564715,0.0005439918,0.0008429451,0.0003399162,0.001227203,0.003721567,0.002865745,0.002355477,0.01103465],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004478061,"about_ca_system_score_gemma":0.001070775,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006964444,"about_ca_topic_score_gemma":0.0008702928,"domain_scores_codex":[0.9988798,0.0002397214,0.00009982397,0.0002930044,0.0003524096,0.000135201],"domain_scores_gemma":[0.9985062,0.0003728749,0.00007961923,0.0006256634,0.0003151736,0.0001003305],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0009008609,0.000263692,0.003187655,0.001488631,0.0001105723,0.001274178,0.001599111,0.01066292,0.04547243,0.5095278,0.08941976,0.3360924],"study_design_scores_gemma":[0.00007400083,0.0001814933,0.0006844373,0.0001771849,0.00004820762,0.001424894,0.0001580439,0.03543508,0.05576827,0.09480735,0.8111328,0.0001083741],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"software","genre_scores_codex":[0.009985232,0.0004011054,0.8856357,0.000330066,0.0005104852,0.0001772806,0.001970968,0.06792658,0.03306256],"genre_scores_gemma":[0.2301486,0.001050592,0.6364422,0.001990864,0.0003186776,0.000826413,0.00690418,0.02945764,0.09286088],"genre_candidate":"software","genre_consensus":null,"teacher_disagreement_score":0.02324211,"threshold_uncertainty_score":0.07775265,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2615855543","doi":"10.1145/3096730.3096732","title":"Fast parallel multi-point evaluation of sparse polynomials","year":2017,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Bivariate analysis; A priori and a posteriori; Mathematics; Combinatorics; Polynomial; Value (mathematics); Point (geometry); Discrete mathematics; Algorithm; Statistics; Mathematical analysis; Geometry","authors":[{"name":"Michael Monagan","is_ca":true},{"name":"Alan Wong","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0969491973978745,"gpt":0.36617443926151,"spread":0.2692252418636355,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001070465,0.0009443153,0.001246524,0.0006321197,0.0006826177,0.001075031,0.001012636,0.0006569708,0.007027637],"category_scores_gemma":[0.004326902,0.0003655416,0.0006081692,0.001380403,0.0008000302,0.002156847,0.001722334,0.001388293,0.001913988],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006772914,"about_ca_system_score_gemma":0.0006127289,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001743279,"about_ca_topic_score_gemma":0.003407214,"domain_scores_codex":[0.9993982,0.0001517434,0.00002295839,0.00007763845,0.0002616345,0.00008776965],"domain_scores_gemma":[0.9986734,0.0006481337,0.00006562263,0.0002602914,0.0002829505,0.00006958617],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002602172,0.0002104257,0.0025072,0.0006748103,0.0001687113,0.0007512704,0.0007048642,0.2675776,0.02570902,0.1393057,0.02299374,0.5367945],"study_design_scores_gemma":[0.0001040578,0.0001162226,0.0002387093,0.00001902154,0.0000193474,0.0001938431,0.00008224436,0.9361662,0.01367648,0.04392687,0.005437896,0.00001915847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04603149,0.0004493974,0.9445193,0.0003776825,0.0001349706,0.00007255137,0.0001490374,0.001472741,0.006792799],"genre_scores_gemma":[0.4565817,0.0003441086,0.5315736,0.0001409168,0.0001567248,0.000136264,0.0004092145,0.0004368318,0.01022057],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007027637,"threshold_uncertainty_score":0.02350974,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2915991097","doi":"10.1145/3313880.3313893","title":"Accelerating indefinite hypergeometric summation algorithms","year":2019,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Hypergeometric distribution; Mathematics; Hypergeometric function; Term (time); Rational function; Function (biology); Operator (biology); Basic hypergeometric series; Pure mathematics; Combinatorics; Discrete mathematics; Physics; Quantum mechanics","authors":[{"name":"Eugene V. Zima","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09651014964186747,"gpt":0.3328344550084913,"spread":0.2363243053666238,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001695032,0.000656948,0.00111251,0.001231584,0.0007103531,0.00178771,0.0025725,0.0009443329,0.008673796],"category_scores_gemma":[0.006060494,0.0003650716,0.0006855495,0.001588588,0.0009235026,0.00329366,0.002461901,0.001392919,0.002688505],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001107694,"about_ca_system_score_gemma":0.001356458,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00134048,"about_ca_topic_score_gemma":0.003219819,"domain_scores_codex":[0.9991678,0.0002053415,0.00005433085,0.0001079293,0.0003439472,0.0001206431],"domain_scores_gemma":[0.9982125,0.0008433762,0.0001323802,0.0003598985,0.0003404418,0.0001115168],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005032212,0.0002914656,0.002180486,0.0003657048,0.000112237,0.0002960894,0.0004011758,0.1633584,0.009900383,0.3034056,0.01251583,0.5066695],"study_design_scores_gemma":[0.00005691585,0.00005226206,0.000179905,0.00002074917,0.00001856469,0.00009307989,0.00003534559,0.8798076,0.003183019,0.1110945,0.005445439,0.00001258992],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03462575,0.0005695671,0.9519187,0.0003774432,0.0001471555,0.00009055591,0.0001660691,0.001687548,0.0104173],"genre_scores_gemma":[0.2387962,0.0003852142,0.7484146,0.0002414175,0.0001957482,0.0001841867,0.0005137959,0.0004507052,0.01081805],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008673796,"threshold_uncertainty_score":0.02901673,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4385628833","doi":"10.1145/3614408.3614417","title":"Drinfeld Modules in SageMath","year":2023,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Concordia University","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Programming language","authors":[{"name":"David Ayotte","is_ca":true},{"name":"Xavier Caruso","is_ca":false},{"name":"Antoine Leudière","is_ca":false},{"name":"Joseph Musleh","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03958561973493107,"gpt":0.2996038609761693,"spread":0.2600182412412382,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002109231,0.0007913366,0.0007456974,0.001344355,0.0009232202,0.002888555,0.002543448,0.0009147831,0.03268501],"category_scores_gemma":[0.005137169,0.0006695539,0.001165477,0.001374166,0.001348687,0.006275393,0.003694904,0.003071647,0.01894298],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000808918,"about_ca_system_score_gemma":0.001117266,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001064314,"about_ca_topic_score_gemma":0.001465619,"domain_scores_codex":[0.9973878,0.0004645718,0.0001977083,0.0004131066,0.001165988,0.0003707593],"domain_scores_gemma":[0.99824,0.0003854568,0.0000790472,0.0006779717,0.0004908343,0.0001267299],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0005388735,0.0002138702,0.001273762,0.0006074298,0.00009944268,0.0002875042,0.001437601,0.005732213,0.02400996,0.6242021,0.07444449,0.2671527],"study_design_scores_gemma":[0.000190323,0.0001396162,0.0005529261,0.0002318327,0.00006415129,0.0004853228,0.000151794,0.02122588,0.05297115,0.2895294,0.6342677,0.000189784],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"software","genre_scores_codex":[0.01183506,0.0005386873,0.8584303,0.0003764646,0.0003967664,0.0001278494,0.001561805,0.07729401,0.04943896],"genre_scores_gemma":[0.2055063,0.001103837,0.6736984,0.001241026,0.0004855552,0.0004488185,0.00764095,0.03582814,0.07404691],"genre_candidate":"software","genre_consensus":null,"teacher_disagreement_score":0.03268501,"threshold_uncertainty_score":0.1093423,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2067308523","doi":"10.1145/2016567.2016570","title":"Rounding coefficients and artificially underflowing terms in non-numeric expressions","year":2011,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Rounding; Irrational number; Monomial; Mathematics; Point (geometry); Invariant (physics); Rational number; Discrete mathematics; Applied mathematics; Computer science","authors":[{"name":"Robert M. Corless","is_ca":true},{"name":"Erik Postma","is_ca":false},{"name":"David R. Stoutemyer","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08829774085748635,"gpt":0.3313756011568825,"spread":0.2430778602993962,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004140206,0.0009072091,0.0008158743,0.0009049316,0.001038814,0.002850118,0.001600097,0.0006367526,0.004323764],"category_scores_gemma":[0.02492852,0.0005042432,0.0008253751,0.0009040905,0.004572831,0.004449368,0.003664556,0.002920812,0.001323616],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008446057,"about_ca_system_score_gemma":0.0007145951,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003829963,"about_ca_topic_score_gemma":0.0005065485,"domain_scores_codex":[0.9955584,0.001200342,0.0003205648,0.0005020077,0.002047423,0.000371186],"domain_scores_gemma":[0.9927771,0.002570667,0.0007036618,0.003191135,0.0006338584,0.0001235828],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003381596,0.00004382825,0.001163602,0.0002249484,0.00003295783,0.0004934399,0.00110924,0.02997094,0.01812519,0.8707217,0.002108984,0.07566697],"study_design_scores_gemma":[0.0000842913,0.0001849447,0.0006250598,0.0001951796,0.00009096946,0.0005308816,0.0005450348,0.1133094,0.06187701,0.7834951,0.03897212,0.0000899593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08502964,0.0003768393,0.8950648,0.001166029,0.0004636797,0.00006615061,0.00004812206,0.0009149183,0.01686978],"genre_scores_gemma":[0.5276054,0.0005971733,0.4607891,0.000576883,0.0003672537,0.0001198251,0.00009056644,0.001239098,0.008614687],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004323764,"threshold_uncertainty_score":0.02189583,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2782078086","doi":"10.1145/3177795.3177799","title":"<b>CUMODP</b>","year":2018,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"CUDA; Computer science; Modular design; Solver; Graphics; Floating point; Integer (computer science); Modular arithmetic; Polynomial; Parallel computing; Software; Double-precision floating-point format; Computational science; Mathematics; Computer graphics (images); Programming language","authors":[{"name":"Sardar Anisul Haque","is_ca":false},{"name":"X. Li","is_ca":false},{"name":"Farnam Mansouri","is_ca":false},{"name":"Marc Moreno Maza","is_ca":true},{"name":"Davood Mohajerani","is_ca":true},{"name":"Wei Pan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03904536777839753,"gpt":0.3033831524561591,"spread":0.2643377846777616,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008761725,0.001575454,0.0008786698,0.00207899,0.001258638,0.002964239,0.002530473,0.001059889,0.1937274],"category_scores_gemma":[0.003125267,0.0007934564,0.000883835,0.002260356,0.0007367693,0.002801461,0.002591885,0.002019227,0.1330717],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001264253,"about_ca_system_score_gemma":0.00161398,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004903679,"about_ca_topic_score_gemma":0.005825035,"domain_scores_codex":[0.998915,0.0001334716,0.0000690985,0.0001860525,0.0005266791,0.0001697451],"domain_scores_gemma":[0.9983892,0.0002167338,0.0001444574,0.0004116767,0.0006599512,0.000177902],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002577595,0.00005467235,0.0005614625,0.0003349107,0.00002833087,0.0001562598,0.00008513634,0.001733735,0.005901633,0.0390002,0.828831,0.1230549],"study_design_scores_gemma":[0.00007570072,0.00004458053,0.0006435893,0.0000803229,0.00001027202,0.000302548,0.00002181308,0.01840225,0.01972763,0.01324269,0.9473834,0.00006511797],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"software","genre_scores_codex":[0.004864326,0.0009150477,0.4402731,0.001413829,0.001371453,0.0002553409,0.02684349,0.3511892,0.1728743],"genre_scores_gemma":[0.0973927,0.001300688,0.4733328,0.003848828,0.001308983,0.0009343243,0.09107316,0.1476825,0.183126],"genre_candidate":"software","genre_consensus":null,"teacher_disagreement_score":0.1937274,"threshold_uncertainty_score":0.6480826,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2591955687","doi":"10.1145/3055282.3055287","title":"Efficient detection of hessian matrix sparsity pattern","year":2017,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Lethbridge","funders":"China Scholarship Council","keywords":"Hessian matrix; Scalar (mathematics); Matrix (chemical analysis); Algorithm; Computer science; Sparse matrix; Graph; Mathematics; Mathematical optimization; Applied mathematics; Theoretical computer science; Physics","authors":[{"name":"Richard G. Carter","is_ca":false},{"name":"Shahadat Hossain","is_ca":true},{"name":"Marzia Sultana","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09837801155960461,"gpt":0.4108543438131306,"spread":0.3124763322535259,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009469691,0.0006665104,0.0007872487,0.001265113,0.0003138483,0.0008760614,0.0008714662,0.0005706226,0.00295135],"category_scores_gemma":[0.00985174,0.0004516405,0.0003466754,0.0009333387,0.0005675894,0.001323861,0.001164022,0.0009442938,0.001216719],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003271686,"about_ca_system_score_gemma":0.0009910889,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001573538,"about_ca_topic_score_gemma":0.002608806,"domain_scores_codex":[0.9991935,0.0001937443,0.00003958689,0.0001125218,0.0003740182,0.00008665541],"domain_scores_gemma":[0.99497,0.001882799,0.0004313099,0.001102983,0.00138016,0.0002328581],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009082488,0.0002994784,0.01157043,0.0003824078,0.000114773,0.0005629607,0.0003197071,0.196468,0.1783887,0.05091134,0.01964063,0.5404333],"study_design_scores_gemma":[0.00002691041,0.0000650116,0.001878165,0.000007447545,0.000006691648,0.000138287,0.00003435339,0.9544221,0.02436991,0.01770449,0.001324693,0.00002191926],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04675588,0.00005979953,0.9494261,0.0001537706,0.00003023143,0.00006152056,0.0002876055,0.001644011,0.001581121],"genre_scores_gemma":[0.4642355,0.000105915,0.5311946,0.00009014301,0.00003216706,0.0001068969,0.001168139,0.0005550784,0.002511528],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00295135,"threshold_uncertainty_score":0.009873271,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3044525010","doi":"10.1145/3427218.3427220","title":"The Sage package comb_walks for walks in the quarter plane","year":2020,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"Agence Nationale de la Recherche","keywords":"Software package; Plane (geometry); Software; Quarter (Canadian coin); Computer science; Interface (matter); Computer graphics (images); Random walk; Operating system; Mathematics; Geometry; History","authors":[{"name":"Antonio Jiménez-Pastor","is_ca":false},{"name":"Alin Bostan","is_ca":false},{"name":"Frédéric Chyzak","is_ca":false},{"name":"Pierre Lairez","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08755887603188912,"gpt":0.3486088090365811,"spread":0.261049933004692,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005989498,0.001184985,0.000975712,0.002034611,0.0006594628,0.001659408,0.0015148,0.0006974632,0.06368209],"category_scores_gemma":[0.002898674,0.0006230135,0.001436705,0.001697742,0.0005729216,0.002473169,0.001906919,0.001558963,0.03054227],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003087013,"about_ca_system_score_gemma":0.0006231174,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007525213,"about_ca_topic_score_gemma":0.001633569,"domain_scores_codex":[0.9993498,0.0001150865,0.00005456404,0.0001241008,0.0002846404,0.00007183931],"domain_scores_gemma":[0.9990463,0.0003601204,0.00006185826,0.0002704325,0.0001916849,0.00006955309],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002624133,0.0001326892,0.002726847,0.0006867185,0.0001112826,0.0004512623,0.0004898724,0.006754481,0.0105016,0.3639535,0.2692127,0.3447167],"study_design_scores_gemma":[0.0001494478,0.0001000478,0.00210968,0.000135657,0.00006409006,0.00103091,0.00009542927,0.08092605,0.02075703,0.4044352,0.4900329,0.0001635042],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"software","genre_scores_codex":[0.004923293,0.0001924711,0.8854563,0.0001345306,0.000245805,0.00007958657,0.005481238,0.07958426,0.02390249],"genre_scores_gemma":[0.08458189,0.0007515409,0.7667828,0.0005389053,0.0004707822,0.0008713044,0.02107938,0.06745564,0.05746774],"genre_candidate":"software","genre_consensus":null,"teacher_disagreement_score":0.06368209,"threshold_uncertainty_score":0.2130378,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W7124934559","doi":"10.1145/3787957.3787958","title":"Integer Hulls, Z-Polyhedra and Presburger Arithmetic in Action","year":2025,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Presburger arithmetic; Undecidable problem; Integer (computer science); Decidability; Algebra over a field; Integer programming; Integer points in convex polyhedra; Action (physics)","authors":[{"name":"Rui-Juan Jing","is_ca":false},{"name":"Y. Skylar Lei","is_ca":true},{"name":"Christopher F. S. Maligec","is_ca":true},{"name":"Marc Moreno Maza","is_ca":true},{"name":"Chirantan Mukherjee","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03513085089192196,"gpt":0.3165719697226975,"spread":0.2814411188307755,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003869341,0.0004783137,0.0003484263,0.001128976,0.001320382,0.002205615,0.0004862966,0.0004904664,0.008991634],"category_scores_gemma":[0.0009420728,0.0001975812,0.0004225165,0.001019774,0.003745542,0.003838585,0.001472642,0.001775448,0.001518753],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001045069,"about_ca_system_score_gemma":0.0005644718,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001639584,"about_ca_topic_score_gemma":0.001513366,"domain_scores_codex":[0.9996873,0.00005375767,0.00001559019,0.00006541744,0.0001085268,0.00006940828],"domain_scores_gemma":[0.9997602,0.0000845021,0.00005683128,0.00002789636,0.00003175893,0.00003883145],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001296098,0.00000481604,0.00004634326,0.00001252105,8.187419e-7,0.00002025773,0.00006503638,0.0006009329,0.0001804125,0.9934682,0.0007418798,0.00484583],"study_design_scores_gemma":[0.000005179196,0.000008039119,0.00007944252,0.000006745302,0.000001163496,0.0000256972,0.00004656647,0.001555704,0.0001950332,0.9922735,0.005798896,0.000004042207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.223106,0.005025102,0.2921296,0.004890997,0.000820616,0.000111634,0.0007799853,0.0006829115,0.4724531],"genre_scores_gemma":[0.9021693,0.002908606,0.05055537,0.0006207734,0.0007638097,0.00008775384,0.0006279022,0.0001374532,0.04212892],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008991634,"threshold_uncertainty_score":0.03008002,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2947382456","doi":"10.1145/3338637.3338639","title":"Computing isomorphisms and embeddings of finite fields","year":2019,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Finite field; Embedding; Automorphism; Prime (order theory); Prime power; Field (mathematics); Mathematics; Combinatorics; Discrete mathematics; Physics; Pure mathematics; Computer science","authors":[{"name":"Ludovic Brieulle","is_ca":false},{"name":"Luca De Feo","is_ca":false},{"name":"Javad Doliskani","is_ca":true},{"name":"Jean Pierre Flori","is_ca":false},{"name":"Éric Schost","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02111057609427823,"gpt":0.2708240089321153,"spread":0.2497134328378371,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002569272,0.0009608627,0.0009881788,0.002465443,0.001182498,0.00460705,0.002049814,0.001207407,0.00404375],"category_scores_gemma":[0.01521143,0.0009907396,0.00145285,0.003088543,0.003992864,0.01553516,0.004939466,0.002346922,0.001048677],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00197111,"about_ca_system_score_gemma":0.001085163,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001579965,"about_ca_topic_score_gemma":0.001827631,"domain_scores_codex":[0.9963522,0.0009370637,0.0003926663,0.0009356483,0.0008348071,0.0005475376],"domain_scores_gemma":[0.9904018,0.005637179,0.00072464,0.002033166,0.0006802449,0.0005229495],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007853908,0.0003635691,0.01064246,0.0005190938,0.0001399724,0.000518829,0.003047109,0.04132411,0.008801734,0.7070339,0.006031833,0.220792],"study_design_scores_gemma":[0.00004623779,0.0001027034,0.0007218522,0.00006105507,0.00003526957,0.0001453757,0.0005711953,0.04798116,0.005487594,0.9392153,0.005597954,0.00003436782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4265189,0.0012311,0.5556735,0.001130829,0.0001915185,0.0001190521,0.0008908555,0.004143248,0.01010102],"genre_scores_gemma":[0.7366509,0.0005157221,0.2539853,0.000171323,0.0001918695,0.0001115666,0.002212979,0.000499005,0.005661409],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00460705,"threshold_uncertainty_score":0.01430148,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2049626594","doi":"10.1145/2016567.2016590","title":"Inverting matrices modulo regular chains","year":2011,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Modulo; Mathematics; Arithmetic; Computer science; Algebra over a field; Combinatorics; Pure mathematics","authors":[{"name":"Marc Moreno Maza","is_ca":true},{"name":"Paul Vrbik","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06077053493012863,"gpt":0.2744791578736379,"spread":0.2137086229435093,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004481729,0.0006805135,0.0005023465,0.0007823771,0.0007588081,0.001341937,0.000415926,0.0004107348,0.01964523],"category_scores_gemma":[0.001886606,0.0002857295,0.0004605142,0.0007096505,0.001117384,0.002458745,0.001716997,0.00139528,0.003561154],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003782232,"about_ca_system_score_gemma":0.0005670232,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004801121,"about_ca_topic_score_gemma":0.0009120035,"domain_scores_codex":[0.9995067,0.00007918685,0.00002526208,0.0001110622,0.0001435974,0.0001341592],"domain_scores_gemma":[0.9991547,0.0002953584,0.0001007725,0.0002039333,0.0001275373,0.0001176625],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002183266,0.0001130488,0.0005184735,0.0001768618,0.00002273053,0.0003381718,0.0004070914,0.004168298,0.0129841,0.8906708,0.008681523,0.08170061],"study_design_scores_gemma":[0.00003718497,0.0001220727,0.0001701198,0.00004510887,0.00001395037,0.0002596079,0.0001173477,0.01498709,0.01195881,0.9561653,0.01610455,0.00001894664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3195038,0.001103983,0.4277851,0.001414741,0.001187058,0.0002395809,0.0006548382,0.002183458,0.2459275],"genre_scores_gemma":[0.8675815,0.001185984,0.07408727,0.0004000404,0.0008326172,0.0001029283,0.0007192553,0.0004313053,0.05465908],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01964523,"threshold_uncertainty_score":0.0657199,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2055516972","doi":"10.1145/1823931.1823957","title":"Numerical and symbolic computation of the Lambert W function in C <sup>nxn</sup>","year":2010,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Sports Dynamics and Biomechanics","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Lambert W function; Symbolic computation; Mathematics; Maple; Scalar (mathematics); Function (biology); Applied mathematics; Computation; Newton's method; Iterative method; Matrix (chemical analysis); Algebra over a field; Algorithm; Pure mathematics; Mathematical analysis; Geometry; Nonlinear system","authors":[{"name":"Hui Ding","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00989188187118672,"gpt":0.2289620646689676,"spread":0.2190701827977809,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001348627,0.0007630752,0.0005451005,0.0009193281,0.0007070872,0.001977692,0.001059412,0.0007841543,0.007752947],"category_scores_gemma":[0.00699283,0.0002571559,0.0005659701,0.001057476,0.001654519,0.00214741,0.001058663,0.001485222,0.002536749],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00120327,"about_ca_system_score_gemma":0.001239004,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001718307,"about_ca_topic_score_gemma":0.00213861,"domain_scores_codex":[0.9991975,0.000163772,0.00005028278,0.00006215124,0.0004608905,0.00006540846],"domain_scores_gemma":[0.9978002,0.001125588,0.0001531571,0.0004358517,0.000429527,0.00005561511],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001041699,0.00004028238,0.0005722151,0.0002216072,0.00002898524,0.0002641077,0.0002708884,0.2173611,0.01210317,0.5920987,0.006949441,0.1699854],"study_design_scores_gemma":[0.000009959324,0.00002553064,0.0001263871,0.00003160973,0.000007770515,0.0001242557,0.00003554957,0.8967438,0.01063851,0.0814261,0.01081362,0.00001688325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01122183,0.0002758936,0.9675122,0.0002186041,0.00008842292,0.00005810508,0.00005232423,0.0005973743,0.01997513],"genre_scores_gemma":[0.195253,0.0006203715,0.7861795,0.000165654,0.0001019386,0.000242925,0.0002260545,0.0006067796,0.01660392],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007752947,"threshold_uncertainty_score":0.02593625,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2022316771","doi":"10.1145/2768577.2768649","title":"RUBI and integration as term re-writing","year":2015,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Digital Humanities and Scholarship","field":"Arts and Humanities","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Term (time); Computer science; Physics; Astronomy","authors":[{"name":"David J. Jeffrey","is_ca":true},{"name":"Albert D. Rich","is_ca":true},{"name":"Junrui Hu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1489722158904297,"gpt":0.3115211670203644,"spread":0.1625489511299346,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005180895,0.0007227437,0.001105802,0.002677335,0.002330899,0.005642778,0.002376952,0.001129008,0.05526791],"category_scores_gemma":[0.02040049,0.0006513778,0.001245061,0.00294961,0.003771135,0.01277533,0.006073678,0.003478631,0.01835274],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001823626,"about_ca_system_score_gemma":0.001907571,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001814395,"about_ca_topic_score_gemma":0.001878283,"domain_scores_codex":[0.994853,0.00212915,0.000416981,0.0008159181,0.001350852,0.0004342326],"domain_scores_gemma":[0.9889877,0.003148139,0.0009580204,0.00440522,0.001889629,0.0006112313],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002889176,0.000073168,0.0006501465,0.0003255999,0.00003492017,0.0001863613,0.00277929,0.0008310225,0.00265515,0.744921,0.02285219,0.2244021],"study_design_scores_gemma":[0.00007312166,0.0001294827,0.001002532,0.000281414,0.0000812785,0.0006180556,0.001422334,0.01034353,0.00816904,0.7165638,0.2612312,0.00008422475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.02746337,0.006226955,0.4427017,0.00724718,0.001969763,0.0003313879,0.0006866627,0.00916398,0.5042089],"genre_scores_gemma":[0.5367996,0.002185578,0.2491898,0.0008038397,0.0009965952,0.0002760032,0.001574086,0.004951191,0.2032233],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.05526791,"threshold_uncertainty_score":0.1848896,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2513122423","doi":"10.1145/3055282.3055291","title":"Black box linear algebra","year":2017,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Preconditioner; Matrix (chemical analysis); Computation; Algebra over a field; Linear algebra; Discrete mathematics; Algorithm; Applied mathematics; Pure mathematics; Iterative method","authors":[{"name":"Wayne Eberly","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05084046304715154,"gpt":0.3176488864587084,"spread":0.2668084234115569,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00141359,0.0008184937,0.001035192,0.0007905106,0.001047386,0.001948561,0.0008786739,0.000808389,0.02900848],"category_scores_gemma":[0.002767381,0.0004534984,0.0008815494,0.001289177,0.00185574,0.003241051,0.001938958,0.003202521,0.01069258],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001026497,"about_ca_system_score_gemma":0.000953992,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008219887,"about_ca_topic_score_gemma":0.00102221,"domain_scores_codex":[0.9989688,0.0003203227,0.00004169658,0.0002269287,0.0003625188,0.00007973713],"domain_scores_gemma":[0.999169,0.0002890733,0.0000420674,0.0002755115,0.0001855214,0.00003881478],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003851667,0.00001743098,0.000110977,0.00009220241,0.00001790792,0.00003209199,0.00009515573,0.004378551,0.0008661582,0.9399837,0.0127738,0.04159355],"study_design_scores_gemma":[0.00001928785,0.00001899851,0.00005458294,0.00003440068,0.000004777868,0.00003225942,0.00001595899,0.03044748,0.0007428201,0.9272282,0.04139219,0.000009084083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00631467,0.003037776,0.8845527,0.002888837,0.001312847,0.0001097714,0.0005907849,0.0009033719,0.1002892],"genre_scores_gemma":[0.2615372,0.005156953,0.5756717,0.002616266,0.001879642,0.0006917971,0.001168236,0.0008630352,0.1504152],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02900848,"threshold_uncertainty_score":0.09704304,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}