{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001803272,0.00009342116,0.0001503124,0.0001225808,0.00003686608,0.00001767651,0.0007283455,0.00006050714,0.00001364492],"category_scores_gemma":[0.00001235877,0.00009802757,0.00004073993,0.0002630298,0.00003850971,0.00009639206,0.0003290016,0.0001139478,0.000008790425],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000288621,"about_ca_system_score_gemma":0.000007074201,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000287689,"about_ca_topic_score_gemma":0.0001260901,"domain_scores_codex":[0.9994113,0.00003898826,0.0002758417,0.00008862611,0.00007222908,0.0001129414],"domain_scores_gemma":[0.9981503,0.0000661004,0.00003963771,0.001679748,0.00004084424,0.00002332463],"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.00004687363,0.0004173662,0.01183114,0.0002331207,0.0002720181,0.000001695054,0.001233119,0.05574936,0.008429201,0.5214848,0.002184017,0.3981173],"study_design_scores_gemma":[0.0003021264,0.00004367085,0.0157497,0.00003760592,0.00001372915,0.000005734501,0.000008194209,0.9524387,0.0002221977,0.02331548,0.00770145,0.0001614501],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6775653,0.0004603636,0.3190271,0.0006831029,0.0007591243,0.0002016528,0.000005998513,0.000320784,0.0009765942],"genre_scores_gemma":[0.9083269,0.0002973113,0.09117939,0.00006224135,0.00003531502,0.00001347701,0.00005196043,0.00001725572,0.00001609256],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8966893,"threshold_uncertainty_score":0.3997448,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0007562502,0.0002321018,0.0003126879,0.0005453118,0.0003629005,0.0005521502,0.006904447,0.0001431069,0.000003208254],"category_scores_gemma":[0.0003241944,0.0002420454,0.0001309341,0.001144159,0.0001232886,0.0006733901,0.00280681,0.0005418111,0.00004824878],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006945017,"about_ca_system_score_gemma":0.0001738022,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001531992,"about_ca_topic_score_gemma":0.000128921,"domain_scores_codex":[0.9981059,0.0001213853,0.0006042965,0.0005055843,0.0002040768,0.000458768],"domain_scores_gemma":[0.9925674,0.00218469,0.0002099297,0.004765857,0.0001425005,0.0001296587],"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.00001797464,0.0006856802,0.002880693,0.00006654415,0.0000780174,0.000006942785,0.001839495,0.0007898987,0.003522447,0.3811631,0.01028354,0.5986657],"study_design_scores_gemma":[0.001090512,0.0001069536,0.008274079,0.00004804594,0.00001019675,0.00004597124,0.00001694251,0.9503776,0.0003334761,0.01906489,0.02015391,0.0004774179],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1129197,0.0003658192,0.8790401,0.003668397,0.002392525,0.001007504,0.000009432734,0.0003663574,0.0002301251],"genre_scores_gemma":[0.6580859,0.00002101773,0.3410997,0.0002514675,0.0002396058,0.000241825,0.00002160951,0.00001539622,0.00002341345],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9495877,"threshold_uncertainty_score":0.9984687,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000253661,0.0001123924,0.0001066521,0.00007625059,0.0001044367,0.00005027256,0.001341324,0.00006200929,0.00001906231],"category_scores_gemma":[0.00001362254,0.00007068676,0.00005038856,0.0001909197,0.00004455048,0.0001254032,0.0005698569,0.0001473308,0.00005226023],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007504583,"about_ca_system_score_gemma":0.00001045236,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001580892,"about_ca_topic_score_gemma":0.0003180762,"domain_scores_codex":[0.9993286,0.00004657632,0.0002468569,0.0001171014,0.00009127366,0.0001696532],"domain_scores_gemma":[0.9973622,0.0002288726,0.00003236018,0.002317591,0.00003168453,0.00002727171],"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.00001583668,0.0001136833,0.002611634,0.00001797411,0.0001335219,0.000002958876,0.0009521162,0.00181003,0.00765425,0.1003148,0.009882721,0.8764905],"study_design_scores_gemma":[0.001158051,0.00003717362,0.009159071,0.0001551276,0.00003676521,0.00001820129,0.00003900098,0.7383578,0.0003848977,0.05628794,0.1937997,0.0005662231],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2545711,0.001409147,0.7268628,0.01203342,0.002241961,0.0004503127,0.00001623407,0.0007935498,0.001621454],"genre_scores_gemma":[0.9715827,0.0008986203,0.0267879,0.0004531674,0.0001113234,0.00004161461,0.00002059131,0.00002701035,0.00007704668],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8759243,"threshold_uncertainty_score":0.2882523,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0005252691,0.0001360684,0.0002090571,0.0002666443,0.0001428255,0.0001014457,0.007820747,0.00007939273,0.0000182312],"category_scores_gemma":[0.00005975749,0.0001357365,0.00007106588,0.0007779302,0.0001290708,0.000572219,0.003663177,0.000454322,0.00003822313],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001612699,"about_ca_system_score_gemma":0.00005870887,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007919317,"about_ca_topic_score_gemma":0.00003785033,"domain_scores_codex":[0.9988474,0.0001012103,0.0004011149,0.0002558884,0.0001701711,0.0002242305],"domain_scores_gemma":[0.9938816,0.0006690602,0.0001500329,0.005146632,0.00008802774,0.00006462382],"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.000005488831,0.0006099149,0.01285187,0.00007467378,0.00005138924,0.000006672182,0.004983429,0.0002091985,0.008963144,0.4488233,0.0003970332,0.5230239],"study_design_scores_gemma":[0.001053588,0.0001357937,0.02750166,0.0001545328,0.00001485492,0.00004391642,0.00006605031,0.8220381,0.01555263,0.1185904,0.01411893,0.0007295077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2657336,0.0002380999,0.7286594,0.002074233,0.0009554673,0.0002518421,0.000003779478,0.0001964986,0.001887049],"genre_scores_gemma":[0.5594596,0.00005710239,0.4403208,0.00008388697,0.00004270854,0.0000112143,0.000002597136,0.000005817377,0.00001628938],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.821829,"threshold_uncertainty_score":0.9975474,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000381026,0.0001402728,0.00027827,0.0003096971,0.0001137637,0.00003494561,0.001507129,0.00007742423,0.0000222513],"category_scores_gemma":[0.0002755947,0.0001520953,0.00005768615,0.0007196546,0.0002534578,0.0001918549,0.001024104,0.0002567586,0.0000206038],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008020463,"about_ca_system_score_gemma":0.00005747007,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001011066,"about_ca_topic_score_gemma":0.00008705429,"domain_scores_codex":[0.9984266,0.0002446259,0.0006502787,0.0002027571,0.0002575032,0.0002182745],"domain_scores_gemma":[0.9958081,0.001627494,0.0002127381,0.002010654,0.0003049747,0.00003603693],"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.00003004912,0.002899793,0.01541401,0.0003060714,0.0001154904,0.000007668309,0.002287762,0.0547112,0.0007996784,0.8203958,0.006809381,0.0962231],"study_design_scores_gemma":[0.0007480331,0.00003866671,0.005861507,0.000102231,0.000009749474,0.000008149006,0.00004850684,0.4106643,0.000537354,0.5814433,0.000343412,0.0001948063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05567006,0.0005424004,0.9389855,0.00177775,0.00008519521,0.0005900602,0.00001247284,0.0001838757,0.002152671],"genre_scores_gemma":[0.4314937,0.00006882894,0.5682381,0.00003718727,0.0000273513,0.00003021826,0.00004539828,0.00001857381,0.00004068777],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3758236,"threshold_uncertainty_score":0.6202267,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.001121912,0.0001892044,0.0002593139,0.0002362643,0.0004291681,0.0001732214,0.006012977,0.00006650644,0.000001804954],"category_scores_gemma":[0.00002743767,0.0001218957,0.00006935661,0.001345568,0.0003812243,0.000835815,0.004629662,0.0004639223,0.000008793212],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007025171,"about_ca_system_score_gemma":0.0001815588,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006373295,"about_ca_topic_score_gemma":0.0002178534,"domain_scores_codex":[0.9975963,0.0008285192,0.0005515283,0.0002508062,0.0002627216,0.0005101131],"domain_scores_gemma":[0.9942057,0.001807323,0.0002578065,0.003609336,0.00004844544,0.00007140415],"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.00003882256,0.001038196,0.04492293,0.0000602802,0.0001232119,0.000005004995,0.03676382,0.01783403,0.0001164939,0.754491,0.008751751,0.1358545],"study_design_scores_gemma":[0.0008849404,0.0001028303,0.2060186,0.0001993256,0.00001471475,0.00005637389,0.0005652637,0.7834948,0.00005184648,0.003243449,0.004998822,0.0003689984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3890051,0.00307477,0.5654485,0.03882701,0.0008170061,0.001218616,0.00001111681,0.000305393,0.001292489],"genre_scores_gemma":[0.9410139,0.00007447995,0.05831349,0.0003073201,0.0001924164,0.00004345162,0.0000150453,0.00001577195,0.00002410931],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7656608,"threshold_uncertainty_score":0.999365,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000486331,0.0001880431,0.0002244516,0.0004166768,0.0001505468,0.000112071,0.003264102,0.00009563468,0.000006857436],"category_scores_gemma":[0.00007165804,0.0002010457,0.00004416029,0.0007073201,0.0001295474,0.000732326,0.003721261,0.0003079268,0.00004476246],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008095764,"about_ca_system_score_gemma":0.00005496277,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005431832,"about_ca_topic_score_gemma":0.0004684098,"domain_scores_codex":[0.998314,0.0002435401,0.0005138185,0.0004784096,0.0001514502,0.0002988349],"domain_scores_gemma":[0.9964474,0.00041377,0.0001361223,0.002855876,0.00005486419,0.00009195395],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.00001756862,0.0006858376,0.04703259,0.00001593353,0.00001533355,0.000008547297,0.00901979,0.0001177838,0.000277699,0.04856262,0.0005914329,0.8936549],"study_design_scores_gemma":[0.001107038,0.00008423087,0.5748917,0.00007365669,0.000003422185,0.00001596789,0.00002355482,0.3836091,0.0002351381,0.038418,0.001196731,0.000341467],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5819325,0.0005522775,0.4121989,0.003274665,0.0003772336,0.0005353783,0.000003028856,0.000247716,0.0008782194],"genre_scores_gemma":[0.7164981,0.00009514835,0.2830367,0.0002681717,0.00002795228,0.00004325408,0.00001130165,0.000008971934,0.00001040558],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8933134,"threshold_uncertainty_score":0.8198404,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002245515,0.0001672511,0.0001855701,0.0002643203,0.0001851233,0.0003368203,0.006917593,0.00006559588,0.00003678206],"category_scores_gemma":[0.00005229381,0.0001687131,0.00006945802,0.0007989742,0.00009902514,0.001062046,0.004257863,0.0002786222,0.0007949892],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006891531,"about_ca_system_score_gemma":0.00007097958,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000349391,"about_ca_topic_score_gemma":0.0000455385,"domain_scores_codex":[0.9985408,0.0001860408,0.0004139719,0.0003523458,0.0001785265,0.0003283699],"domain_scores_gemma":[0.994716,0.0005362803,0.0000990391,0.004450294,0.00009514367,0.0001031778],"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":[5.458693e-7,0.0001451356,0.001274024,0.000003744551,0.000011298,0.000001634512,0.0006351054,0.00003050629,0.00007558783,0.12068,0.003374676,0.8737677],"study_design_scores_gemma":[0.000574148,0.00006926517,0.09676222,0.00004508025,0.000003219938,0.00003006071,0.00001512399,0.6022574,0.0001622343,0.2919765,0.007679683,0.0004250919],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03938866,0.001350271,0.9261451,0.02916915,0.0005333974,0.0004345183,0.000001106184,0.0005348274,0.002442933],"genre_scores_gemma":[0.5865023,0.00003995543,0.4119569,0.001307969,0.00005803926,0.00007246914,0.000007619157,0.000007888557,0.00004695494],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8733426,"threshold_uncertainty_score":0.999983,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007014144,0.0001265187,0.0001676072,0.00005760626,0.002268063,0.0004522047,0.006961481,0.00006100231,0.000005476348],"category_scores_gemma":[0.0005077226,0.00009396317,0.00008300206,0.0001426725,0.0002969706,0.0001674331,0.002429405,0.0003004397,0.00004793569],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004361219,"about_ca_system_score_gemma":0.00006456263,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001772217,"about_ca_topic_score_gemma":0.0005464175,"domain_scores_codex":[0.998942,0.0001298956,0.0003724434,0.0001877733,0.0001400074,0.0002279175],"domain_scores_gemma":[0.9870963,0.001955406,0.0002643416,0.01057627,0.00007428424,0.00003340868],"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.0000101303,0.0002904827,0.00321094,0.00002249088,0.00005964455,0.000001387703,0.001152252,0.000004913782,0.00002382815,0.8356407,0.03048353,0.1290997],"study_design_scores_gemma":[0.001008642,0.0000243016,0.01077797,0.00006535788,0.0000330641,0.00001390279,0.0001150756,0.01475763,0.00005850309,0.804326,0.1685402,0.0002793632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.536755,0.005489159,0.1105637,0.2051117,0.001701218,0.009698719,0.00008460673,0.001365615,0.1292304],"genre_scores_gemma":[0.7219577,0.00115353,0.2756793,0.0001513309,0.0001532489,0.0004568083,0.0000105538,0.00002976495,0.0004077101],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2049603,"threshold_uncertainty_score":0.9990308,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0003028451,0.0001541738,0.0001456723,0.0001412834,0.0005195509,0.0005484061,0.009359648,0.00005493132,0.000003365464],"category_scores_gemma":[0.00004690069,0.0001230736,0.00007547715,0.0008558491,0.0001088498,0.001015369,0.002809479,0.0003219657,0.00007927219],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003417462,"about_ca_system_score_gemma":0.00009316283,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001102255,"about_ca_topic_score_gemma":0.00001304618,"domain_scores_codex":[0.9985654,0.0002396202,0.0003980611,0.0002992664,0.0001800756,0.000317534],"domain_scores_gemma":[0.9940704,0.000973938,0.0001028165,0.004741763,0.00003481575,0.00007628617],"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.000002028376,0.00007859241,0.0001684568,7.492275e-7,0.000005325083,0.000001983579,0.0003129506,0.000132579,0.00001395484,0.362253,0.00386552,0.6331648],"study_design_scores_gemma":[0.0003232591,0.00008055076,0.03563286,0.0000274717,0.000002343109,0.00001780764,0.000007297915,0.3975285,0.0000855409,0.5278791,0.03818583,0.0002293714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0237098,0.002975518,0.7685791,0.1952626,0.0008339593,0.0005344703,0.000002186657,0.001072111,0.007030306],"genre_scores_gemma":[0.7153145,0.0003796483,0.280938,0.003120571,0.0001093494,0.00002038857,0.00001007323,0.000008027042,0.00009948337],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6916047,"threshold_uncertainty_score":0.9960002,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.001509092,0.0001211255,0.0002309839,0.00010767,0.000162057,0.0001206647,0.006292272,0.00004418877,2.867768e-7],"category_scores_gemma":[0.001207121,0.00009504698,0.00002610627,0.0004140981,0.0002514636,0.0004021302,0.006408913,0.0001311299,9.638701e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001691578,"about_ca_system_score_gemma":0.0001685617,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000397861,"about_ca_topic_score_gemma":0.0000133653,"domain_scores_codex":[0.9984422,0.0002943062,0.0005288441,0.0003351739,0.0001998334,0.0001996933],"domain_scores_gemma":[0.9906673,0.00332216,0.0002584533,0.005492452,0.0002031044,0.0000564583],"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.00003911919,0.000214479,0.0007422422,0.0001131753,0.0000908102,0.000001171931,0.00534865,0.0007665619,0.0004127648,0.5232978,0.00336035,0.4656129],"study_design_scores_gemma":[0.0004278136,0.00006706201,0.001627622,0.00004689906,0.000009628058,0.00001424922,0.00006236741,0.5864033,0.0007589905,0.4100505,0.0004179995,0.00011355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01261492,0.002210477,0.980067,0.004315658,0.0001953139,0.0004888134,0.000007803431,0.00004788029,0.00005211752],"genre_scores_gemma":[0.4541409,0.00004353655,0.5457087,0.00003657131,0.00003490327,0.00001254224,0.0000118635,0.000005642368,0.000005385424],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5856368,"threshold_uncertainty_score":0.9990842,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.002911709,0.0001594834,0.0001576056,0.0001434883,0.0004664883,0.0004602503,0.01219438,0.00007845067,0.000001924911],"category_scores_gemma":[0.0005332512,0.0001340782,0.00005863285,0.0009381298,0.0002337241,0.000819654,0.006117589,0.0004395798,0.0001012396],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001839442,"about_ca_system_score_gemma":0.000165156,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004809508,"about_ca_topic_score_gemma":0.00005835616,"domain_scores_codex":[0.9976721,0.0007941445,0.0005031042,0.0003292695,0.0003550858,0.0003462715],"domain_scores_gemma":[0.9900909,0.001196783,0.0001692665,0.008224669,0.0002113462,0.0001070497],"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.000003789974,0.0000732648,0.001205274,0.000002660395,0.00001254903,0.000001406548,0.001658764,0.0002968569,0.00000809855,0.5270539,0.002651076,0.4670324],"study_design_scores_gemma":[0.0003808603,0.00008501956,0.01049676,0.00003484849,0.000004482355,0.00003460432,0.00005664806,0.797322,0.0000759211,0.102701,0.08853679,0.0002710864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004963717,0.0009426719,0.9809031,0.008093212,0.001243941,0.0003001147,8.476297e-7,0.0002477279,0.003304614],"genre_scores_gemma":[0.1298205,0.0001794742,0.8692609,0.0004961517,0.0001180399,0.0000731274,0.000007080515,0.00001104888,0.00003366864],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7970251,"threshold_uncertainty_score":0.9931501,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006857,0.0001346559,0.0001809189,0.0002829463,0.0001585998,0.0001664803,0.005218492,0.00008490729,0.000003353725],"category_scores_gemma":[0.0001545623,0.0001390345,0.00006293621,0.0008043023,0.0000852977,0.000587433,0.003474871,0.0002537337,0.00004805448],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001214085,"about_ca_system_score_gemma":0.0001777616,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004393329,"about_ca_topic_score_gemma":0.00004314153,"domain_scores_codex":[0.9985667,0.0002406988,0.0003765239,0.0003146768,0.0002286919,0.0002727298],"domain_scores_gemma":[0.9953257,0.0005012988,0.00009810997,0.003596929,0.0003181358,0.0001597757],"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.000006192104,0.0006912574,0.0003231448,0.00001298694,0.00002684718,0.000003081793,0.002185475,0.003357554,0.00001178319,0.0726679,0.02198156,0.8987322],"study_design_scores_gemma":[0.00109189,0.0001072682,0.000141403,0.00002732943,0.000002600076,0.000006522135,0.00002814202,0.9360948,0.00001111606,0.0273939,0.03493951,0.0001554749],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005166189,0.0003094732,0.9853619,0.01264299,0.0002571955,0.000486269,0.0000104932,0.0002321753,0.0001828733],"genre_scores_gemma":[0.005655785,0.0001649143,0.9927431,0.0009956997,0.00005541865,0.00007327468,0.0001295441,0.0000141602,0.0001681516],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9327373,"threshold_uncertainty_score":0.9697344,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001598452,0.0001368775,0.0001647926,0.0003502819,0.000256157,0.0002018374,0.004246227,0.00006557348,0.000008162772],"category_scores_gemma":[0.00005908862,0.0001393924,0.00005155926,0.0008480942,0.0002517345,0.0005034807,0.002910232,0.0002354855,0.00001885638],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002739267,"about_ca_system_score_gemma":0.00003926979,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005159549,"about_ca_topic_score_gemma":0.0000825243,"domain_scores_codex":[0.9987069,0.0001928928,0.0003427613,0.0003395994,0.0001276471,0.000290238],"domain_scores_gemma":[0.9949818,0.0011411,0.00008016435,0.003658579,0.00004873943,0.0000896577],"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.000006789359,0.00014742,0.01018503,0.000007444215,0.00002397305,0.000006531154,0.001919491,0.00001382539,0.0003459973,0.6067245,0.0005590008,0.38006],"study_design_scores_gemma":[0.001032525,0.0002135215,0.1760745,0.0001766469,0.0000168528,0.0001555628,0.0001665556,0.02987715,0.001340182,0.7609499,0.02908758,0.0009091166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2257479,0.002309665,0.7603509,0.006417675,0.0004403831,0.0002612878,0.000001811103,0.000328057,0.004142287],"genre_scores_gemma":[0.6578835,0.0001467855,0.3413469,0.0005617522,0.00003485957,0.000008484163,0.000002130647,0.000005122069,0.00001053255],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4321356,"threshold_uncertainty_score":0.7890616,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005569773,0.000158922,0.0001865532,0.0002257181,0.0003164324,0.0001178949,0.002317311,0.00007563535,0.000004852661],"category_scores_gemma":[0.00003617738,0.0001743932,0.00004446907,0.0003733904,0.000116071,0.0004957825,0.001722246,0.0001589006,0.000003081183],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006747012,"about_ca_system_score_gemma":0.00005146201,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006226527,"about_ca_topic_score_gemma":0.0005028688,"domain_scores_codex":[0.9986272,0.0002397158,0.0004381468,0.0003561662,0.0001037225,0.000235076],"domain_scores_gemma":[0.9970384,0.0003743641,0.0001860162,0.002179047,0.0001601694,0.00006201975],"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.00002095621,0.0003484895,0.03297621,0.00003108216,0.00004958093,0.000001277628,0.01103208,0.0003593549,0.0000815745,0.7584965,0.0009038562,0.1956991],"study_design_scores_gemma":[0.0006798606,0.0001072604,0.1023214,0.00002209021,0.000008062805,0.000006117397,0.00003660823,0.7972436,0.0001478721,0.09889022,0.0003178346,0.0002190736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0193829,0.00007350778,0.9780314,0.001059407,0.00009557295,0.0005327002,0.000005860599,0.0003796235,0.0004390068],"genre_scores_gemma":[0.4441233,0.00007057793,0.5555797,0.0001061531,0.00001514937,0.00004985606,0.00004352407,0.000007728471,0.00000406312],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7968842,"threshold_uncertainty_score":0.7111547,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003225207,0.0001177364,0.0001726536,0.0001905758,0.0001615397,0.00008758845,0.004079391,0.00004322642,0.000007522476],"category_scores_gemma":[0.000144147,0.00009492956,0.00006797934,0.0009642883,0.000127427,0.0003095242,0.0008884551,0.0002241822,0.00002482184],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003662209,"about_ca_system_score_gemma":0.00005713725,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003553362,"about_ca_topic_score_gemma":0.00001134386,"domain_scores_codex":[0.9986967,0.0002825831,0.0003969001,0.0002491381,0.0002058626,0.0001688435],"domain_scores_gemma":[0.9945406,0.001548397,0.0001741543,0.003619629,0.00008171368,0.00003555862],"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.000003774421,0.0001294105,0.0002861263,0.000001644278,0.000008503849,9.13112e-7,0.0006502279,0.0005128534,0.0001421877,0.7047634,0.001156452,0.2923445],"study_design_scores_gemma":[0.0004068717,0.0001515057,0.03156026,0.00006288859,0.000003886084,0.00001605241,0.00002137943,0.2392741,0.001304609,0.726779,0.0002592475,0.0001601625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4463695,0.0002274049,0.4925247,0.05555523,0.0004403648,0.0005853532,0.000003552841,0.0002352627,0.004058622],"genre_scores_gemma":[0.8601201,0.00003421605,0.1384631,0.001334323,0.00002030576,0.00001074002,0.000006576071,0.00000353652,0.000007150813],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4137505,"threshold_uncertainty_score":0.7580591,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.001188139,0.0002038508,0.0002604841,0.000180883,0.000593761,0.0002918365,0.008556175,0.00006947754,0.000006518686],"category_scores_gemma":[0.0001063327,0.0001756962,0.0001429019,0.002013169,0.0001471458,0.000331141,0.006724794,0.0005337555,0.00002032747],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005095229,"about_ca_system_score_gemma":0.00005314915,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004712486,"about_ca_topic_score_gemma":0.00001687058,"domain_scores_codex":[0.997343,0.001146679,0.000466558,0.0004526747,0.0002632746,0.0003277978],"domain_scores_gemma":[0.9937558,0.00154663,0.0001780762,0.004315593,0.00009414485,0.0001097453],"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.00001426918,0.0004158428,0.003069046,0.0000345443,0.0001316098,0.000007809682,0.01022663,0.008975952,0.001753871,0.4821902,0.0005308893,0.4926494],"study_design_scores_gemma":[0.0003156878,0.00007427163,0.003370246,0.00007516528,0.00001796534,0.00001688122,0.00005073734,0.9434999,0.000273816,0.04887101,0.003168422,0.0002659542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01678703,0.0006794272,0.9615331,0.02007533,0.0002002355,0.0003015072,0.000001429658,0.0002746063,0.0001473247],"genre_scores_gemma":[0.4644806,0.0000384649,0.5329562,0.002420549,0.00008235843,0.000007695953,0.000003409319,0.00001008384,5.95346e-7],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9345239,"threshold_uncertainty_score":0.996808,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0005013503,0.000172906,0.0001885945,0.0003484777,0.0002763083,0.0001201531,0.006410785,0.0001032935,0.000007550302],"category_scores_gemma":[0.00007964293,0.0001922995,0.00009728306,0.0007353417,0.0001248396,0.0004891786,0.002436346,0.0002071512,0.00001072849],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006116078,"about_ca_system_score_gemma":0.00004693387,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008085838,"about_ca_topic_score_gemma":0.00005969324,"domain_scores_codex":[0.9986209,0.0001444118,0.0004553782,0.0004087243,0.0001086927,0.0002619158],"domain_scores_gemma":[0.9943017,0.0004966391,0.0001613321,0.004777926,0.0002039113,0.00005845147],"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.00001014268,0.0006272572,0.001016422,0.00002722313,0.00002881232,9.931582e-7,0.00219785,0.0007198919,0.00004904194,0.5029321,0.0004456577,0.4919446],"study_design_scores_gemma":[0.0003152556,0.00008910932,0.001841817,0.00004236269,0.000006246066,0.00000956966,0.00001182857,0.8760479,0.0006088906,0.1177622,0.003003705,0.0002610893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003919488,0.0001820131,0.9960304,0.001389048,0.0001621093,0.0007195675,0.000005351934,0.000525123,0.0005944661],"genre_scores_gemma":[0.05091149,0.0001740834,0.9480566,0.0003056274,0.00005006913,0.0004229573,0.00004470801,0.00001651639,0.00001800297],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.875328,"threshold_uncertainty_score":0.998965,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003186696,0.0001490336,0.0002666202,0.00009494753,0.0001824071,0.0001319876,0.0006476393,0.00008604536,0.000003611093],"category_scores_gemma":[0.0003754822,0.0001342997,0.00003960143,0.0001596575,0.0001075651,0.000174319,0.0003845468,0.0001450289,0.000004836078],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003481301,"about_ca_system_score_gemma":0.0000114597,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000251802,"about_ca_topic_score_gemma":0.00002520673,"domain_scores_codex":[0.9988847,0.0001621912,0.0004266405,0.0002251556,0.0001220609,0.0001792997],"domain_scores_gemma":[0.996079,0.00242649,0.0001280893,0.001222271,0.00009352938,0.00005063492],"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.00004414836,0.0003250027,0.0006546024,0.0005100738,0.00004407109,8.243423e-7,0.00114853,0.00006580386,0.0002798515,0.6416271,0.002482287,0.3528177],"study_design_scores_gemma":[0.0006605601,0.00006959464,0.001690487,0.00007214331,0.00001726037,0.00001406097,0.00001437976,0.719034,0.00003113855,0.2766432,0.001598582,0.0001546301],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04397791,0.0001159677,0.9540698,0.0007223434,0.0002730289,0.0006819961,0.00002062867,0.00008300547,0.00005532298],"genre_scores_gemma":[0.4649012,0.00001806005,0.5345681,0.0001399744,0.0001063914,0.0001470676,0.00008068379,0.0000168407,0.00002164965],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7189682,"threshold_uncertainty_score":0.5476584,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001997319,0.00009458236,0.0001982847,0.0001234865,0.000249118,0.0000400159,0.001022507,0.00006583118,0.0001969396],"category_scores_gemma":[0.00008433444,0.00009087307,0.00005906816,0.00005467319,0.000111744,0.000147153,0.0007317266,0.00017133,0.00001113028],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001000635,"about_ca_system_score_gemma":0.0001060097,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008480562,"about_ca_topic_score_gemma":0.0003741399,"domain_scores_codex":[0.999288,0.00005841524,0.0002538914,0.0001634733,0.00008472559,0.000151512],"domain_scores_gemma":[0.997201,0.0004937564,0.00009440929,0.002104589,0.00006043964,0.00004580705],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.0006838972,0.004242563,0.6466699,0.0001525519,0.0002593076,0.00003304588,0.003111528,0.0001527547,0.002955736,0.03382973,0.1774313,0.1304777],"study_design_scores_gemma":[0.009720353,0.0002296294,0.8364772,0.0003273694,0.00005728655,0.00003326174,0.00003476857,0.02460426,0.000716532,0.03316564,0.09435808,0.0002756245],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8441743,0.002302589,0.003045282,0.1384645,0.0008923956,0.002529542,0.00008305352,0.00006858972,0.008439822],"genre_scores_gemma":[0.9217191,0.0002289673,0.07578137,0.001072261,0.0001372761,0.000396755,0.0004602018,0.000009618911,0.00019449],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1898074,"threshold_uncertainty_score":0.3705696,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001572171,0.0001042824,0.0001603272,0.00005764894,0.0005602317,0.0002788292,0.001864779,0.00003041536,0.00004648738],"category_scores_gemma":[0.00001230139,0.0001029203,0.00004480984,0.00004227803,0.0001479249,0.000218431,0.002137843,0.0001733487,0.00002651307],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009420191,"about_ca_system_score_gemma":0.00002612164,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000635071,"about_ca_topic_score_gemma":0.00005883243,"domain_scores_codex":[0.9993548,0.00005783904,0.0002102628,0.0001624774,0.00005575083,0.0001588447],"domain_scores_gemma":[0.9963555,0.0002250059,0.0001251555,0.003214754,0.0000277282,0.00005188257],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.000007837791,0.0003314681,0.3976674,0.00001425281,0.00009904974,0.00000162021,0.0007725469,0.00002088781,0.00006209189,0.1382657,0.002146774,0.4606104],"study_design_scores_gemma":[0.002029911,0.00007349379,0.7084957,0.0001670271,0.00004985383,0.000006136236,0.0002077667,0.03678124,0.0001997418,0.1842885,0.06695221,0.0007484102],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9724782,0.0008076178,0.005590711,0.008426238,0.000248311,0.0003515581,0.00005578004,0.0000500422,0.01199162],"genre_scores_gemma":[0.9364625,0.0001020349,0.06295852,0.00007915349,0.0002334233,0.00001680949,0.00002826954,0.00001063271,0.0001086877],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.459862,"threshold_uncertainty_score":0.4308906,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004339277,0.0001220313,0.0001362339,0.0001219226,0.0001251958,0.00007050636,0.001382211,0.000067352,0.000005990364],"category_scores_gemma":[0.00003065799,0.00009798825,0.00005266184,0.000277013,0.00005042679,0.0001242016,0.0004972669,0.0003094958,0.00003140769],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005231201,"about_ca_system_score_gemma":0.000008404791,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002718317,"about_ca_topic_score_gemma":0.0002366091,"domain_scores_codex":[0.9992871,0.00006781834,0.0002756006,0.0001146164,0.00008344996,0.0001713845],"domain_scores_gemma":[0.9973217,0.0004046769,0.00004073577,0.002172048,0.0000323624,0.00002844206],"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.000008933738,0.00006240598,0.001855367,0.00001402578,0.00006542083,7.072705e-7,0.000607828,0.004860427,0.000214111,0.5216634,0.0008537241,0.4697936],"study_design_scores_gemma":[0.0002158638,0.0000380024,0.00846655,0.00003522218,0.00001200873,0.000004492359,0.00004109464,0.9060079,0.00001527989,0.07210752,0.01290628,0.0001497515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5233597,0.002898163,0.4629523,0.004531934,0.002138719,0.0005462691,0.000009632597,0.001003111,0.00256021],"genre_scores_gemma":[0.9769773,0.0004154079,0.02183438,0.0005392448,0.0001177181,0.0000366505,0.00004895074,0.00002285491,0.000007459977],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9011475,"threshold_uncertainty_score":0.3995845,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002120567,0.00007902488,0.000131323,0.00009120547,0.0001586146,0.00005022262,0.001251699,0.00006463937,0.000002162301],"category_scores_gemma":[0.00004959184,0.00008705335,0.00004768301,0.00006000277,0.00006045482,0.000217377,0.0004375596,0.00008235838,0.000001003679],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004888384,"about_ca_system_score_gemma":0.00001854506,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002579284,"about_ca_topic_score_gemma":0.000220735,"domain_scores_codex":[0.9994675,0.00001231476,0.0002637346,0.00008761611,0.00005682223,0.0001120179],"domain_scores_gemma":[0.9976293,0.00008766384,0.0001024112,0.002098145,0.00006532948,0.0000171532],"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.00008194964,0.0003842742,0.003566173,0.0002822573,0.0001528839,0.000001063879,0.001315952,0.009980433,0.005202984,0.1303357,0.0009853374,0.847711],"study_design_scores_gemma":[0.0003952227,0.00003846252,0.007864275,0.00004255849,0.000009181214,0.000001876065,0.000005918778,0.9750602,0.0009124177,0.01422434,0.001334673,0.0001108513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1701454,0.0002183722,0.8267934,0.001264407,0.0006795037,0.0005615113,0.00003061464,0.00009937581,0.0002073967],"genre_scores_gemma":[0.8389096,0.00009592842,0.1607995,0.000006964826,0.00004704681,0.00006332172,0.00005943794,0.00001232089,0.000005869916],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9650798,"threshold_uncertainty_score":0.3549933,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000715766,0.0002197684,0.000257546,0.0005323008,0.0002154905,0.000287721,0.004169575,0.00007684582,0.000004298903],"category_scores_gemma":[0.0003805486,0.0002381444,0.00007190881,0.001414185,0.00006649706,0.0009692154,0.004646476,0.0002639914,0.0001503338],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001948073,"about_ca_system_score_gemma":0.0002116584,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004709652,"about_ca_topic_score_gemma":0.0001719993,"domain_scores_codex":[0.9980701,0.0002238922,0.0006092176,0.0004579152,0.0002833322,0.0003555984],"domain_scores_gemma":[0.9954708,0.0005884549,0.0001770325,0.003282039,0.0002479749,0.0002336625],"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.00004412203,0.001169041,0.002666812,0.00001960393,0.0001045807,0.00001729756,0.02149412,0.06415705,0.003883597,0.5271258,0.002227189,0.3770908],"study_design_scores_gemma":[0.0006283016,0.00006732794,0.003000447,0.00006783327,0.00000694385,0.00001206358,0.0000324635,0.9568714,0.0001106043,0.03792979,0.0009974944,0.0002752832],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03614461,0.0001190992,0.9567195,0.005442436,0.0006654974,0.0003902355,0.000003498275,0.0002493596,0.0002658213],"genre_scores_gemma":[0.4900901,0.00000331079,0.5092603,0.0005041735,0.00008425202,0.00002318729,0.00001640716,0.00001025663,0.000007980474],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8927144,"threshold_uncertainty_score":0.9711248,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["open_science"],"category_scores_codex":[0.004054294,0.0001374297,0.0002139208,0.0005688182,0.001091263,0.003066706,0.01738888,0.0000507568,0.00002978837],"category_scores_gemma":[0.006663486,0.0001218973,0.00007171503,0.0004626962,0.0001681076,0.002618724,0.01747267,0.0002129684,0.001936264],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006886838,"about_ca_system_score_gemma":0.00005571827,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001770609,"about_ca_topic_score_gemma":0.000147723,"domain_scores_codex":[0.9975375,0.0001789992,0.0008004278,0.0004417936,0.0007634886,0.0002777684],"domain_scores_gemma":[0.9778964,0.001310621,0.0003827321,0.01999991,0.0002919981,0.0001183598],"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.000004659405,0.00006289334,0.005783373,0.000002997535,0.000008298583,8.121974e-7,0.0008871916,0.000368641,0.000003923672,0.01202529,0.05269021,0.9281617],"study_design_scores_gemma":[0.0008226442,0.00008432163,0.2879184,0.00007997196,0.000009439007,0.000003677145,0.0002698303,0.09440917,0.00003447814,0.194054,0.4218585,0.0004555085],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1726683,0.0002183578,0.7550118,0.05845896,0.007438185,0.001563275,0.0001352192,0.0004338775,0.004071965],"genre_scores_gemma":[0.617072,0.00002233116,0.3799619,0.002317347,0.0001612435,0.00005103856,0.00005335882,0.000008432769,0.0003523368],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9277062,"threshold_uncertainty_score":0.9988409,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004632378,0.0001451501,0.0002132513,0.0001822056,0.0000948852,0.00009108905,0.0004708463,0.00009729706,0.00000211003],"category_scores_gemma":[0.00003964653,0.0001565639,0.00003749019,0.0001560397,0.00001664061,0.0002012629,0.0002446308,0.0001541132,0.0000030566],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005491891,"about_ca_system_score_gemma":0.000005582746,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001768761,"about_ca_topic_score_gemma":0.00003463326,"domain_scores_codex":[0.9990835,0.00001622065,0.0004562656,0.0001411198,0.00009014508,0.000212818],"domain_scores_gemma":[0.9981013,0.0009229676,0.00006288407,0.000811659,0.00005236533,0.00004884492],"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.0000314595,0.000890803,0.008162857,0.001674449,0.0003960271,0.000005327954,0.0297039,0.2386568,0.1630321,0.03265197,0.00199419,0.5228001],"study_design_scores_gemma":[0.0004297244,0.00001250774,0.002546152,0.0002808939,0.000007478545,0.00000227417,0.00005670192,0.9912474,0.000945734,0.002878213,0.001422519,0.0001704256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06300663,0.0006647279,0.9349081,0.00007342966,0.00009500051,0.0005914264,0.000008105815,0.0004725134,0.0001800445],"genre_scores_gemma":[0.6387401,0.00005367352,0.3609888,0.00001992205,0.00005582877,0.00006355105,0.00005112337,0.00002526927,0.000001684514],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7525905,"threshold_uncertainty_score":0.6384491,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005639849,0.000164628,0.0001774939,0.0002427407,0.0001004348,0.0003316202,0.004940453,0.00003803285,0.000005415807],"category_scores_gemma":[0.00007164111,0.0001660133,0.00005542101,0.0009406337,0.00008060521,0.001514463,0.001362097,0.0001902272,0.0001203814],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001127731,"about_ca_system_score_gemma":0.0001609907,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006604981,"about_ca_topic_score_gemma":0.00007548063,"domain_scores_codex":[0.9984614,0.0001736131,0.0004360347,0.0003538086,0.0002778778,0.0002973134],"domain_scores_gemma":[0.9952954,0.0001646406,0.00008117506,0.004165239,0.000161833,0.0001317245],"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.00001109091,0.000488959,0.001177367,0.00001393891,0.00003821832,0.000006390428,0.00768234,0.00007060845,0.00006550352,0.08459632,0.01196095,0.8938883],"study_design_scores_gemma":[0.003697181,0.0005194219,0.00700691,0.0001318105,0.00001976153,0.0001119067,0.0001765275,0.5181606,0.001664173,0.3396908,0.1277672,0.001053613],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01180475,0.0004335001,0.9598486,0.01852172,0.0004748624,0.0007224757,0.00000644194,0.0004201485,0.007767514],"genre_scores_gemma":[0.4796815,0.00002849424,0.5192611,0.000736577,0.0000433825,0.00007409287,0.00005494148,0.00001204391,0.0001078957],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8928347,"threshold_uncertainty_score":0.9180673,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004972579,0.0001809613,0.000219863,0.0002495198,0.001065664,0.0004426615,0.001641877,0.0001040627,0.00002515945],"category_scores_gemma":[0.0002855544,0.000187518,0.00004034611,0.0001298583,0.0001913039,0.0007987104,0.001518912,0.0003914241,0.00001555179],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001925698,"about_ca_system_score_gemma":0.00003143131,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002439874,"about_ca_topic_score_gemma":0.00002340912,"domain_scores_codex":[0.9985701,0.0001371843,0.0004329199,0.0003030031,0.0002972262,0.0002595131],"domain_scores_gemma":[0.9961756,0.0004539132,0.0003007273,0.002883064,0.0001199209,0.00006678313],"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.0001552983,0.001171627,0.001978855,0.000156549,0.0001201229,0.000004669129,0.008617066,0.0009865736,0.0003898314,0.06259852,0.008402675,0.9154182],"study_design_scores_gemma":[0.005520955,0.0005046719,0.005135049,0.0004617944,0.00005525719,0.00006326367,0.0003772948,0.474284,0.001428444,0.4844403,0.02658496,0.001144017],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2443672,0.0005538224,0.7329043,0.0158998,0.0008320648,0.002392668,0.00006687514,0.0003156318,0.002667702],"genre_scores_gemma":[0.273411,0.001079537,0.7247072,0.00007355052,0.0001512721,0.0001594739,0.0001153344,0.0000377797,0.0002648578],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9142742,"threshold_uncertainty_score":0.8196335,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003739569,0.0001873685,0.0001882867,0.0001506729,0.0004589262,0.0003342917,0.00398071,0.00004843393,0.000002235176],"category_scores_gemma":[0.00005852701,0.0001060822,0.00003526641,0.0005725538,0.0006000247,0.0009072428,0.003588279,0.0001907937,0.00001151375],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003414074,"about_ca_system_score_gemma":0.00009197425,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002520989,"about_ca_topic_score_gemma":0.0001057913,"domain_scores_codex":[0.9985899,0.000275998,0.0002761451,0.0003690344,0.0001871139,0.0003017801],"domain_scores_gemma":[0.9949561,0.00184511,0.0001253449,0.002930677,0.00006987288,0.00007294074],"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.000009061701,0.00005705466,0.002596232,0.000006230845,0.00002798401,0.000004402358,0.00334536,0.00003810683,0.0001151546,0.459275,0.000751882,0.5337735],"study_design_scores_gemma":[0.004372392,0.000876622,0.3129239,0.0009984334,0.00003820525,0.0004149302,0.0004920277,0.2363754,0.001352987,0.3918904,0.04838458,0.001880149],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1274631,0.0006467342,0.7764103,0.09456702,0.000122852,0.0002453341,0.000001840518,0.0002530598,0.0002897347],"genre_scores_gemma":[0.7692199,0.00009838504,0.2296386,0.0009197496,0.00005261317,0.00001495306,0.00000227448,0.00001067608,0.00004286622],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6417568,"threshold_uncertainty_score":0.7397217,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001701285,0.0002864463,0.0003962107,0.0003701931,0.000303872,0.0003766629,0.003312841,0.0001461361,4.009545e-7],"category_scores_gemma":[0.0002182171,0.0003073176,0.0000979704,0.0005070775,0.00009613059,0.0005547479,0.002758135,0.0003402068,0.000003344408],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001073421,"about_ca_system_score_gemma":0.00008003384,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008161764,"about_ca_topic_score_gemma":0.00001828356,"domain_scores_codex":[0.9978804,0.0001424261,0.0006905825,0.0005703899,0.0001801841,0.000536021],"domain_scores_gemma":[0.9946834,0.002530731,0.0001700877,0.002354745,0.00009455557,0.0001664382],"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.00001411984,0.0002148576,0.0006947261,0.000105774,0.00009607372,0.00000474752,0.00223924,0.0203214,0.0003059106,0.09176668,0.0002904256,0.8839461],"study_design_scores_gemma":[0.0006265494,0.00005873713,0.008445594,0.0000758497,0.00001088237,0.00004334645,0.00004538678,0.985141,0.00007997553,0.00306634,0.002039868,0.0003664356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01238432,0.002144035,0.9830934,0.0008913146,0.0005114957,0.0006138143,0.000005291403,0.0003392936,0.00001699681],"genre_scores_gemma":[0.1889423,0.00005193788,0.8105061,0.000133693,0.0002069321,0.0001014642,0.00002483823,0.00002458358,0.000008151937],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9648196,"threshold_uncertainty_score":0.9999379,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007319973,0.0002488624,0.0004261634,0.000385562,0.0001867143,0.0002796712,0.002371144,0.0001025434,0.00000609287],"category_scores_gemma":[0.0001157833,0.0002658229,0.00007865012,0.0006473992,0.0002638115,0.0008089364,0.001568691,0.0003279419,0.00003015336],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001403284,"about_ca_system_score_gemma":0.0000980366,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004994381,"about_ca_topic_score_gemma":0.0003533422,"domain_scores_codex":[0.9978088,0.000330345,0.0006378957,0.0005880549,0.0002130129,0.0004219202],"domain_scores_gemma":[0.9949711,0.002861246,0.0001325274,0.001802845,0.0001187234,0.0001135526],"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.00008160286,0.001100737,0.05133151,0.0001981242,0.00005191713,0.000007550565,0.005609645,0.007117192,0.0005448426,0.7183475,0.001221606,0.2143877],"study_design_scores_gemma":[0.001152183,0.0001547112,0.1420673,0.00008957119,0.000004400483,0.00001150148,0.0000466311,0.7139219,0.00002962788,0.141867,0.0003715651,0.0002835769],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5577237,0.000357404,0.423278,0.01634101,0.0004754162,0.0009479544,0.00001420713,0.0002238601,0.0006384953],"genre_scores_gemma":[0.6774999,0.00005893781,0.3219598,0.0003752556,0.00002992607,0.00002243918,0.00003491979,0.00001233649,0.000006457682],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7068048,"threshold_uncertainty_score":0.9999794,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009085429,0.0001381525,0.0002459798,0.0001016401,0.0002574135,0.00003976364,0.001247251,0.00007517783,0.00007512428],"category_scores_gemma":[0.001292079,0.0001055595,0.0001111414,0.0003281848,0.0001737517,0.00009993785,0.0004512868,0.0002681514,0.00003740868],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006819145,"about_ca_system_score_gemma":0.0001087721,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003362573,"about_ca_topic_score_gemma":0.0001369168,"domain_scores_codex":[0.9987298,0.0002407347,0.0004983218,0.0001675116,0.0001951616,0.000168475],"domain_scores_gemma":[0.9928362,0.004256545,0.0002025855,0.002358989,0.0002912843,0.0000544153],"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.00002366789,0.0004345662,0.001434037,0.0000182334,0.00008092507,3.27882e-7,0.001397947,0.00008699565,0.00002021753,0.875558,0.116477,0.004468078],"study_design_scores_gemma":[0.001313411,0.0003324637,0.001178691,0.000262166,0.00008956371,0.00001220478,0.002021907,0.0199519,0.00009779316,0.9391358,0.03531858,0.0002854813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3749753,0.00033154,0.5850624,0.02385185,0.001462458,0.002183974,0.00015147,0.0002359487,0.01174504],"genre_scores_gemma":[0.8042755,0.0000169261,0.1942061,0.0003527657,0.0001261418,0.00030845,0.0001111659,0.00002539508,0.0005775672],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4293002,"threshold_uncertainty_score":0.4304594,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000537843,0.0001142872,0.0001497539,0.00003703171,0.0002285233,0.0001094266,0.001655914,0.00005713113,0.000005078426],"category_scores_gemma":[0.00001733358,0.00006859902,0.0000454241,0.0001937989,0.000246569,0.000077455,0.0004451591,0.0003338978,0.00005918889],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002061002,"about_ca_system_score_gemma":0.000006849173,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001814506,"about_ca_topic_score_gemma":0.0000932469,"domain_scores_codex":[0.9991787,0.0002721999,0.0002177214,0.0001017937,0.00007212057,0.0001574788],"domain_scores_gemma":[0.9954531,0.001662505,0.00003260245,0.002816964,0.00001125566,0.00002356419],"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.00001948394,0.00002267286,0.007781253,0.00003609254,0.0001284497,8.510214e-7,0.005036915,0.003637801,0.00002675203,0.9468053,0.001776409,0.03472802],"study_design_scores_gemma":[0.002741114,0.00005153101,0.03873992,0.0001755645,0.00003433457,0.00008946322,0.0003991238,0.3387364,0.00005314521,0.419914,0.198573,0.0004925079],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9531202,0.02279112,0.005038676,0.01240439,0.001044308,0.001218061,0.000006913852,0.0003405696,0.004035734],"genre_scores_gemma":[0.9976519,0.001056942,0.0009562815,0.0001866801,0.00003884924,0.00005405105,0.000007043675,0.0000155316,0.00003266359],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5268914,"threshold_uncertainty_score":0.3077127,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009096271,0.0003325171,0.000382183,0.0004288663,0.000239492,0.0004785035,0.009109363,0.0001438562,0.000008121861],"category_scores_gemma":[0.000163042,0.0003468348,0.0001398003,0.001503946,0.000228332,0.001128117,0.006018427,0.0005191863,0.0003371687],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002374532,"about_ca_system_score_gemma":0.0003500308,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003014297,"about_ca_topic_score_gemma":0.0001864672,"domain_scores_codex":[0.9971352,0.0004410043,0.0007249008,0.0006655702,0.0004323514,0.0006009397],"domain_scores_gemma":[0.9928942,0.0005816377,0.0002053429,0.005787375,0.0001961827,0.0003352415],"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.00001880451,0.0006761415,0.005030958,0.00001118711,0.00005129159,0.00002276611,0.00328999,0.000468441,0.00005299223,0.09506675,0.01548643,0.8798243],"study_design_scores_gemma":[0.004330673,0.0005357398,0.02846653,0.0001406696,0.00002663177,0.0001883216,0.0001152544,0.6983447,0.0003594081,0.1802389,0.08568653,0.001566687],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2141016,0.001826196,0.7478818,0.02782896,0.00253817,0.0009649318,0.000007341227,0.001491605,0.003359318],"genre_scores_gemma":[0.680644,0.00004135663,0.3177681,0.001131115,0.0002310075,0.00007302506,0.00003895934,0.00002227085,0.00005015318],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8782576,"threshold_uncertainty_score":0.9998984,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.001356087,0.0002568179,0.0004286935,0.0003361636,0.0003675692,0.000189555,0.01096203,0.00008023695,0.000004837885],"category_scores_gemma":[0.0001038861,0.0002131502,0.000160022,0.001280488,0.0002675629,0.0002842886,0.006554113,0.0003624046,0.00005187771],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003273842,"about_ca_system_score_gemma":0.00003759472,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003128901,"about_ca_topic_score_gemma":0.0001448134,"domain_scores_codex":[0.9972032,0.00107684,0.0006686749,0.0004320489,0.000242939,0.0003762387],"domain_scores_gemma":[0.9894065,0.002658311,0.0002379694,0.00745767,0.0001204221,0.0001191615],"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.00001276772,0.0004580367,0.002850832,0.000009836297,0.00006325798,0.000001592143,0.003193045,0.001641997,0.00009262435,0.342382,0.0006266881,0.6486673],"study_design_scores_gemma":[0.001176048,0.0003525718,0.06388675,0.0001765389,0.0000239829,0.00002260335,0.00002613877,0.7687775,0.0002133751,0.1514255,0.01338581,0.0005331504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01960688,0.0001336341,0.9714527,0.007466225,0.0002946665,0.0004723047,0.000007607196,0.0001820658,0.0003839454],"genre_scores_gemma":[0.5034875,0.00002255584,0.4953342,0.001032014,0.00004711044,0.00005192032,0.000006629738,0.00001120469,0.000006816802],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7671355,"threshold_uncertainty_score":0.9943891,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0007343996,0.0001718669,0.000269629,0.0002223957,0.0001388689,0.0001122205,0.007523688,0.00006268313,0.00001350523],"category_scores_gemma":[0.00006744188,0.0001378184,0.0001078077,0.0009223393,0.0001472653,0.0003976345,0.005306479,0.0003757685,0.0001313665],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006102263,"about_ca_system_score_gemma":0.00009781031,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001371798,"about_ca_topic_score_gemma":0.00003650592,"domain_scores_codex":[0.9982077,0.0003456685,0.000581324,0.0003367992,0.0002457482,0.0002826969],"domain_scores_gemma":[0.9934657,0.001424152,0.000246505,0.004712138,0.0001043147,0.0000472436],"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.0000111761,0.0004162336,0.01673685,0.00004055545,0.00006991619,0.000002349604,0.006881607,0.002030863,0.0004892982,0.4745312,0.001056464,0.4977335],"study_design_scores_gemma":[0.0007152919,0.0001098133,0.05606643,0.0001611575,0.00000625425,0.0000269258,0.000061144,0.8810737,0.0003543807,0.05891484,0.002221309,0.0002887899],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3932518,0.0005115158,0.5885888,0.01486139,0.0007300825,0.0005320664,0.000001992338,0.0001789996,0.001343396],"genre_scores_gemma":[0.8432466,0.00002470878,0.1558204,0.0008169615,0.00004280826,0.000007781437,0.000006285192,0.00000969512,0.00002474979],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8790428,"threshold_uncertainty_score":0.9978461,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0005673486,0.0001493487,0.0001888397,0.0001747906,0.000195062,0.0002371068,0.008229597,0.0001113335,0.00001478269],"category_scores_gemma":[0.00004826372,0.000142203,0.00007579896,0.0006049893,0.0001425687,0.0004140453,0.001733804,0.0005681769,0.000178765],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002122555,"about_ca_system_score_gemma":0.00006285698,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001221983,"about_ca_topic_score_gemma":0.0005144459,"domain_scores_codex":[0.9986829,0.000160261,0.0003587007,0.0003302627,0.0001754366,0.0002924383],"domain_scores_gemma":[0.9929769,0.0003691125,0.00008345478,0.00640449,0.00008109221,0.00008493514],"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":[6.716692e-7,0.0001640619,0.002325194,0.000006119662,0.00001078073,0.000003893862,0.001444917,0.000006832134,0.0001942104,0.7715486,0.0004059413,0.2238887],"study_design_scores_gemma":[0.001287182,0.0001590201,0.02410473,0.00001499238,0.00001134774,0.0001505271,0.00002944771,0.1541833,0.0004641355,0.4943536,0.3244146,0.0008271195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007479556,0.0003037782,0.9797323,0.006027994,0.001146827,0.0003014806,5.18037e-7,0.0004250837,0.004582422],"genre_scores_gemma":[0.6959123,0.00003521672,0.3035482,0.0003289103,0.00007737923,0.00004265546,0.000006385142,0.00000853543,0.00004039172],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6884328,"threshold_uncertainty_score":0.9971364,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000602789,0.0001337156,0.0002726637,0.0001462037,0.0001450565,0.00004457221,0.002699507,0.00006617812,0.00002060005],"category_scores_gemma":[0.0002252127,0.0001421074,0.00007582575,0.0001286702,0.0001729326,0.0003044871,0.001091788,0.0002029287,0.00001894524],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001086284,"about_ca_system_score_gemma":0.00001802291,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009101583,"about_ca_topic_score_gemma":0.000189951,"domain_scores_codex":[0.9989607,0.0001363852,0.0004422207,0.0001322568,0.0001762669,0.0001522056],"domain_scores_gemma":[0.9942943,0.0001751072,0.0001660024,0.005184599,0.0001416344,0.0000383329],"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.000007953526,0.0004720237,0.01110374,0.00003968634,0.0001957376,0.000001073924,0.001208767,0.1441712,0.002942766,0.002957568,0.001036108,0.8358634],"study_design_scores_gemma":[0.0005210165,0.00001582507,0.03329544,0.00006268101,0.00004202672,0.000001490339,0.00002066717,0.9535632,0.001391519,0.01055828,0.0003400269,0.0001878651],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0738597,0.0009010337,0.9221584,0.0009929861,0.0001110698,0.0004930643,0.00000891604,0.0003111073,0.001163754],"genre_scores_gemma":[0.601447,0.0002469942,0.3981768,0.0000211187,0.00001577297,0.00006237931,0.00001301583,0.0000132478,0.000003682281],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8356755,"threshold_uncertainty_score":0.579497,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001244831,0.0002325493,0.0003646831,0.0007202488,0.0002017349,0.0001086612,0.002583965,0.0001599728,0.0002755244],"category_scores_gemma":[0.0005846692,0.0002432558,0.0001025411,0.00203741,0.00008495847,0.0004413669,0.001885863,0.0005796049,0.0005829065],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001040187,"about_ca_system_score_gemma":0.00004825935,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002705268,"about_ca_topic_score_gemma":0.00001185984,"domain_scores_codex":[0.9979428,0.0003877957,0.0006842621,0.0003445757,0.0002917526,0.0003488004],"domain_scores_gemma":[0.9916571,0.003775762,0.0002346565,0.004136468,0.0001280043,0.00006799091],"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.00002246556,0.00100031,0.0676235,0.0001783382,0.0001602842,0.000005204166,0.003239001,0.0001439531,0.0001832351,0.6307094,0.001852247,0.2948821],"study_design_scores_gemma":[0.001577112,0.0001288549,0.02484162,0.0002207863,0.00003489707,0.00004232694,0.0003152344,0.05094514,0.0002852122,0.9162681,0.004609104,0.0007316165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9591808,0.0004164491,0.03027279,0.001073432,0.0004771116,0.0006224414,0.000005748725,0.0002791467,0.00767204],"genre_scores_gemma":[0.6880431,0.00008266192,0.3112534,0.0002635382,0.00006767778,0.00004375812,0.00004799549,0.00003104535,0.0001668432],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2941505,"threshold_uncertainty_score":0.9919683,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0005806134,0.000142175,0.0001958755,0.0008908618,0.0001475082,0.000150819,0.006290313,0.00007460883,0.000004151136],"category_scores_gemma":[0.00006385753,0.0001453796,0.00007646063,0.003240799,0.0001212909,0.0003880216,0.00484625,0.0003525907,0.0001662913],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000351686,"about_ca_system_score_gemma":0.00003533743,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001152401,"about_ca_topic_score_gemma":0.0004042799,"domain_scores_codex":[0.9985211,0.0002283411,0.000382093,0.0003462117,0.0001803372,0.0003419076],"domain_scores_gemma":[0.994006,0.0008223251,0.00005861237,0.005021495,0.00003665323,0.00005487961],"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.000002768129,0.0004785548,0.04380031,0.00003487563,0.00003256315,0.00006684267,0.004871124,0.003214476,0.00008038623,0.5783277,0.002727671,0.3663628],"study_design_scores_gemma":[0.0004858711,0.00003368002,0.3787633,0.0001117151,0.000002424456,0.00001335995,0.00003896343,0.4289976,0.00004374971,0.1881534,0.003082423,0.0002735717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4500059,0.001515941,0.5137993,0.02890558,0.0007992879,0.0007849922,0.000005016873,0.001570571,0.0026135],"genre_scores_gemma":[0.7133636,0.0005931263,0.285618,0.0003048385,0.00002249915,0.00006132328,0.00001104685,0.000009488528,0.00001609336],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4257831,"threshold_uncertainty_score":0.9990861,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006697701,0.0001845676,0.0002719359,0.0003506895,0.0002477121,0.0001744676,0.003788536,0.00007546749,0.00000511112],"category_scores_gemma":[0.0001014086,0.000179661,0.00004740299,0.001113525,0.0001466455,0.0005649173,0.004087768,0.0003961449,0.00001530662],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006517553,"about_ca_system_score_gemma":0.0000369092,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001751708,"about_ca_topic_score_gemma":0.00003511678,"domain_scores_codex":[0.9981477,0.0003613827,0.0004920761,0.0004532811,0.0001714955,0.0003740574],"domain_scores_gemma":[0.996144,0.00068106,0.0001043233,0.002926112,0.00003540298,0.0001091138],"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.000005317408,0.0008022439,0.0223671,0.0000166843,0.00001875364,0.00002658037,0.008467944,0.0001609886,0.0008359219,0.04315701,0.00004247105,0.924099],"study_design_scores_gemma":[0.0007251078,0.000115826,0.147205,0.0003334836,0.000007284618,0.00002498038,0.0001256608,0.725633,0.0003867784,0.1243794,0.0005048253,0.0005586508],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05511197,0.0001675649,0.9427757,0.0006123714,0.0003291671,0.0002232013,7.633978e-7,0.00009279702,0.0006864314],"genre_scores_gemma":[0.4667191,0.00006523961,0.5329579,0.000197806,0.00001582233,0.00002754544,0.000001559642,0.000008578611,0.000006510784],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9235404,"threshold_uncertainty_score":0.7326365,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0003916426,0.0001713471,0.0001897038,0.0002876467,0.00028942,0.0002152497,0.007505013,0.00006984236,0.00001857951],"category_scores_gemma":[0.0000723483,0.0001777391,0.00006682942,0.001033619,0.0002524551,0.0006629162,0.004964471,0.000248809,0.0004673028],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007719807,"about_ca_system_score_gemma":0.0000950649,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007192804,"about_ca_topic_score_gemma":0.000112891,"domain_scores_codex":[0.9984382,0.0002038214,0.0004103486,0.0004142115,0.0001957634,0.0003376289],"domain_scores_gemma":[0.9941854,0.0004580125,0.0001055224,0.005025016,0.0001343522,0.00009171596],"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.000003738864,0.0002186789,0.001403188,0.000004813036,0.00001697739,0.000003878575,0.001778675,0.00004138125,0.0001457436,0.3029172,0.003856648,0.6896091],"study_design_scores_gemma":[0.0007603006,0.000200404,0.03328771,0.00006643478,0.000005193712,0.0000409307,0.00001249008,0.6596662,0.0005413337,0.27206,0.03286434,0.0004946245],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03704889,0.0002919259,0.9463821,0.01144188,0.0007589476,0.0002265793,0.000001440489,0.0004764977,0.003371711],"genre_scores_gemma":[0.6027355,0.0000335823,0.3958142,0.001156878,0.0001889608,0.00002150292,0.000006471283,0.000008524512,0.00003436055],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6891145,"threshold_uncertainty_score":0.9978648,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004945351,0.0001201174,0.0002290792,0.0001970144,0.0004737401,0.00007605586,0.003293914,0.00007760487,0.000022259],"category_scores_gemma":[0.0005848535,0.0001273283,0.00006201238,0.0001729318,0.0002715653,0.000116131,0.002860044,0.0003184131,0.00002256265],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009655178,"about_ca_system_score_gemma":0.00003478113,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009299827,"about_ca_topic_score_gemma":0.0002337451,"domain_scores_codex":[0.9987464,0.0001922237,0.0004070178,0.0002040157,0.0002476257,0.0002026981],"domain_scores_gemma":[0.9926254,0.0006504553,0.0003385396,0.006146299,0.0001858576,0.00005344811],"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.00004486348,0.002603346,0.02209708,0.0003153948,0.0001613734,0.00001403811,0.003731046,0.02386744,0.0009691761,0.02423286,0.0003772575,0.9215861],"study_design_scores_gemma":[0.0007746192,0.00004421723,0.03003093,0.0001224585,0.00001243124,0.000008109273,0.00004507109,0.9350383,0.0008511037,0.03254662,0.0003202877,0.0002058215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1153619,0.00007990435,0.8822903,0.001239209,0.000125406,0.0003667815,0.000008845421,0.00007002361,0.0004576946],"genre_scores_gemma":[0.6447936,0.00004354536,0.355056,0.00001419704,0.00002222756,0.0000196099,0.000004482799,0.00001429291,0.0000320101],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9213803,"threshold_uncertainty_score":0.6120967,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009527381,0.0002084975,0.0003079064,0.00005276482,0.0003491567,0.000135895,0.00514189,0.00009232775,0.000004845132],"category_scores_gemma":[0.00115732,0.0001416815,0.00009561364,0.0004389611,0.0001691366,0.000129995,0.001079633,0.0005876148,0.00002405625],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005895338,"about_ca_system_score_gemma":0.00003473046,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006927542,"about_ca_topic_score_gemma":0.0001337072,"domain_scores_codex":[0.998073,0.0004582813,0.0006725581,0.0002263976,0.0002364145,0.0003333324],"domain_scores_gemma":[0.9818609,0.01373301,0.0002005886,0.004094788,0.00006117882,0.00004949006],"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.0000316736,0.0004261977,0.0002509714,0.00009600657,0.00004181337,0.000004963771,0.01760004,0.00001826892,0.00003210748,0.949214,0.01245873,0.01982517],"study_design_scores_gemma":[0.001018074,0.0001196439,0.0003151994,0.00008745712,0.00001671756,0.000007019726,0.0008177455,0.01400275,0.00002869815,0.9695522,0.01383361,0.0002008535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07693934,0.002022235,0.697467,0.2111063,0.001192796,0.007745698,0.00008332583,0.0005794554,0.002863849],"genre_scores_gemma":[0.7855545,0.0001563815,0.2117851,0.001794176,0.0001561996,0.0004679572,0.00002709558,0.00004485025,0.00001378421],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7086151,"threshold_uncertainty_score":0.9554996,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004582271,0.0001776335,0.0002417725,0.0006955274,0.0001441169,0.0002251948,0.002720902,0.00009599313,0.000004040179],"category_scores_gemma":[0.0001033968,0.0001869997,0.00004680041,0.001271701,0.0001307193,0.0006300551,0.003398428,0.0004239549,0.00001501446],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001179904,"about_ca_system_score_gemma":0.0001093424,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002559877,"about_ca_topic_score_gemma":0.000324605,"domain_scores_codex":[0.9983995,0.0002828641,0.0004841106,0.0004313907,0.0001293975,0.0002727585],"domain_scores_gemma":[0.9964717,0.0008698014,0.00008867015,0.002460853,0.00005598445,0.00005297328],"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.000008404331,0.0003389567,0.01019342,0.00003203638,0.00002580981,0.000005278522,0.001288811,0.0005133042,0.0001316419,0.1947241,0.001118925,0.7916194],"study_design_scores_gemma":[0.0008444113,0.00004072173,0.1483742,0.0002256681,0.000007308172,0.00001491077,0.00003284323,0.6676546,0.0001919682,0.1753117,0.006994769,0.0003068355],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1617594,0.001437183,0.8149313,0.01948959,0.0006899781,0.0004416846,0.000001381528,0.0002320016,0.001017509],"genre_scores_gemma":[0.8732375,0.0002742981,0.1252532,0.001021904,0.00003098922,0.00006442182,0.00000816805,0.000007272219,0.0001022156],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7913125,"threshold_uncertainty_score":0.7625625,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005150763,0.0001243577,0.0002251071,0.0002578117,0.0001013826,0.00008078154,0.00354902,0.00007038644,0.00001124984],"category_scores_gemma":[0.0000452934,0.0001323796,0.00006334617,0.0006423001,0.0001337446,0.0002941428,0.003837385,0.0002685083,0.00001719908],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001119671,"about_ca_system_score_gemma":0.00002335429,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002503944,"about_ca_topic_score_gemma":0.000008009522,"domain_scores_codex":[0.9988952,0.0001742436,0.0003476915,0.0002752865,0.0001217902,0.0001857746],"domain_scores_gemma":[0.9950108,0.001529906,0.0001352498,0.00321676,0.00006408869,0.00004319164],"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.000007541617,0.0002148934,0.03838181,0.00004961534,0.00004007831,0.000002044232,0.00530191,0.0007449949,0.0002029927,0.7827718,0.0002061471,0.1720762],"study_design_scores_gemma":[0.0008647101,0.0002343844,0.02961267,0.0002633943,0.00000890247,0.00002352081,0.00006401651,0.7539279,0.0002782043,0.2121878,0.002142759,0.000391782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4006959,0.0004611385,0.5955555,0.001795306,0.0002190241,0.0001914299,0.000001384066,0.0001137095,0.0009666589],"genre_scores_gemma":[0.7164919,0.0000711207,0.283031,0.0003762418,0.00001144198,0.000003134501,0.000002685133,0.000005133965,0.000007331135],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7531829,"threshold_uncertainty_score":0.6595021,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0005270952,0.0002113911,0.0002361355,0.0003855765,0.0002761342,0.0001486876,0.007377444,0.00008757073,0.00001233488],"category_scores_gemma":[0.00007408846,0.0002208818,0.00009192976,0.001094467,0.000124191,0.0008744455,0.004897024,0.0003197079,0.000105922],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000821908,"about_ca_system_score_gemma":0.00007958526,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003022315,"about_ca_topic_score_gemma":0.0001159097,"domain_scores_codex":[0.9981248,0.0002657775,0.0005581643,0.0004557985,0.0002155649,0.0003799068],"domain_scores_gemma":[0.9947627,0.0003394734,0.0001988592,0.004499153,0.00009266737,0.0001071897],"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.000005435775,0.0003867052,0.005311216,0.00001880031,0.00003843772,0.00001335274,0.008448456,0.0001603957,0.0001149225,0.4742425,0.0008189624,0.5104408],"study_design_scores_gemma":[0.0005447601,0.00008619032,0.0372622,0.00009511181,0.000008299937,0.00003377817,0.00003898967,0.7457564,0.0004832456,0.2134491,0.001775885,0.00046597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1179807,0.0007420059,0.8748828,0.003475791,0.0004590776,0.0002902186,0.000001598546,0.0005224377,0.001645406],"genre_scores_gemma":[0.5577342,0.00008815873,0.4414909,0.0005675773,0.0000560359,0.00002890634,0.000006637779,0.00001058935,0.00001698932],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7455961,"threshold_uncertainty_score":0.9979931,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000177491,0.00009255119,0.0001317312,0.0001277589,0.00004577312,0.0000216652,0.0006137601,0.00008497763,0.000003696217],"category_scores_gemma":[0.00001630761,0.000082021,0.00002998675,0.0004464883,0.00006026757,0.00007642464,0.0003721743,0.0003675992,0.00000220584],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002467858,"about_ca_system_score_gemma":0.00001286301,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008134684,"about_ca_topic_score_gemma":0.000251146,"domain_scores_codex":[0.9993818,0.00003809324,0.000280392,0.0001054126,0.00008207967,0.0001121883],"domain_scores_gemma":[0.9987448,0.0001221438,0.00004060393,0.001038698,0.00003099754,0.00002274329],"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.00003158928,0.0008724053,0.2375539,0.000205595,0.0001320243,0.000003328365,0.005548803,0.2113719,0.005145761,0.07184622,0.0006916517,0.4665968],"study_design_scores_gemma":[0.0001877388,0.00001064564,0.1215956,0.00002819633,0.00000472722,0.00000669405,0.00001671737,0.8724923,0.0000325101,0.005190779,0.0003544004,0.0000796836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.978609,0.0001424611,0.02016138,0.0005307291,0.0002207293,0.0001651808,0.000002442195,0.00005669102,0.000111375],"genre_scores_gemma":[0.9837505,0.0001075345,0.01601128,0.00006162193,0.00002314762,0.00001365737,0.00001647394,0.00001391465,0.000001817676],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6611204,"threshold_uncertainty_score":0.3344719,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000354397,0.0001140295,0.000130415,0.0001640457,0.0002813246,0.0009130886,0.0009348227,0.00002777182,0.0000842002],"category_scores_gemma":[0.00009347712,0.000110178,0.00002602771,0.00005709958,0.0002844974,0.0008095832,0.0009116195,0.0002525416,0.00005611243],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004576998,"about_ca_system_score_gemma":0.00002971292,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002132814,"about_ca_topic_score_gemma":0.002255809,"domain_scores_codex":[0.9992011,0.00009731075,0.0002825992,0.0001502483,0.0001188194,0.0001499684],"domain_scores_gemma":[0.998315,0.0002655437,0.00006432927,0.001176046,0.0001124365,0.00006667717],"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.000007214585,0.0001064956,0.001050397,0.000006726852,0.00001042327,0.00000251252,0.03102505,0.000001419109,0.000001969661,0.8596346,0.002096163,0.106057],"study_design_scores_gemma":[0.001830299,0.0007920075,0.006509523,0.0005182053,0.0000335197,0.0000417078,0.02657216,0.005259234,0.00002744436,0.6082417,0.3492655,0.0009086788],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6566772,0.001043668,0.0002423937,0.003524897,0.0003559117,0.0002637996,0.00001171301,0.0001764372,0.3377039],"genre_scores_gemma":[0.9929987,0.00006003412,0.004778826,0.0008814919,0.0002098876,0.00002606626,0.0000633038,0.00001445061,0.000967268],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3471693,"threshold_uncertainty_score":0.8804935,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0007975336,0.0002251839,0.0002619071,0.0002701479,0.001037979,0.0006813972,0.02092706,0.0001082414,0.00001853095],"category_scores_gemma":[0.000182436,0.0002376922,0.0001539043,0.0003847343,0.000559945,0.001048669,0.01055616,0.0004902426,0.0002432569],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003827205,"about_ca_system_score_gemma":0.00006289069,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005196266,"about_ca_topic_score_gemma":0.00007339468,"domain_scores_codex":[0.9982175,0.0002827077,0.0004138535,0.0004840158,0.0002193807,0.0003824913],"domain_scores_gemma":[0.9818866,0.0005751895,0.0002381657,0.01708179,0.0001066216,0.0001116345],"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.000005811001,0.0003174116,0.006440996,0.00001098809,0.00004230794,0.00001073966,0.001649161,0.00006342631,0.00004968576,0.8342049,0.001796522,0.155408],"study_design_scores_gemma":[0.001170942,0.0001589657,0.06329592,0.0001782417,0.00001753254,0.00003040645,0.0000315039,0.2188921,0.0003386605,0.6741124,0.04096766,0.0008056051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06803255,0.0004547749,0.8978995,0.02368748,0.0008278554,0.0004107669,0.000005049301,0.0006023125,0.008079718],"genre_scores_gemma":[0.6297612,0.0001690513,0.3691716,0.000721679,0.00009281398,0.00002476839,0.000006258476,0.00001309003,0.00003960724],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5617286,"threshold_uncertainty_score":0.9974463,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}