{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":80,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":80,"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":"b409d2e69d50","filters":{"venue":"SIAM Journal on Scientific Computing"}},"results":[{"id":"W2153971576","doi":"10.1137/s1064827599360741","title":"Fast Finite Volume Simulation of 3D Electromagnetic Problems with Highly Discontinuous Coefficients","year":2001,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Electromagnetic Simulation and Numerical Methods","field":"Engineering","cited_by":163,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Discretization; Maxwell's equations; Mathematical analysis; Classification of discontinuities; Applied mathematics; Domain decomposition methods; Finite volume method; Helmholtz equation; Finite element method; Iterative method; Multigrid method; Partial differential equation; Boundary value problem; Mathematical optimization; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01322133585048279,"gpt":0.2547023628363938,"spread":0.241481026985911,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008375379,0.0002114406,0.0002995369,0.0003610792,0.0002774374,0.0002552712,0.0002412214,0.00005587851,0.0001252061],"category_scores_gemma":[0.0001233179,0.0001749083,0.00007683827,0.001262768,0.0001128697,0.0001205574,0.00002550578,0.0003784914,0.00002943358],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007668,"about_ca_system_score_gemma":0.00003640348,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001421633,"about_ca_topic_score_gemma":0.000001501911,"domain_scores_codex":[0.997882,0.0001262936,0.0005871462,0.000281992,0.0006175907,0.0005049537],"domain_scores_gemma":[0.9987867,0.0003532627,0.0002189231,0.0002408432,0.0002375342,0.0001627591],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000028911,0.00006983634,0.0007045918,0.00001804873,0.00001782926,0.00001040096,0.0002582987,0.9170001,0.009001247,0.00001428027,0.00005696457,0.07281946],"study_design_scores_gemma":[0.0006970828,0.0007957522,0.003479886,0.0001607797,0.00002042368,0.00006110104,0.00002704933,0.9905874,0.0005185141,0.00007063554,0.00336888,0.0002124648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6392184,0.0001316131,0.3583317,0.00003206758,0.0005619028,0.0001443677,0.000001302191,0.00009414837,0.001484459],"genre_scores_gemma":[0.9888498,0.000005627493,0.01004945,0.00001990596,0.0001207469,8.448756e-7,0.000004813645,0.0000348686,0.0009139386],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3496314,"threshold_uncertainty_score":0.7132554,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1996309908","doi":"10.1137/s1064827502401953","title":"Permuting Sparse Rectangular Matrices into Block-Diagonal Form","year":2004,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":155,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Hypergraph; Mathematics; Diagonal; Bipartite graph; Sparse matrix; Block matrix; Factorization; Combinatorics; Vertex (graph theory); Graph; Algorithm; Eigenvalues and eigenvectors; Gaussian","retraction":null,"screen_n_in":null,"score":{"opus":0.0130859972809326,"gpt":0.2427284259525517,"spread":0.2296424286716191,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001660426,0.0002378476,0.0002433159,0.0005031791,0.0008155538,0.0007559576,0.0004365449,0.00009307417,0.00003784534],"category_scores_gemma":[0.00008109077,0.0002191888,0.0001740687,0.0007109793,0.00007994679,0.0002684142,0.00007598732,0.0006403809,0.000105929],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003286074,"about_ca_system_score_gemma":0.00007803552,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004712422,"about_ca_topic_score_gemma":0.000004040577,"domain_scores_codex":[0.9979899,0.00003434648,0.0005274065,0.0003037089,0.0005833955,0.0005612358],"domain_scores_gemma":[0.9991723,0.00008348253,0.0001427401,0.0002583978,0.0001307692,0.0002123457],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003835795,0.0002927952,0.000940425,0.0003092055,0.0002209641,0.001005015,0.01334503,0.4022429,0.1819001,0.004212248,0.01327511,0.3822178],"study_design_scores_gemma":[0.004893904,0.001129139,0.003089186,0.005704013,0.0002149072,0.007980947,0.003268594,0.4212023,0.3741685,0.07890786,0.09487782,0.004562846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9315506,0.001015194,0.06022849,0.0001235788,0.002732255,0.0001537074,0.000002227171,0.0006868243,0.003507119],"genre_scores_gemma":[0.9810358,0.0000265934,0.01816037,0.00004687679,0.0006156671,0.000001012337,0.000002729909,0.00004090978,0.00006998938],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.377655,"threshold_uncertainty_score":0.893826,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1985124402","doi":"10.1137/060672911","title":"A Semi-Lagrangian Approach for Natural Gas Storage Valuation and Optimal Operation","year":2007,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":141,"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":"Hamilton–Jacobi–Bellman equation; Mathematics; Applied mathematics; Valuation (finance); Viscosity solution; Mathematical optimization; Augmented Lagrangian method; Bounded function; Mathematical analysis; Optimal control","retraction":null,"screen_n_in":null,"score":{"opus":0.04049729572502846,"gpt":0.268223589546449,"spread":0.2277262938214205,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026052,0.0001019311,0.0001722678,0.000276273,0.0008277372,0.0005764289,0.0001483249,0.0000498291,0.000007879446],"category_scores_gemma":[0.0001639166,0.0001052612,0.00007091335,0.0003259501,0.00005888479,0.0002071073,0.00003284602,0.0001887669,0.00002321946],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008507411,"about_ca_system_score_gemma":0.00002896606,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005853926,"about_ca_topic_score_gemma":0.000001939429,"domain_scores_codex":[0.9988018,0.000004038916,0.0004881976,0.0003501151,0.00007947291,0.0002764177],"domain_scores_gemma":[0.9992222,0.00009018028,0.0003283082,0.000119998,0.0001461628,0.0000931808],"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.00009877091,0.0003274833,0.0008108599,0.00009375917,0.00005631602,0.000002978808,0.004502926,0.02314353,0.001767597,0.8228649,0.001068924,0.1452619],"study_design_scores_gemma":[0.0007966359,0.0001119608,0.008231679,0.00002979224,0.000008824294,0.00006324177,0.0004132713,0.9403921,0.0001107751,0.04631559,0.003256967,0.0002691191],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1557422,0.000541336,0.8417773,0.0001886893,0.0006915711,0.0002829589,0.0000106928,0.00001528053,0.000750039],"genre_scores_gemma":[0.9514365,0.000002735638,0.04793441,0.00007774989,0.0003706008,0.00000498619,0.00002266734,0.00001095192,0.0001394068],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9172486,"threshold_uncertainty_score":0.6366369,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1985018928","doi":"10.1137/s1064827599356638","title":"Extensible Lattice Sequences for Quasi-Monte Carlo Quadrature","year":2000,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":126,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Monte Carlo method; Mathematics; Lattice (music); Pseudorandom number generator; Quasi-Monte Carlo method; Quadrature (astronomy); Monte Carlo integration; Statistical physics; Hybrid Monte Carlo; Applied mathematics; Algorithm; Statistics; Physics; Markov chain Monte Carlo","retraction":null,"screen_n_in":null,"score":{"opus":0.07684025678555359,"gpt":0.3604038760933648,"spread":0.2835636193078112,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002617184,0.0001805888,0.0002860953,0.000155271,0.0008384897,0.0009029711,0.0002970549,0.00008334594,0.0008174364],"category_scores_gemma":[0.000872724,0.0001302758,0.0001973808,0.0003899268,0.00009595911,0.0002564105,0.00001787899,0.0003686668,0.0001403004],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007059547,"about_ca_system_score_gemma":0.00008491107,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001388606,"about_ca_topic_score_gemma":0.000006370719,"domain_scores_codex":[0.9979641,0.0001168655,0.0006463791,0.0003178753,0.0005972348,0.0003575568],"domain_scores_gemma":[0.9981098,0.0007473488,0.0002904811,0.0002769441,0.0004182161,0.0001572739],"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.0001669364,0.001066185,0.00002998393,0.0004964653,0.0001092007,0.00002986043,0.01013352,0.001083364,0.001668277,0.7334483,0.1033346,0.1484333],"study_design_scores_gemma":[0.0008448373,0.00035168,0.00003840216,0.0008208789,0.00005825187,0.0002748412,0.001387389,0.4235121,0.001491514,0.5168232,0.05396789,0.0004290618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8965301,0.0001224569,0.0782723,0.002170366,0.001731793,0.0006573166,0.00001248887,0.0001729397,0.02033022],"genre_scores_gemma":[0.757581,0.000006464778,0.214057,0.0004985149,0.0007341717,0.000006760587,0.000005776128,0.00004187913,0.02706842],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4224287,"threshold_uncertainty_score":0.8950356,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1964401556","doi":"10.1137/110833543","title":"The Linearized Alternating Direction Method of Multipliers for Dantzig Selector","year":2012,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Control Systems and Identification","field":"Engineering","cited_by":122,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Applied mathematics; Selection (genetic algorithm); Mathematical optimization; Variable (mathematics); Algorithm; Mathematical analysis; Computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01890008567096116,"gpt":0.2930800877886481,"spread":0.2741800021176869,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004825161,0.0001026411,0.0001674629,0.000140351,0.0007489385,0.0003596007,0.0001878121,0.00003446143,0.000003468266],"category_scores_gemma":[0.0003578354,0.00007544427,0.0001369386,0.0002764494,0.00002695754,0.0001567036,0.00001914905,0.0001925782,0.00000687344],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009761727,"about_ca_system_score_gemma":0.00001900705,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005166986,"about_ca_topic_score_gemma":0.000004426003,"domain_scores_codex":[0.9986237,0.0000938909,0.0005191664,0.0001263,0.0002949369,0.0003420149],"domain_scores_gemma":[0.9986332,0.0006103301,0.0002734959,0.0001711785,0.0002214699,0.00009034738],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004157862,0.00005107013,0.0009006335,0.00008814676,0.0001449816,3.104022e-7,0.001870571,0.09469777,0.4928713,0.0005079287,0.002590222,0.4062355],"study_design_scores_gemma":[0.0004963088,0.00002060622,0.001622384,0.00009448712,0.00001881206,0.00002827108,0.0001997282,0.9522288,0.01821687,0.00004880862,0.02691683,0.0001081275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3422234,0.000672128,0.6440098,0.00004909962,0.01227771,0.0003028929,0.000003879003,0.000078349,0.0003826798],"genre_scores_gemma":[0.9895181,0.00000579223,0.009120301,0.000003356202,0.0009647063,0.000003465329,0.000002111809,0.00001964038,0.0003625305],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.857531,"threshold_uncertainty_score":0.5760306,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2030828704","doi":"10.1137/030602630","title":"A Semi-Lagrangian Approach for American Asian Options under Jump Diffusion","year":2005,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":101,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Rate of convergence; Monotonic function; Applied mathematics; Lagrangian; Volatility (finance); Jump; Convergence (economics); Stability (learning theory); Order (exchange); Stochastic game; Diffusion; Mathematical analysis; Mathematical economics; Econometrics; Computer science; Thermodynamics; Economics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.03530168075740968,"gpt":0.2619176441464958,"spread":0.2266159633890861,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009287414,0.0001475887,0.0002969141,0.0003942895,0.001198561,0.0004731597,0.0003632776,0.0000478084,0.00002731251],"category_scores_gemma":[0.00009673211,0.0001528569,0.0001949,0.0007807166,0.0001478633,0.0001400947,0.00006027221,0.0002503277,0.0001572359],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001499848,"about_ca_system_score_gemma":0.0000460783,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001093295,"about_ca_topic_score_gemma":0.000007857227,"domain_scores_codex":[0.9984044,0.000005949228,0.0006058092,0.0004811739,0.00009012424,0.0004125394],"domain_scores_gemma":[0.9988165,0.000070489,0.0005669132,0.0002666269,0.0001094496,0.0001700501],"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.00002018211,0.0005155578,0.0002733408,0.00001874531,0.00003279376,5.837904e-7,0.0008631591,0.01155285,0.0001912967,0.9078026,0.001497074,0.07723182],"study_design_scores_gemma":[0.001651592,0.0003282969,0.01078364,0.00008803319,0.00002825133,0.0001122737,0.00142887,0.6420729,0.00006149023,0.1836332,0.1589305,0.0008809569],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02675813,0.0003082741,0.9637002,0.001819418,0.0005679221,0.0002544711,0.00005840835,0.00003929604,0.006493859],"genre_scores_gemma":[0.935662,0.000008501655,0.06254413,0.0002499717,0.0007675416,0.00001212989,0.00001997932,0.00002208498,0.0007136407],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9089039,"threshold_uncertainty_score":0.9218482,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2045147903","doi":"10.1137/130915406","title":"Total Variation Structured Total Least Squares Method for Image Restoration","year":2013,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Statistical and numerical algorithms","field":"Mathematics","cited_by":78,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Total variation denoising; Image restoration; Minification; Regularization (linguistics); Algorithm; Function (biology); Image (mathematics); Mathematical optimization; Variation (astronomy); Least-squares function approximation; Applied mathematics; Point spread function; Image processing; Statistics; Computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.03897622812694122,"gpt":0.3536789086436316,"spread":0.3147026805166904,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001350249,0.0001657423,0.0002515521,0.0001521911,0.0007357848,0.0009813559,0.0001640877,0.00006274776,0.0003234951],"category_scores_gemma":[0.001644562,0.0001269023,0.0001381897,0.0003256451,0.00006826992,0.0002882228,0.00005474585,0.0002912169,0.00007281966],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000952761,"about_ca_system_score_gemma":0.00005506534,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001065988,"about_ca_topic_score_gemma":0.000001077475,"domain_scores_codex":[0.9979984,0.0001805228,0.0005561952,0.0003346549,0.0005650908,0.0003652088],"domain_scores_gemma":[0.9974687,0.001285977,0.0003562991,0.0001834412,0.0005193409,0.0001862773],"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.0001698641,0.0005505549,0.00004674034,0.000214965,0.0001519482,0.00003001091,0.004312737,0.003053176,0.08411982,0.1020846,0.05435299,0.7509126],"study_design_scores_gemma":[0.0007484399,0.0002802744,0.004983052,0.00007965298,0.00003578885,0.0002303975,0.0002573061,0.6836417,0.001181002,0.3079171,0.0003737532,0.0002714554],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1208889,0.00001042286,0.8758246,0.0004895917,0.00217817,0.000328115,0.0000190733,0.00005099484,0.0002100526],"genre_scores_gemma":[0.3141891,1.282777e-7,0.6843338,0.00003745932,0.0006956821,0.000004397856,0.00001027265,0.00001938205,0.0007097914],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7506412,"threshold_uncertainty_score":0.9463238,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2014845799","doi":"10.1137/110827624","title":"Developing Finite Element Methods for Maxwell's Equations in a Cole–Cole Dispersive Medium","year":2011,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Electromagnetic Simulation and Numerical Methods","field":"Engineering","cited_by":74,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; National Science Foundation","keywords":"Mathematics; Finite element method; Maxwell's equations; Fractional calculus; Domain (mathematical analysis); Stability (learning theory); Applied mathematics; Numerical analysis; Mathematical physics; Calculus (dental); Mathematical analysis; Physics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.08855944263706889,"gpt":0.3760053950160442,"spread":0.2874459523789754,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003222339,0.0001563872,0.0002276783,0.0004193603,0.0003262125,0.0001581169,0.0002470693,0.00005302607,0.0001370408],"category_scores_gemma":[0.0007165105,0.0001497573,0.0001020198,0.0008082544,0.00004965187,0.00009155704,0.00004234788,0.0003049193,0.00001179296],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002300182,"about_ca_system_score_gemma":0.00009908581,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002012589,"about_ca_topic_score_gemma":0.000005270776,"domain_scores_codex":[0.9982542,0.0002254015,0.0005738827,0.000246094,0.0002356566,0.0004647623],"domain_scores_gemma":[0.9979681,0.001454347,0.0001249027,0.0001553381,0.0001536646,0.0001436682],"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.00006321349,0.0001498441,0.0004382195,0.00008340301,0.00009222895,0.00001686817,0.008364939,0.3344382,0.01180474,0.00750122,0.000647803,0.6363993],"study_design_scores_gemma":[0.000668934,0.0001510711,0.001321875,0.0001393015,0.00001440909,0.000009273746,0.0003541113,0.9709856,0.008508425,0.004353645,0.01324834,0.0002450123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01761073,0.0001469784,0.9781873,0.0001704872,0.0021617,0.0002843418,0.000001733351,0.00006265677,0.001374093],"genre_scores_gemma":[0.3442737,0.000004822884,0.6553584,0.00009921069,0.0001083768,0.000006843093,0.000005049264,0.00002097036,0.0001226878],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6365474,"threshold_uncertainty_score":0.6106926,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2176519845","doi":"10.1137/15m1014917","title":"High-Order Implicit Time-Marching Methods Based on Generalized Summation-By-Parts Operators","year":2015,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":70,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"University of Toronto","keywords":"Mathematics; Superconvergence; Runge–Kutta methods; Discretization; Summation by parts; Diagonal; Applied mathematics; Norm (philosophy); Quadrature (astronomy); Stability (learning theory); Nonlinear system; Connection (principal bundle); Numerical analysis; Mathematical analysis; Finite element method; Geometry; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.09242473439973269,"gpt":0.4196684032402055,"spread":0.3272436688404728,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.009587479,0.0003363752,0.0005657737,0.0005278047,0.001064828,0.001070137,0.0005810001,0.00009883989,0.0002658627],"category_scores_gemma":[0.005331995,0.0002745463,0.0002182284,0.001146426,0.0001249283,0.000154094,0.0001367454,0.0006955895,0.0001774231],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002893492,"about_ca_system_score_gemma":0.0002731078,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001102177,"about_ca_topic_score_gemma":0.000001150112,"domain_scores_codex":[0.9944101,0.002186334,0.001003399,0.0005657873,0.001213353,0.0006210447],"domain_scores_gemma":[0.994892,0.002702263,0.0006083587,0.0006047437,0.0006230592,0.000569584],"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.0002657856,0.002011971,0.0002983797,0.0001108807,0.0003327987,0.00004564498,0.003378944,0.2372904,0.0840149,0.03547724,0.06331605,0.573457],"study_design_scores_gemma":[0.002292022,0.0003491415,0.00007500006,0.0003221599,0.00009186574,0.0000299231,0.000118514,0.75793,0.01480621,0.2141623,0.009135795,0.0006870888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2355993,0.00002041558,0.7598944,0.0006759019,0.002765344,0.0002599755,0.00001169777,0.0001158545,0.0006571942],"genre_scores_gemma":[0.1420514,3.385719e-7,0.8563549,0.0003174383,0.0003833546,0.000004309325,0.00002261208,0.00006412002,0.0008015484],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5727699,"threshold_uncertainty_score":0.9999707,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2106833662","doi":"10.1137/s1064827599353865","title":"Residual Replacement Strategies for Krylov Subspace Iterative Methods for the Convergence of True Residuals","year":2000,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; McKnight Foundation","keywords":"Residual; Krylov subspace; Mathematics; Generalized minimal residual method; Subspace topology; Convergence (economics); Method of mean weighted residuals; Applied mathematics; Computation; Mathematical optimization; Iterative method; Algorithm; Finite element method; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.03886730709429653,"gpt":0.3721906244394505,"spread":0.333323317345154,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.01137565,0.0002049652,0.0003109916,0.0001736327,0.001492288,0.001339528,0.001421915,0.00005122721,0.0001093372],"category_scores_gemma":[0.0003014887,0.0001391057,0.0002161776,0.0006164938,0.0002383672,0.0004947927,0.0001225852,0.0002577509,0.000007679019],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004431829,"about_ca_system_score_gemma":0.0003108921,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002008267,"about_ca_topic_score_gemma":0.000001458388,"domain_scores_codex":[0.9972076,0.0005548925,0.0007234143,0.0005550231,0.0004707669,0.0004883427],"domain_scores_gemma":[0.9948448,0.003380402,0.0005071042,0.0006684547,0.0004829571,0.0001162688],"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.0005679975,0.0002296583,0.00003042666,0.0001114148,0.0001938558,0.000007720773,0.01580085,0.03838886,0.005470497,0.3796498,0.01279884,0.5467501],"study_design_scores_gemma":[0.002103071,0.001456302,0.0002431294,0.0003476554,0.00005741687,0.0001517821,0.002972359,0.7613063,0.04063052,0.1146372,0.07553747,0.0005568432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0376736,0.0004116692,0.9571561,0.00123438,0.002343352,0.0005958209,0.00001351462,0.00003916748,0.0005324468],"genre_scores_gemma":[0.3415494,0.00002525591,0.6521518,0.0002297794,0.0006138051,0.00001860003,0.00000364327,0.0000219093,0.005385797],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7229174,"threshold_uncertainty_score":0.9998077,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2160460946","doi":"10.1137/050628271","title":"Linear PDEs and Numerical Methods That Preserve a Multisymplectic Conservation Law","year":2006,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":57,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Conservation law; Discretization; Numerical analysis; Symplectic geometry; Hamiltonian (control theory); Mathematical analysis; Midpoint; Mathematical physics; Applied mathematics; Geometry; Mathematical optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.159771112184773,"gpt":0.4412748474291445,"spread":0.2815037352443716,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00381562,0.0002114745,0.0003688502,0.0002171996,0.001112799,0.0007005354,0.0002561651,0.00007916058,0.00006562551],"category_scores_gemma":[0.001836277,0.0001757219,0.0001518591,0.0005791034,0.0002544931,0.0002307925,0.0001460473,0.0004984875,0.00001442768],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008878778,"about_ca_system_score_gemma":0.00005313424,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001019657,"about_ca_topic_score_gemma":0.00002246013,"domain_scores_codex":[0.9968997,0.001023449,0.0006400502,0.0004172043,0.0005977136,0.0004218367],"domain_scores_gemma":[0.9952237,0.003554198,0.0004879923,0.0003014611,0.000257813,0.0001748201],"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.0001916941,0.001968445,0.007867507,0.0003817168,0.0003087302,0.00008811888,0.002910175,0.002975291,0.05539143,0.6506351,0.006446643,0.2708351],"study_design_scores_gemma":[0.0007988614,0.0001455547,0.003082401,0.0002004886,0.00008314845,0.0001959895,0.0001239143,0.2097918,0.00698551,0.7702862,0.007955926,0.0003501931],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1804121,0.00007003907,0.8167559,0.0007421012,0.001080887,0.000200076,0.000003206491,0.00008561037,0.000650099],"genre_scores_gemma":[0.3725928,6.023297e-7,0.626723,0.0001067452,0.0002215247,0.000001682843,0.00000319129,0.00002321388,0.0003273051],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.270485,"threshold_uncertainty_score":0.8558862,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2085378537","doi":"10.1137/060661673","title":"A Preconditioner for Linear Systems Arising From Interior Point Optimization Methods","year":2007,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":48,"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":"Preconditioner; Interior point method; Mathematics; Saddle point; Linear system; Applied mathematics; Eigenvalues and eigenvectors; Mathematical optimization; Matrix (chemical analysis); Iterated function; Condition number; Quadratic programming; Algorithm; Mathematical analysis; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.03157416437652139,"gpt":0.346956663709278,"spread":0.3153824993327566,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0107278,0.0001715216,0.0002521182,0.0004185877,0.001023332,0.00192854,0.0007800976,0.00007005836,0.00003289561],"category_scores_gemma":[0.0003166979,0.0001480784,0.0001686036,0.0005660658,0.0000648505,0.0006116258,0.0001755421,0.0003187554,0.00002089516],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001180021,"about_ca_system_score_gemma":0.00007949211,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002630906,"about_ca_topic_score_gemma":4.575685e-7,"domain_scores_codex":[0.9976252,0.0003025075,0.0007378832,0.0005135512,0.0003772707,0.0004436407],"domain_scores_gemma":[0.9974772,0.001025602,0.0005417365,0.0003954697,0.0003555835,0.0002044178],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007071536,0.0001503743,0.00003003606,0.00005364986,0.00009935597,0.00005338939,0.003921534,0.6136011,0.007519483,0.02335756,0.001316302,0.3498265],"study_design_scores_gemma":[0.0004101945,0.00008631442,0.00002913111,0.0002448923,0.000009627395,0.0001282311,0.0002264396,0.9860902,0.004574026,0.003997607,0.004013138,0.0001901409],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01227916,0.0001374578,0.9758739,0.000161979,0.01082436,0.0002403304,0.000006422286,0.0001075891,0.0003688438],"genre_scores_gemma":[0.143723,0.000001019725,0.8548165,0.0001055225,0.001003275,0.000001199987,0.000008931697,0.00001462411,0.0003259889],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3724892,"threshold_uncertainty_score":0.9991075,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2227807233","doi":"10.1137/151006135","title":"Monolithic Multigrid Methods for Two-Dimensional Resistive Magnetohydrodynamics","year":2016,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":48,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Multigrid method; Discretization; Relaxation (psychology); Magnetohydrodynamics; Generalized minimal residual method; Nonlinear system; Applied mathematics; Linearization; Mathematics; Context (archaeology); Partial differential equation; Linear system; Mathematical analysis; Physics; Plasma","retraction":null,"screen_n_in":null,"score":{"opus":0.03635446335569643,"gpt":0.3860100489176223,"spread":0.3496555855619258,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003107438,0.0002407391,0.000321139,0.0003007568,0.0004774941,0.0001655907,0.0003523127,0.00006112482,0.00002584475],"category_scores_gemma":[0.00183929,0.0001726296,0.0001788157,0.0004213616,0.0001625624,0.0001608052,0.00008490597,0.0003198123,0.00003876575],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002760266,"about_ca_system_score_gemma":0.0000543673,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.205207e-7,"about_ca_topic_score_gemma":1.470226e-7,"domain_scores_codex":[0.9978677,0.0002181425,0.0006523627,0.0003695825,0.0004094892,0.0004827152],"domain_scores_gemma":[0.9929399,0.005994517,0.0002194382,0.0002715554,0.0003654707,0.0002090638],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000241705,0.00003257972,0.000009512422,0.00003458785,0.00003720165,0.000005216014,0.0001022436,0.5727387,0.02335953,0.003855859,0.0003749503,0.3994255],"study_design_scores_gemma":[0.0006339703,0.00006762426,0.0001001851,0.0002628349,0.00001418421,0.00007887826,0.00001339569,0.8931193,0.004150662,0.09918325,0.002124869,0.0002507869],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04048227,0.0001647464,0.9540233,0.0001777875,0.004408901,0.0002127359,0.00001297305,0.0001808853,0.0003364266],"genre_scores_gemma":[0.1466439,0.000001597039,0.852658,0.00004557491,0.0003649454,0.000003812496,0.000001772517,0.00004784771,0.0002325306],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3991747,"threshold_uncertainty_score":0.703963,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2914454439","doi":"10.1137/17m1144982","title":"Parallel-In-Time Multigrid with Adaptive Spatial Coarsening for The Linear Advection and Inviscid Burgers Equations","year":2019,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":44,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland; Red Deer Polytechnic","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada; Lawrence Livermore National Laboratory; U.S. Department of Energy","keywords":"Inviscid flow; Multigrid method; Burgers' equation; Mathematics; Applied mathematics; Advection; Partial differential equation; Convergence (economics); Courant–Friedrichs–Lewy condition; Mathematical analysis; Discretization; Mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.03008830386048813,"gpt":0.2946707038787769,"spread":0.2645824000182888,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001244355,0.000140171,0.0001937683,0.0001749479,0.0003608351,0.0001672333,0.0001560297,0.00003315898,0.0000104319],"category_scores_gemma":[0.0003099844,0.0001001725,0.00005187186,0.0003663347,0.00008537226,0.0001378926,0.00003744896,0.0003526028,0.00001624554],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009132503,"about_ca_system_score_gemma":0.00002570976,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001324532,"about_ca_topic_score_gemma":0.000001961973,"domain_scores_codex":[0.9987666,0.00006205804,0.0003427169,0.0002141142,0.0003637054,0.0002508119],"domain_scores_gemma":[0.9962478,0.003270604,0.0001529094,0.0001321096,0.0001259944,0.00007057309],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003369333,0.00001480638,0.0001363942,0.00001566262,0.00002072096,0.000001797995,0.0004783738,0.9686072,0.0005417233,0.0002397899,0.00002756588,0.0298823],"study_design_scores_gemma":[0.0005016137,0.0001026341,0.0005244521,0.0001938156,0.00001050815,0.00003073629,0.0002190103,0.9959509,0.0001601156,0.001821552,0.0003509023,0.000133742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1262245,0.00005901626,0.8721634,0.00008354029,0.001014998,0.0003292019,0.000002345174,0.00004937227,0.00007359657],"genre_scores_gemma":[0.6396599,0.000002043534,0.3600894,0.0000191812,0.00015242,0.000003352989,0.000001441029,0.00002078027,0.0000514806],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5134354,"threshold_uncertainty_score":0.4084917,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1984539292","doi":"10.1137/120861187","title":"Invariant Discretization Schemes for the Shallow-Water Equations","year":2012,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Computational Fluid Dynamics and Aerodynamics","field":"Engineering","cited_by":43,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"Austrian Science Fund","keywords":"Discretization; Invariant (physics); Shallow water equations; Mathematics; Grid; Finite volume method; Finite difference; Waves and shallow water; Finite difference method; Mathematical analysis; Applied mathematics; Geometry; Mechanics; Physics; Mathematical physics","retraction":null,"screen_n_in":null,"score":{"opus":0.0208119650432684,"gpt":0.2528370052629474,"spread":0.232025040219679,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001389748,0.000112176,0.00009149827,0.0001233442,0.0008946682,0.0005495685,0.0002124215,0.00002966665,0.00003035047],"category_scores_gemma":[0.00009877956,0.00007055398,0.00009701244,0.0002098704,0.00004133199,0.0002026288,0.00004843585,0.0001902749,0.00003749383],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008676897,"about_ca_system_score_gemma":0.00002156416,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.192961e-7,"about_ca_topic_score_gemma":0.000003834603,"domain_scores_codex":[0.9989152,0.00002356502,0.0002936195,0.0001154163,0.0002926633,0.0003595261],"domain_scores_gemma":[0.9991615,0.0004144811,0.00004659684,0.0001415723,0.0001405762,0.00009526623],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003465311,0.00003034298,0.0002574075,0.00001293361,0.00004047079,5.248867e-7,0.0007772855,0.9352041,0.00307917,0.04860548,0.0004621032,0.0115267],"study_design_scores_gemma":[0.000151032,0.000009921362,0.0009113114,0.00003101924,0.00001385858,0.00001541932,0.00007858918,0.9880797,0.0001113427,0.001155692,0.009333072,0.0001090518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1875255,0.0001608954,0.8079552,0.0003999933,0.003546494,0.0001372038,0.000007259564,0.0000513619,0.0002160686],"genre_scores_gemma":[0.9953774,0.000004260394,0.003717667,0.00004436508,0.0006129634,0.000002400925,0.00003958129,0.00002147125,0.0001798532],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8078519,"threshold_uncertainty_score":0.6881155,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1963803444","doi":"10.1137/s1064827501387358","title":"Multigrid Preconditioning for Krylov Methods for Time-Harmonic Maxwell's Equations in Three Dimensions","year":2002,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Electromagnetic Scattering and Analysis","field":"Physics and Astronomy","cited_by":42,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Multigrid method; Preconditioner; Mathematics; Discretization; Solver; Applied mathematics; Condition number; Mathematical analysis; Eigenvalues and eigenvectors; Richardson extrapolation; Numerical analysis; Mathematical optimization; Linear system; Partial differential equation; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.03987141517321419,"gpt":0.3360985751864164,"spread":0.2962271600132022,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001553532,0.0001422901,0.0002295796,0.0003288697,0.001016903,0.0004148588,0.0002121743,0.00002661201,0.0004677316],"category_scores_gemma":[0.00009597915,0.000134313,0.0002696888,0.0004336115,0.00004725987,0.0001003438,0.00003484363,0.0002357822,0.00003580706],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004960209,"about_ca_system_score_gemma":0.00003309116,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004419231,"about_ca_topic_score_gemma":0.000002220399,"domain_scores_codex":[0.9985219,0.0000918708,0.0004513123,0.0003461244,0.0001468924,0.0004418647],"domain_scores_gemma":[0.9982176,0.001080451,0.0002488544,0.0001953407,0.0001516881,0.0001060177],"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.0000212503,0.0007183483,0.002739254,0.00002673402,0.0002740834,0.00000155562,0.00134238,0.06458139,0.05753378,0.004365991,0.006163623,0.8622316],"study_design_scores_gemma":[0.0008662373,0.0001327389,0.0006066933,0.0001245592,0.00006118404,0.00000411992,0.00008765847,0.9835641,0.002068028,0.01033515,0.001942636,0.0002068526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2948889,0.000118116,0.7033132,0.0004037614,0.0005198667,0.0002524279,0.00001642523,0.00001955764,0.0004676984],"genre_scores_gemma":[0.9010838,5.779784e-7,0.09684812,0.00002824794,0.0003636905,0.00001563737,0.00004000012,0.00001801958,0.001601903],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9189827,"threshold_uncertainty_score":0.7821299,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2165991720","doi":"10.1137/130918629","title":"3D Frequency-Domain Seismic Inversion with Controlled Sloppiness","year":2014,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Seismic Imaging and Inversion Techniques","field":"Earth and Planetary Sciences","cited_by":37,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Petrobras; BG Group; ConocoPhillips","keywords":"Solver; Seismic inversion; Inversion (geology); Inverse problem; Helmholtz equation; Mathematical optimization; Algorithm; Computer science; Optimization problem; Mathematics; Mathematical analysis; Geometry; Geology","retraction":null,"screen_n_in":null,"score":{"opus":0.01032736711773713,"gpt":0.2099150970116178,"spread":0.1995877298938806,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003205531,0.0002094449,0.0003410685,0.0004213378,0.001216082,0.0006645708,0.0004760129,0.00005678632,0.0005251279],"category_scores_gemma":[0.0001336287,0.000138842,0.0001139315,0.0005461418,0.0002548379,0.000292815,0.00002197068,0.0004677974,0.0003114071],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002251996,"about_ca_system_score_gemma":0.00011705,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001355308,"about_ca_topic_score_gemma":0.00001024911,"domain_scores_codex":[0.997632,0.0003090293,0.0004063447,0.0004129972,0.0007548881,0.0004847141],"domain_scores_gemma":[0.998633,0.000294526,0.0003476815,0.0002857409,0.0001914244,0.0002475846],"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.0009924468,0.0001717564,0.08032053,0.00007522875,0.0001485199,0.0002533158,0.002221099,0.04413413,0.001379572,0.001051813,0.09294412,0.7763075],"study_design_scores_gemma":[0.003930883,0.0005982365,0.003915776,0.0004251526,0.00002652173,0.0004283024,0.0005212867,0.9174551,0.0004225782,0.006301103,0.06550259,0.0004724712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9021319,0.0001151209,0.06369844,0.001531336,0.002806853,0.0002089652,0.000004702359,0.0001767264,0.02932594],"genre_scores_gemma":[0.9813925,0.000004548359,0.01571011,0.002078001,0.0003093001,1.545567e-7,0.00001525666,0.000006714362,0.0004834033],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.873321,"threshold_uncertainty_score":0.935324,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963727569","doi":"10.1137/140961894","title":"On Discrete Least-Squares Projection in Unbounded Domain with Random Evaluations and its Application to Parametric Uncertainty Quantification","year":2014,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Probabilistic and Robust Engineering Design","field":"Decision Sciences","cited_by":34,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Laguerre polynomials; Applied mathematics; Projection (relational algebra); Hermite polynomials; Parametric statistics; Bounded function; Scaling; Mathematical analysis; Mathematical optimization; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.06176393128735426,"gpt":0.3656642423130614,"spread":0.3039003110257072,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.01564485,0.0001803128,0.0002876429,0.001512707,0.0008068496,0.001111188,0.0004131582,0.00005946295,0.00001096967],"category_scores_gemma":[0.009452106,0.0001198911,0.00005570088,0.003441039,0.0000943309,0.0002117419,0.00004849979,0.0003256788,0.00009238646],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001894207,"about_ca_system_score_gemma":0.000128775,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007156313,"about_ca_topic_score_gemma":0.00002842369,"domain_scores_codex":[0.9959559,0.0006085823,0.000752444,0.0007345418,0.001627143,0.0003214058],"domain_scores_gemma":[0.9954796,0.002645046,0.000408428,0.0004434447,0.0008272266,0.0001962708],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002200013,0.00007081854,0.0003293695,0.000006633705,0.00000620116,9.32854e-7,0.0005648739,0.9351986,0.0008501949,0.01484077,0.000277753,0.04763384],"study_design_scores_gemma":[0.001288051,0.0003466599,0.009390211,0.0001678311,0.00001011772,0.00002270422,0.0003511037,0.9615502,0.0001453731,0.02512525,0.001397578,0.0002049402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4299371,0.00002159303,0.5684692,0.0003874409,0.0005131304,0.0004702876,0.000001713552,0.00002429698,0.0001752398],"genre_scores_gemma":[0.9957659,0.000001019326,0.003863725,0.00004694987,0.0001237296,0.00001483813,0.00000435958,0.00001176589,0.0001677205],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5658288,"threshold_uncertainty_score":0.9999257,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2993140656","doi":"10.1137/18m1202980","title":"Linkage Between Piecewise Constant Mumford--Shah Model and Rudin--Osher--Fatemi Model and Its Virtue in Image Segmentation","year":2019,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Medical Image Segmentation Techniques","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":"Toronto Metropolitan University","funders":"Sorbonne Université; Chinese University of Hong Kong; Research Grants Council, University Grants Committee; National Natural Science Foundation of China; Engineering and Physical Sciences Research Council; Isaac Newton Trust; Leverhulme Trust; Alan Turing Institute; City University of Hong Kong","keywords":"Piecewise; Segmentation; Thresholding; Image segmentation; Artificial intelligence; Image (mathematics); Mathematics; Pattern recognition (psychology); Scale-space segmentation; Computer science; Segmentation-based object categorization; Computer vision; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.02891299508146226,"gpt":0.3070549716424625,"spread":0.2781419765610003,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.003308808,0.0002585992,0.0003656148,0.0006064635,0.0003944674,0.001330174,0.0006417634,0.0000960393,0.00001436618],"category_scores_gemma":[0.0001337578,0.0002373263,0.00006225426,0.00061762,0.0001970028,0.001440162,0.0004946514,0.0006423887,0.00002966756],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001660579,"about_ca_system_score_gemma":0.0001956166,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000237121,"about_ca_topic_score_gemma":0.000002291521,"domain_scores_codex":[0.9968629,0.0001810693,0.000821245,0.0007693376,0.000883084,0.0004823763],"domain_scores_gemma":[0.998364,0.0002728467,0.0004359164,0.0003549797,0.0002154975,0.0003567022],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005785664,0.0003834876,0.006486613,0.000378755,0.00008396154,0.0002112666,0.01438061,0.0652727,0.589435,0.01273712,0.002139895,0.3084328],"study_design_scores_gemma":[0.0009472515,0.00008749632,0.0003864706,0.0003274092,0.000007796818,0.00005271578,0.0001981244,0.9791988,0.01394032,0.004585726,0.000008393195,0.0002595229],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4779713,0.00009420693,0.5206736,0.000259666,0.0002496367,0.0002792627,0.00000555559,0.0000735729,0.0003931462],"genre_scores_gemma":[0.8541795,0.00002874711,0.1451647,0.0002760599,0.00004827105,0.00000227504,0.000005099676,0.0000162081,0.0002791231],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9139261,"threshold_uncertainty_score":0.9997066,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1988929312","doi":"10.1137/120898693","title":"Two-Step Approach for the Restoration of Images Corrupted by Multiplicative Noise","year":2013,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"Lanzhou University","keywords":"Multiplicative noise; Mathematics; Image restoration; Regularization (linguistics); Multiplicative function; Noise (video); Algorithm; Regular polygon; Fidelity; Noise reduction; Image processing; Mathematical optimization; Applied mathematics; Image (mathematics); Computer science; Computer vision; Artificial intelligence; Mathematical analysis; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.03550584173784856,"gpt":0.313909258482956,"spread":0.2784034167451074,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.003986202,0.0001546285,0.0002146509,0.0001823973,0.001051903,0.001394623,0.001285797,0.00003763134,0.000007215501],"category_scores_gemma":[0.0004210861,0.0001019557,0.00014926,0.0007133146,0.0002085783,0.0005689759,0.0001810764,0.0003057274,0.00001720863],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005353737,"about_ca_system_score_gemma":0.00009974394,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001689459,"about_ca_topic_score_gemma":2.34042e-7,"domain_scores_codex":[0.9978172,0.0003421239,0.0005122175,0.0004195146,0.0005675657,0.000341342],"domain_scores_gemma":[0.9967185,0.001161492,0.000571947,0.0005683338,0.0008716526,0.0001080568],"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.00005126901,0.0003106688,0.000122509,0.00003523735,0.00006330688,0.000002844619,0.002710713,0.01768622,0.324377,0.003225358,0.08072749,0.5706874],"study_design_scores_gemma":[0.0008653524,0.0001096492,0.0006115161,0.00004085492,0.00001089492,0.00003917253,0.0002255677,0.9700109,0.02545064,0.0007222459,0.001761662,0.0001515723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01110724,0.0002865499,0.9855425,0.0006606001,0.001116568,0.0004818046,0.000003910971,0.00003956071,0.0007613025],"genre_scores_gemma":[0.5544414,0.000002152067,0.444467,0.0001644915,0.0001455982,0.000007442079,0.000003976917,0.00001032327,0.0007576111],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9523246,"threshold_uncertainty_score":0.999642,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3120401416","doi":"10.1137/21m1389742","title":"Fast Solution of Fully Implicit Runge--Kutta and Discontinuous Galerkin in Time for Numerical PDEs, Part I: the Linear Setting","year":2022,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":26,"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":"Los Alamos National Laboratory; Australian Government; Lawrence Livermore National Laboratory; U.S. Department of Energy","keywords":"Mathematics; Discretization; Preconditioner; Discontinuous Galerkin method; Runge–Kutta methods; Backward Euler method; Applied mathematics; Finite element method; Temporal discretization; Numerical analysis; Degree of a polynomial; Linear system; Mathematical optimization; Polynomial; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.02112652923475414,"gpt":0.2977136091493022,"spread":0.2765870799145481,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002955491,0.0001438021,0.0002707318,0.000170894,0.0005948496,0.0001164971,0.0003379687,0.00002480731,0.00002117466],"category_scores_gemma":[0.0003444828,0.0001197198,0.00009021931,0.0005390044,0.00009146663,0.00007895683,0.0002101682,0.0005094322,0.000002701797],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001320513,"about_ca_system_score_gemma":0.00003310428,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.119533e-7,"about_ca_topic_score_gemma":1.812402e-7,"domain_scores_codex":[0.9981188,0.0001797481,0.0006393599,0.0002299687,0.0004928334,0.0003392514],"domain_scores_gemma":[0.9979199,0.001503866,0.0002598575,0.0001685469,0.00007814908,0.00006973414],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000223589,0.00006018817,0.0001687319,0.00005186109,0.00002334143,0.000004852131,0.0007169908,0.9243998,0.003591339,0.0003988571,0.000656564,0.06990514],"study_design_scores_gemma":[0.0003108078,0.00009741825,0.0004852868,0.0001023528,0.00001165169,0.0001232351,0.0002217228,0.9891981,0.0002412781,0.006270855,0.002796029,0.0001412398],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2352885,0.0002503298,0.7626656,0.0002619507,0.001081273,0.0002814171,0.00002230736,0.00004832253,0.0001002913],"genre_scores_gemma":[0.7839061,0.000002214136,0.2156533,0.00004403958,0.0002578702,0.000009358635,0.00000643479,0.00003622941,0.00008441559],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5486176,"threshold_uncertainty_score":0.4882031,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2288584783","doi":"10.1137/15m1034283","title":"Low-Rank Spectral Optimization via Gauge Duality","year":2016,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Advanced X-ray Imaging Techniques","field":"Physics and Astronomy","cited_by":26,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Duality (order theory); Mathematical optimization; Rank (graph theory); Eigenvalues and eigenvectors; Low-rank approximation; Optimization problem; Hermitian matrix; Applied mathematics; Computation; Operator (biology); Deconvolution; Preconditioner; Range (aeronautics); Matrix completion; Algorithm; Iterative method; Mathematical analysis; Discrete mathematics; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01296599159956027,"gpt":0.2870939178588247,"spread":0.2741279262592644,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001107449,0.0001681359,0.0001807192,0.0001671708,0.0005850386,0.0003649103,0.0003214423,0.00002267758,0.0004657814],"category_scores_gemma":[0.00003323314,0.0001206243,0.0001373784,0.0003013737,0.0001439758,0.0003485711,0.00009156478,0.0002612273,0.0000768721],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001000126,"about_ca_system_score_gemma":0.00006419265,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002856031,"about_ca_topic_score_gemma":1.853193e-7,"domain_scores_codex":[0.9983124,0.0000999162,0.0004100624,0.0003609764,0.0003946292,0.0004220795],"domain_scores_gemma":[0.9988812,0.0001199809,0.0003386444,0.0003166012,0.0001969408,0.000146639],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00009305253,0.0008505794,0.02665096,0.00002836174,0.0001414135,0.00005191331,0.0009676167,0.06762713,0.08488347,0.03289805,0.01172861,0.7740788],"study_design_scores_gemma":[0.006181564,0.0004785549,0.01000101,0.003095258,0.0001151901,0.0002509782,0.0004750343,0.2461261,0.3995542,0.3024674,0.02814986,0.003104786],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1599077,0.000008714922,0.8361076,0.0004188459,0.001108556,0.00009039803,0.000008422378,0.0001002304,0.002249585],"genre_scores_gemma":[0.9482131,6.267679e-7,0.05048372,0.00003658254,0.0007129727,6.590249e-7,0.000005010785,0.00001967044,0.0005276483],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7883055,"threshold_uncertainty_score":0.509998,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3124030041","doi":"10.1137/20m1347139","title":"On the Asymptotic Linear Convergence Speed of Anderson Acceleration, Nesterov Acceleration, and Nonlinear GMRES","year":2021,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Generalized minimal residual method; Acceleration; Mathematics; Convergence (economics); Nonlinear system; Applied mathematics; Mathematical analysis; Linear system; Classical mechanics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.03221747664019337,"gpt":0.2748762159755561,"spread":0.2426587393353627,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002289152,0.0001592615,0.000204901,0.0001556785,0.001046142,0.001674109,0.0007167415,0.00004411956,0.00008224005],"category_scores_gemma":[0.0003977327,0.0001130905,0.00008596868,0.0007892195,0.0001557774,0.0006502728,0.0002279912,0.0003446962,0.00002391635],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002556061,"about_ca_system_score_gemma":0.0002008389,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.497607e-7,"about_ca_topic_score_gemma":0.000001373442,"domain_scores_codex":[0.997846,0.0003240933,0.0005015735,0.0004449405,0.0006116937,0.0002716752],"domain_scores_gemma":[0.9978744,0.0006421878,0.0003451716,0.0004827981,0.0005307322,0.0001247151],"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.0001413554,0.001281891,0.003634546,0.0002327357,0.0002611607,0.0004449595,0.01663701,0.06762701,0.06451441,0.7177231,0.0080969,0.1194049],"study_design_scores_gemma":[0.000639535,0.0002101105,0.001692505,0.0002669639,0.00001231545,0.0003262549,0.0004053747,0.9365492,0.05045242,0.00765072,0.001522451,0.0002721064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7865238,0.0001248717,0.2081736,0.002294004,0.002345078,0.0001150157,0.000001756596,0.00003213266,0.0003897226],"genre_scores_gemma":[0.9899399,0.0000145923,0.008673548,0.0004669495,0.000287505,2.529843e-7,0.000002520306,0.000007982078,0.0006067152],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8689222,"threshold_uncertainty_score":0.9993622,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2012349161","doi":"10.1137/090753589","title":"Algebraic Multigrid for Markov Chains","year":2010,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Multigrid method; Markov chain; Interpolation (computer graphics); Applied mathematics; Algebraic number; Multiplicative function; Operator (biology); Matrix (chemical analysis); Invertible matrix; Pure mathematics; Mathematical analysis; Partial differential equation; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01425054654782819,"gpt":0.272168993584458,"spread":0.2579184470366297,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004780584,0.0001945734,0.0002123056,0.0003598706,0.001547011,0.001840007,0.001692737,0.00007132372,0.00005960876],"category_scores_gemma":[0.0003567924,0.0001618438,0.00023102,0.0006149169,0.0001368058,0.0004167614,0.0002642045,0.0007098492,0.00009795171],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002928019,"about_ca_system_score_gemma":0.0001438274,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.665993e-7,"about_ca_topic_score_gemma":0.000002463135,"domain_scores_codex":[0.9977367,0.0001009632,0.0004496681,0.0005685256,0.0005323633,0.0006118034],"domain_scores_gemma":[0.9979571,0.0005204087,0.0003080643,0.0006361778,0.0002741055,0.0003041279],"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.00002514728,0.0002318316,0.0001059513,0.0000312416,0.00003341128,0.00006209395,0.001474747,0.00068797,0.0217612,0.2831781,0.008580769,0.6838276],"study_design_scores_gemma":[0.001214103,0.0001943957,0.0006197972,0.00009799923,0.000008538812,0.0006026034,0.00007486477,0.8620673,0.007671614,0.02347462,0.1034716,0.000502551],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2241933,0.00003699302,0.7555043,0.001102192,0.01751266,0.000225808,0.000004468473,0.0001454819,0.001274829],"genre_scores_gemma":[0.8407757,0.000001020651,0.1550417,0.0003174256,0.001445349,0.000001973987,0.000002172366,0.00001643459,0.002398273],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8613794,"threshold_uncertainty_score":0.9997528,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1089797291","doi":"10.1137/14098973x","title":"A Proximal Gradient Method for Ensemble Density Functional Theory","year":2015,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Advanced Chemical Physics Studies","field":"Physics and Astronomy","cited_by":25,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Applied mathematics; Energy functional; Orthogonality; Convergence (economics); Hamiltonian (control theory); Density functional theory; Mathematical optimization; Mathematical analysis; Computational chemistry; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.04703411189109327,"gpt":0.3177492312264607,"spread":0.2707151193353675,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001714498,0.0001541141,0.0002126368,0.0000722081,0.0007409445,0.0001959183,0.0001640953,0.00001755691,0.0000162717],"category_scores_gemma":[0.00008160642,0.0001274872,0.0001853577,0.0002084675,0.00009670891,0.0001184796,0.0001222761,0.0002895141,0.0000273575],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009714458,"about_ca_system_score_gemma":0.0001100683,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001087643,"about_ca_topic_score_gemma":2.170065e-7,"domain_scores_codex":[0.9985397,0.00008155785,0.0002764288,0.0003368995,0.0003846036,0.0003808488],"domain_scores_gemma":[0.9985206,0.0003851226,0.0002329868,0.0001658761,0.0004905353,0.0002048912],"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.0007496053,0.001217997,0.00409383,0.00004215686,0.0005932557,0.00001151381,0.005037306,0.07704449,0.04766197,0.5469834,0.05432479,0.2622397],"study_design_scores_gemma":[0.001385452,0.0001312917,0.0002000106,0.00006342703,0.00004465703,0.00001965134,0.001450074,0.01596568,0.03849242,0.9322473,0.009685224,0.000314782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2002111,0.00002866897,0.7946949,0.00009742698,0.001562549,0.0001367778,0.00000591368,0.00002163091,0.0032411],"genre_scores_gemma":[0.9513575,4.800254e-8,0.04632143,0.0000497297,0.001284755,0.000003459051,0.000009302402,0.00001529497,0.0009584872],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7511464,"threshold_uncertainty_score":0.569882,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2345572700","doi":"10.1137/15m1022744","title":"A New Mixed Formulation and Efficient Numerical Solution of Ginzburg--Landau Equations Under the Temporal Gauge","year":2016,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Electromagnetic Simulation and Numerical Methods","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"Research Grants Council, University Grants Committee","keywords":"Mathematics; Curl (programming language); Ode; Galerkin method; Lorenz gauge condition; Ordinary differential equation; Numerical analysis; Finite element method; Discontinuous Galerkin method; Mathematical analysis; Gauge (firearms); Vector field; Maxwell's equations; Sigma; Applied mathematics; Gauge theory; Gauge fixing; Mathematical physics; Differential equation; Physics; Geometry; Quantum mechanics; Gauge boson","retraction":null,"screen_n_in":null,"score":{"opus":0.02668720578115382,"gpt":0.2868048205300324,"spread":0.2601176147488786,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001104694,0.0001033944,0.0001411719,0.0001532717,0.0003090285,0.0001053689,0.0001131383,0.00003807587,0.00007927955],"category_scores_gemma":[0.0001718534,0.00006007127,0.0000676575,0.0004342606,0.0000570669,0.00006331826,0.00002839557,0.0001476052,0.000009062082],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005907335,"about_ca_system_score_gemma":0.00004411953,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004343629,"about_ca_topic_score_gemma":0.00000128159,"domain_scores_codex":[0.9987704,0.0001187596,0.0003750977,0.0001463703,0.000354766,0.0002345785],"domain_scores_gemma":[0.9987013,0.0008177403,0.0001283892,0.0001412567,0.00008780403,0.0001234998],"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.00004891174,0.00007038141,0.000860829,0.00001958966,0.00005277536,0.000002042056,0.000771741,0.2876111,0.07823347,0.01105525,0.003218145,0.6180558],"study_design_scores_gemma":[0.0006028163,0.0001000592,0.01154711,0.00008606409,0.00001402686,0.00002400571,0.0000406502,0.9811975,0.002038012,0.003059196,0.001177443,0.0001131592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3225355,0.0000926949,0.6758122,0.0006319244,0.0006928151,0.00006814319,9.620608e-7,0.00003368548,0.0001320445],"genre_scores_gemma":[0.9877557,0.000002298664,0.0119375,0.00002360368,0.000128254,3.486441e-7,9.383629e-7,0.00001078035,0.0001405431],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6935863,"threshold_uncertainty_score":0.2449635,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2018014435","doi":"10.1137/110855934","title":"An Adaptive Algebraic Multigrid Algorithm for Low-Rank Canonical Tensor Decomposition","year":2013,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Multigrid method; Mathematics; Rank (graph theory); Tensor (intrinsic definition); Algebraic number; Relaxation (psychology); Multiplicative function; Algorithm; Applied mathematics; Mathematical analysis; Pure mathematics; Partial differential equation; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.04218870997084388,"gpt":0.3564629447187452,"spread":0.3142742347479013,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001058155,0.0002313169,0.0003084762,0.0002676421,0.001398628,0.0009285639,0.0004456409,0.00009136057,0.0002339358],"category_scores_gemma":[0.00009350797,0.0002005553,0.0002419572,0.0003472659,0.0001432993,0.0003317512,0.00004576935,0.0004078485,0.0002397808],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001504504,"about_ca_system_score_gemma":0.0001048151,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006087851,"about_ca_topic_score_gemma":0.000004523595,"domain_scores_codex":[0.9976294,0.0001535041,0.0007040057,0.0005100507,0.0004938959,0.0005091309],"domain_scores_gemma":[0.9973146,0.0007082578,0.0004175078,0.0004208635,0.0007408125,0.0003979251],"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.0001290307,0.004188898,0.0001268892,0.00009235957,0.000273143,0.00004005779,0.002665963,0.00351698,0.1173771,0.06714924,0.08725495,0.7171854],"study_design_scores_gemma":[0.001866944,0.0005052668,0.001761998,0.0002725284,0.00006016058,0.0003611442,0.0006400841,0.9292949,0.006919736,0.05500437,0.002761023,0.0005518167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5069178,0.00001691674,0.4904265,0.0006105936,0.0008864495,0.0007113442,0.00003342939,0.0001322684,0.0002646869],"genre_scores_gemma":[0.7027226,8.857851e-7,0.296124,0.0002382537,0.0005549617,0.00002383658,0.00002676689,0.00003411639,0.0002745078],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.925778,"threshold_uncertainty_score":0.9999014,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2989106239","doi":"10.1137/18m121914x","title":"A Mass-Conservative Temporal Second Order and Spatial Fourth Order Characteristic Finite Volume Method for Atmospheric Pollution Advection Diffusion Problems","year":2019,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Wind and Air Flow Studies","field":"Environmental Science","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Fundamental Research Funds for the Central Universities; Natural Science Foundation of Shandong Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Advection; Finite volume method; Discretization; Interpolation (computer graphics); Mathematics; Diffusion; Temporal discretization; Applied mathematics; Meteorology; Mathematical analysis; Mechanics; Computer science; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01135931656728975,"gpt":0.2414831566279344,"spread":0.2301238400606447,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001421232,0.0002157782,0.0002741076,0.00004267458,0.001065696,0.00034722,0.0001511909,0.00006350321,0.0008186791],"category_scores_gemma":[0.0001636304,0.0001740345,0.00008323308,0.0005507576,0.0001401199,0.0002935423,0.0001610191,0.0002799082,0.0001245065],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000146812,"about_ca_system_score_gemma":0.00003857859,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007529422,"about_ca_topic_score_gemma":0.00009582209,"domain_scores_codex":[0.9980932,0.0001348195,0.0004103747,0.0005369542,0.0004065922,0.0004180395],"domain_scores_gemma":[0.999065,0.0001602939,0.0003985885,0.00015285,0.0001011193,0.0001220819],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003933997,0.0004694274,0.4469976,0.0002187766,0.0001750256,0.00001992655,0.009495261,0.08537295,0.1072508,0.00005128682,0.005229872,0.3443257],"study_design_scores_gemma":[0.001062908,0.0003861326,0.1523563,0.0001444381,0.00002290711,0.00003961789,0.0003013827,0.8211662,0.0001332879,0.0004904434,0.02360249,0.0002939002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6698855,0.00002225332,0.3274833,0.0004157958,0.001492957,0.0003726309,0.000009763752,0.00002358369,0.0002942219],"genre_scores_gemma":[0.9436642,0.000002934444,0.04990975,0.000173653,0.0002377938,0.000004815168,0.00001087919,0.00002067823,0.005975308],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7357933,"threshold_uncertainty_score":0.8963962,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2156047522","doi":"10.1137/s1064827501397937","title":"An Orthogonal Transformation Algorithm for GPS Positioning","year":2003,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"GNSS positioning and interference","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Global Positioning System; Algorithm; Position (finance); Integer (computer science); Computer science; Time to first fix; Satellite; GPS/INS; Transformation (genetics); Precise Point Positioning; Kinematics; GPS signals; Mathematics; Assisted GPS; GNSS applications; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01531015823942226,"gpt":0.2597995568880044,"spread":0.2444893986485821,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009839974,0.0001155781,0.0001084644,0.0001948511,0.0007707883,0.0007201378,0.0001370306,0.0000415906,0.00003790777],"category_scores_gemma":[0.00002025442,0.0001137858,0.0000857566,0.0002084515,0.00003213459,0.0003744773,0.000002853487,0.0002543512,0.00002447112],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007602221,"about_ca_system_score_gemma":0.00003323753,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.582555e-7,"about_ca_topic_score_gemma":3.547007e-7,"domain_scores_codex":[0.998946,0.00005022505,0.0003151072,0.000156932,0.0002406577,0.0002911052],"domain_scores_gemma":[0.9994876,0.00005616597,0.00005917908,0.0001099444,0.0001608695,0.0001262492],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001059515,0.0001390217,0.00005373158,0.00004713131,0.0000554923,0.000007152678,0.003573094,0.646837,0.01887176,0.0140314,0.001873743,0.3144999],"study_design_scores_gemma":[0.0003723499,0.0001497345,0.0001764186,0.0001770156,0.000009914367,0.0002532052,0.0002502735,0.9839453,0.01037218,0.0008744166,0.003236247,0.0001830143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.270403,0.00004940345,0.7214797,0.00001600991,0.002158928,0.00007769278,0.000007484477,0.0001037294,0.005704133],"genre_scores_gemma":[0.9760313,0.000001610582,0.02368133,0.00003144273,0.0001645802,0.000001443966,0.00002065536,0.00001624099,0.00005137924],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7056283,"threshold_uncertainty_score":0.6944306,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2999924267","doi":"10.1137/19m1255409","title":"A Scalable Approximate Inverse Block Preconditioner for an Incompressible Magnetohydrodynamics Model Problem","year":2020,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Preconditioner; Discretization; Mathematics; Curl (programming language); Applied mathematics; Finite element method; Compressibility; Inverse; Multigrid method; Mathematical analysis; Mathematical optimization; Iterative method; Partial differential equation; Computer science; Geometry; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.03366435852616984,"gpt":0.267063065870316,"spread":0.2333987073441461,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002016443,0.0002470231,0.0002884296,0.000249884,0.001281223,0.002074402,0.0015326,0.00007261281,0.00001669076],"category_scores_gemma":[0.00005878586,0.0002199836,0.0001671408,0.00081168,0.0001114553,0.00124076,0.0003749607,0.0004297472,0.00004536326],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000624879,"about_ca_system_score_gemma":0.0002196174,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.79358e-7,"about_ca_topic_score_gemma":0.000001142667,"domain_scores_codex":[0.9973175,0.0001531008,0.0005860708,0.0007894496,0.000545175,0.0006086866],"domain_scores_gemma":[0.9982039,0.0001099251,0.000404069,0.0004759655,0.000283215,0.0005229716],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003938302,0.0001770304,0.00001371516,0.0001300958,0.00002314529,0.00001489376,0.002469949,0.9372962,0.004330857,0.03538421,0.005595935,0.01452461],"study_design_scores_gemma":[0.0006701336,0.0002608969,0.000003863299,0.00008725971,0.000009677266,0.00008009422,0.00005005227,0.9546596,0.0008995664,0.04155874,0.001448386,0.0002716889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08540206,0.00003073538,0.9106329,0.001034263,0.0009401804,0.0004204893,0.00001588761,0.0002237066,0.001299754],"genre_scores_gemma":[0.4975919,0.00000150364,0.5002624,0.0008285754,0.0004248858,0.000006939263,0.0000126224,0.00002820264,0.0008429316],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4121899,"threshold_uncertainty_score":0.9989616,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2310694395","doi":"10.1137/16m1066890","title":"Eulerian Methods for Visualizing Continuous Dynamical Systems using Lyapunov Exponents","year":2017,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Quantum chaos and dynamical systems","field":"Physics and Astronomy","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Research Grants Council, University Grants Committee","keywords":"Lyapunov exponent; Isosurface; Mathematics; Flow (mathematics); Eulerian path; Applied mathematics; Computation; Dynamical systems theory; Partial differential equation; Mathematical analysis; Algorithm; Computer science; Visualization; Geometry; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.06970046839320267,"gpt":0.4264635193669164,"spread":0.3567630509737137,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004005119,0.0002696507,0.0005536373,0.0001644103,0.003820764,0.004348957,0.000735571,0.00006881732,0.00003048324],"category_scores_gemma":[0.0001167479,0.0002254705,0.0003529186,0.0001137765,0.0001611623,0.0002931849,0.000208745,0.0003543025,0.00001854507],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000115043,"about_ca_system_score_gemma":0.00009023526,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008799444,"about_ca_topic_score_gemma":9.036996e-7,"domain_scores_codex":[0.9972579,0.0002932814,0.0008139876,0.000532916,0.0003985721,0.000703326],"domain_scores_gemma":[0.9973692,0.0003081734,0.001154107,0.0005645429,0.0002879213,0.0003161064],"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.0003431623,0.001407653,0.05320223,0.0004105344,0.00107445,0.00007349408,0.003071332,0.03685041,0.189476,0.2124005,0.001897267,0.4997929],"study_design_scores_gemma":[0.0009584284,0.0000745227,0.0007812921,0.000546713,0.00003364194,0.0000381437,0.0006758135,0.9885984,0.0002679179,0.001928929,0.005766405,0.0003297683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4963323,0.00004989606,0.4953941,0.00003271288,0.007202051,0.0002541966,0.00001386463,0.0000204705,0.0007003114],"genre_scores_gemma":[0.9823806,1.802105e-7,0.01529513,0.000009764307,0.001812706,0.000002991162,0.00001023643,0.00003816198,0.0004502134],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.951748,"threshold_uncertainty_score":0.9974761,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2787251405","doi":"10.1137/16m1071341","title":"A Reduced Basis Method for Coercive Equations with an Exact Solution Certificate and Spatio-Parameter Adaptivity: Energy-Norm and Output Error Bounds","year":2018,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Office of the Secretary of Defense; University of Toronto","keywords":"Mathematics; Upper and lower bounds; Norm (philosophy); Applied mathematics; Basis function; Partial differential equation; Condition number; Residual; Finite element method; A priori and a posteriori; Exact solutions in general relativity; Mathematical optimization; Eigenvalues and eigenvectors; Mathematical analysis; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.1401766867158167,"gpt":0.3699142345739065,"spread":0.2297375478580898,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00174659,0.0002182989,0.0002899066,0.0002958653,0.0008800855,0.0005203793,0.0001460494,0.00006070109,0.000005653927],"category_scores_gemma":[0.0006006528,0.0001876608,0.00005128053,0.0004206965,0.0002577631,0.0003499443,0.00005146653,0.0002249894,0.000002061831],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001166588,"about_ca_system_score_gemma":0.00004840209,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000238311,"about_ca_topic_score_gemma":0.000009185219,"domain_scores_codex":[0.9982707,0.000168128,0.0004325018,0.0004098704,0.0003648086,0.0003540016],"domain_scores_gemma":[0.9969758,0.001984351,0.0002302555,0.0002233221,0.000370296,0.0002159111],"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.0001618474,0.0001302189,0.00004076787,0.000093168,0.000140678,0.000005335367,0.003007412,0.1420066,0.007127507,0.004894604,0.0002478985,0.842144],"study_design_scores_gemma":[0.0003496596,0.0004098402,0.0002305409,0.0001286037,0.000043422,0.00009392881,0.0001838159,0.9686865,0.001851087,0.02700428,0.0007805097,0.0002378141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1220136,0.00004875506,0.8768185,0.0001462286,0.0006073958,0.0001658772,0.000009700875,0.00009227155,0.00009772883],"genre_scores_gemma":[0.4885603,0.000001181284,0.5111847,0.00002823899,0.0001544413,0.000004166105,0.000003963937,0.00002426957,0.00003868777],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8419061,"threshold_uncertainty_score":0.7652587,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3119875199","doi":"10.1137/19m1308669","title":"Tuning Multigrid Methods with Robust Optimization and Local Fourier Analysis","year":2021,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Office of Science","keywords":"Multigrid method; Solver; Discretization; Mathematical optimization; Fourier transform; Mathematics; Fourier analysis; Fourier series; Algorithm; Computer science; Applied mathematics; Partial differential equation; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.03491075878572143,"gpt":0.3338789458343272,"spread":0.2989681870486058,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001515604,0.0001694902,0.000316151,0.000337334,0.000410925,0.0004184393,0.0001277572,0.00004335359,0.00004472076],"category_scores_gemma":[0.0003692499,0.0001461094,0.00008812969,0.001908821,0.0001252239,0.0001600199,0.00006838148,0.0004029043,0.000002423043],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009351553,"about_ca_system_score_gemma":0.00004045396,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.551e-7,"about_ca_topic_score_gemma":5.341004e-7,"domain_scores_codex":[0.998369,0.0002311574,0.0004061933,0.0003009962,0.0004235907,0.0002690851],"domain_scores_gemma":[0.9980558,0.001101811,0.0001444414,0.0002072756,0.0003192426,0.0001714484],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003036773,0.00001592047,0.00008367542,0.00002049649,0.0001522917,0.00003215492,0.0002287652,0.9009892,0.0001691831,0.0001555319,0.00001892031,0.09813082],"study_design_scores_gemma":[0.0002027335,0.00002183813,0.0001511912,0.00009796445,0.0001145297,0.0001902506,0.0002848759,0.99689,0.000702403,0.0008375811,0.0003277503,0.0001788441],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01163581,0.0002963049,0.986863,0.0000504793,0.0006837859,0.00004798079,0.000001244636,0.00009335715,0.0003279994],"genre_scores_gemma":[0.08669965,0.000008258702,0.9130799,0.00003117247,0.00009850778,5.109858e-7,0.000004271189,0.00002553274,0.00005221717],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.09795198,"threshold_uncertainty_score":0.5958169,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1977737476","doi":"10.1137/130927504","title":"Relaxing the CFL Number of the Discontinuous Galerkin Method","year":2014,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Computational Fluid Dynamics and Aerodynamics","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Superconvergence; Mathematics; Discontinuous Galerkin method; Courant–Friedrichs–Lewy condition; Conservation law; Discretization; Stencil; Dissipation; Norm (philosophy); Mathematical analysis; Exponential function; Applied mathematics; Finite element method; Physics; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.006310043383508259,"gpt":0.2483970026837385,"spread":0.2420869593002302,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002640593,0.0001355602,0.0001710098,0.00006713587,0.0006047583,0.0003394969,0.0005616155,0.00003401099,0.00002005421],"category_scores_gemma":[0.0001541911,0.00007938468,0.0001912263,0.0004838394,0.00009516819,0.00006503329,0.0001285447,0.0004969386,0.00001911856],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006330341,"about_ca_system_score_gemma":0.00003090329,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002174891,"about_ca_topic_score_gemma":0.000006522049,"domain_scores_codex":[0.9984384,0.0001717346,0.0004428997,0.0001729913,0.0005091289,0.0002648916],"domain_scores_gemma":[0.9987646,0.0005617098,0.0001640997,0.0003215993,0.0001284759,0.00005947326],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002297892,0.00001641316,0.00104624,0.00001359636,0.00002911697,0.000001406267,0.0004465798,0.9457018,0.001743225,0.01344309,0.0007626087,0.03679364],"study_design_scores_gemma":[0.0001404934,0.000007906095,0.008131897,0.0001267299,0.00001088991,0.0001228805,0.00005724276,0.9839695,0.0000999019,0.003354975,0.003874708,0.0001028693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6982114,0.00004060191,0.2934836,0.0002853435,0.003985529,0.00007429659,0.000002931542,0.0000362261,0.003880036],"genre_scores_gemma":[0.9925551,0.000001695451,0.006770393,0.00004530359,0.0002615304,3.124918e-7,0.000001245239,0.00002158097,0.0003428187],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2943437,"threshold_uncertainty_score":0.4651373,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2125318452","doi":"10.1137/s1064827500376144","title":"A Newton-GMRES Approach for the Analysis of the Postbuckling Behavior of the Solutions of the von Kármán Equations","year":2003,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Composite Structure Analysis and Optimization","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Generalized minimal residual method; Mathematics; Context (archaeology); Computation; Newton's method; Bifurcation; Applied mathematics; Iterative method; Algorithm; Mathematical analysis; Nonlinear system","retraction":null,"screen_n_in":null,"score":{"opus":0.02145053431558714,"gpt":0.2460232876657465,"spread":0.2245727533501594,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00133247,0.0001108923,0.0002293272,0.0002209124,0.001157403,0.0001153119,0.0006269027,0.00003776979,0.00001517911],"category_scores_gemma":[0.0002330385,0.00005109766,0.0007164319,0.002786451,0.0001698527,0.00005090558,0.00008549059,0.0002425056,9.480492e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005422761,"about_ca_system_score_gemma":0.00006714387,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001138894,"about_ca_topic_score_gemma":0.00004432912,"domain_scores_codex":[0.9984447,0.0001489562,0.0005847918,0.0001405258,0.0004896879,0.0001913686],"domain_scores_gemma":[0.9982408,0.000353077,0.0004743972,0.0005527656,0.000352542,0.0000264268],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001544235,0.00003121753,0.001795338,0.000009071383,0.0002629955,1.86596e-8,0.0006996928,0.9868176,0.007387654,0.001676858,0.00009453344,0.001223455],"study_design_scores_gemma":[0.000118319,0.000007121433,0.01869931,0.00004418163,0.001311731,0.000003741487,0.0003925772,0.97478,0.004319934,0.00008614628,0.0001759565,0.00006102784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5098459,0.0004159779,0.4871305,0.0002288251,0.001466625,0.0004284953,0.00003044835,0.0000112719,0.000441992],"genre_scores_gemma":[0.9982056,0.000003035575,0.001639919,0.00001030024,0.00004077369,0.000001945459,0.000002833937,0.000009430279,0.00008617123],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4883597,"threshold_uncertainty_score":0.8901926,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3128374066","doi":"10.1137/21m1396277","title":"A Two-Dimensional Stabilized Discontinuous Galerkin Method on Curvilinear Embedded Boundary Grids","year":2022,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Foundation Autism Research Initiative; Simons Foundation","keywords":"Curvilinear coordinates; Mathematics; Grid; Discontinuous Galerkin method; Galerkin method; Numerical analysis; Boundary (topology); Boundary value problem; Applied mathematics; Mathematical analysis; Geometry; Finite element method","retraction":null,"screen_n_in":null,"score":{"opus":0.02903048837805348,"gpt":0.3440689858792443,"spread":0.3150384975011908,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.004478017,0.000337438,0.0004957516,0.0004520835,0.001542888,0.0004031211,0.0005719539,0.00003537206,0.0004123059],"category_scores_gemma":[0.00061108,0.0003087307,0.000261498,0.001056642,0.000133078,0.0001400675,0.000314243,0.001475535,0.00005706347],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004526459,"about_ca_system_score_gemma":0.0001282462,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.397368e-7,"about_ca_topic_score_gemma":2.365027e-7,"domain_scores_codex":[0.9957316,0.0007060428,0.0008825928,0.0005201275,0.001571162,0.0005885112],"domain_scores_gemma":[0.9962158,0.002646631,0.0002989717,0.0004187549,0.0001744781,0.0002453722],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005127696,0.00014444,0.000008802035,0.00002374329,0.00004269652,0.00006405413,0.0004500219,0.9542565,0.002902366,0.001204737,0.001266888,0.03958445],"study_design_scores_gemma":[0.000932536,0.0002140421,0.00004029074,0.0001051146,0.00001763414,0.000429741,0.000323917,0.9597526,0.000844359,0.02766188,0.009294485,0.0003834182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2937218,0.0002467692,0.6939798,0.0001742239,0.009235278,0.0003058749,0.00003466934,0.000347826,0.001953772],"genre_scores_gemma":[0.3123549,7.974551e-7,0.6865922,0.0002042268,0.0004972698,0.000007764594,0.00001311179,0.00008339393,0.0002463127],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03920103,"threshold_uncertainty_score":0.9999365,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2133474653","doi":"10.1137/120889733","title":"Parameter Estimation for ODEs Using a Cross-Entropy Approach","year":2013,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Probabilistic and Robust Engineering Design","field":"Decision Sciences","cited_by":15,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Mathematical optimization; Cross entropy; Algorithm; Ode; Entropy (arrow of time); Estimation theory; Applied mathematics; Principle of maximum entropy; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.1709982358248801,"gpt":0.3968729148220905,"spread":0.2258746789972105,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.007293297,0.0001880783,0.0002998377,0.0004864186,0.001212866,0.005602975,0.0007902547,0.00007527116,0.0001383202],"category_scores_gemma":[0.006109462,0.0001275723,0.0002264841,0.0008013039,0.0002160159,0.0006056275,0.0001024139,0.0002815048,0.0001680403],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001211786,"about_ca_system_score_gemma":0.0001250727,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002441135,"about_ca_topic_score_gemma":5.680977e-8,"domain_scores_codex":[0.9965041,0.0001478908,0.0009279628,0.0005833947,0.001321189,0.0005154816],"domain_scores_gemma":[0.9958221,0.002068199,0.0004874375,0.000463972,0.0009269489,0.0002313934],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001247952,0.00006743557,0.0003513112,0.00001083218,0.00001643894,0.000001796923,0.0002701861,0.9530438,0.001099701,0.002022442,0.004539466,0.03856413],"study_design_scores_gemma":[0.0003295075,0.00005138073,0.0008735248,0.00004998915,0.000009975765,0.00009292555,0.0001071596,0.9571161,0.000213877,0.04033402,0.0006619665,0.000159523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3074616,0.00004172944,0.6900227,0.0000551718,0.001924152,0.0002788179,0.00000228841,0.00003342591,0.0001801726],"genre_scores_gemma":[0.6667025,1.911899e-7,0.3323543,0.0000387222,0.0002155963,0.000002721781,0.000001754233,0.0000124323,0.0006718069],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.3592409,"threshold_uncertainty_score":0.9954293,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2049309186","doi":"10.1137/070689607","title":"An Adaptive Multilevel Wavelet Solver for Elliptic Equations on an Optimal Spherical Geodesic Grid","year":2008,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Geodesic; Solver; Wavelet; Grid; Applied mathematics; Mathematical analysis; Interpolation (computer graphics); Curvature; Geometry; Mathematical optimization; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.05077187457571527,"gpt":0.3057073721194014,"spread":0.2549354975436861,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006898791,0.0002673134,0.0003333565,0.0002662151,0.000988072,0.0002123991,0.0004224148,0.00007602895,0.0000578554],"category_scores_gemma":[0.0001227735,0.0002406548,0.0002072972,0.0005063895,0.0001693591,0.0004238985,0.00003246239,0.0005372671,0.0000460041],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002638554,"about_ca_system_score_gemma":0.00005308057,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001495625,"about_ca_topic_score_gemma":0.000001237765,"domain_scores_codex":[0.9977936,0.00008178402,0.0005351086,0.0004687505,0.000553096,0.0005676374],"domain_scores_gemma":[0.9985451,0.0003375475,0.0001592325,0.0003739439,0.0002413786,0.0003428201],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005086955,0.0002107419,0.00001388556,0.000005324346,0.00003637949,0.00002652366,0.0004009783,0.9435673,0.005775689,0.0002596653,0.0008170541,0.04883564],"study_design_scores_gemma":[0.000292,0.0005655815,0.0002812259,0.00004994487,0.00001991923,0.00004863607,0.0001004599,0.9911221,0.005249314,0.0002996761,0.001668458,0.0003027426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2577983,0.000025187,0.7410178,0.00002250119,0.0005802208,0.0001597865,0.00001104383,0.0002693461,0.0001158692],"genre_scores_gemma":[0.7535738,0.00000384244,0.2457837,0.00005686125,0.0004491966,0.000004384015,0.00001708188,0.00004123336,0.0000699483],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4957755,"threshold_uncertainty_score":0.9813619,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2884447341","doi":"10.1137/17m1132185","title":"Parallel Domain Decomposition Strategies for Stochastic Elliptic Equations. Part A: Local Karhunen--Loève Representations","year":2018,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Probabilistic and Robust Engineering Design","field":"Decision Sciences","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Sandia National Laboratories; Office of Science; King Abdullah University of Science and Technology","keywords":"Domain decomposition methods; Mathematics; Discretization; Applied mathematics; Galerkin method; Projection (relational algebra); Monte Carlo method; Covariance; Stochastic process; Mathematical optimization; Algorithm; Mathematical analysis; Finite element method","retraction":null,"screen_n_in":null,"score":{"opus":0.1068152983410332,"gpt":0.3918997272058532,"spread":0.28508442886482,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.007529258,0.0002187242,0.0003153523,0.0005837104,0.002175462,0.002543853,0.0007979511,0.00008286854,0.0001625273],"category_scores_gemma":[0.002349373,0.0001694071,0.0002201703,0.00088031,0.0006350404,0.0005004979,0.00009917181,0.0003021348,0.0004393361],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000144259,"about_ca_system_score_gemma":0.0003942723,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000185395,"about_ca_topic_score_gemma":0.000006959422,"domain_scores_codex":[0.995845,0.0002703155,0.001149262,0.0007090162,0.001469225,0.0005572101],"domain_scores_gemma":[0.9934464,0.0038527,0.0005289779,0.000592377,0.001306547,0.0002729695],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005976457,0.0000940828,0.00001431953,0.000005657302,0.00002403319,0.000007111907,0.001196381,0.8763646,0.0003943906,0.1000232,0.01243869,0.009377773],"study_design_scores_gemma":[0.0006213792,0.0002659188,0.0002717187,0.0001235896,0.00002336513,0.00008052214,0.002221349,0.7907196,0.00004802801,0.201789,0.003599725,0.0002357944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03117559,0.00006911023,0.9619111,0.0005258282,0.004990616,0.0003627081,0.00001249279,0.0000686178,0.0008838987],"genre_scores_gemma":[0.9440983,4.914991e-7,0.05410179,0.0000816367,0.001013849,0.000007740956,0.00001095989,0.0000179239,0.0006673353],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9129227,"threshold_uncertainty_score":0.9991236,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4401522519","doi":"10.1137/22m1538971","title":"A Levenberg–Marquardt Method for Nonsmooth Regularized Least Squares","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Numerical methods in inverse problems","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"Office of Science","keywords":"Levenberg–Marquardt algorithm; Mathematics; Applied mathematics; Least-squares function approximation; Algorithm; Non-linear least squares; Iteratively reweighted least squares; Mathematical optimization; Artificial intelligence; Estimation theory; Statistics; Computer science; Artificial neural network; Estimator","retraction":null,"screen_n_in":null,"score":{"opus":0.1298732554335799,"gpt":0.4490738403391438,"spread":0.3192005849055639,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.01346788,0.0003129676,0.000534126,0.0005730971,0.0009531,0.001767834,0.0006255808,0.0001228316,0.0002119092],"category_scores_gemma":[0.00334583,0.000250801,0.0005607876,0.001080077,0.0001795663,0.0002087073,0.0001832894,0.0008708892,0.0001066473],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002401654,"about_ca_system_score_gemma":0.0002528499,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002707235,"about_ca_topic_score_gemma":0.000001543985,"domain_scores_codex":[0.9959438,0.0006992142,0.000955787,0.0007559103,0.0009104653,0.000734762],"domain_scores_gemma":[0.9924927,0.006006597,0.0003650861,0.0005329199,0.0003243526,0.0002783824],"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.0001260723,0.0002471184,0.00001328071,0.0007585597,0.0003280111,0.00009009772,0.002766497,0.001060672,0.02055823,0.2104247,0.07598116,0.6876456],"study_design_scores_gemma":[0.0004920631,0.0001725954,0.000006759937,0.00112145,0.00009705654,0.0003620308,0.0002947294,0.2957491,0.002702443,0.5497697,0.1488819,0.0003501778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004965214,0.0003351489,0.9807696,0.001358515,0.009272506,0.0004742141,0.00001626447,0.0002719035,0.002536629],"genre_scores_gemma":[0.01826418,0.000003036442,0.9762997,0.0001241758,0.0008837272,0.000008727976,0.000002452738,0.00008449866,0.004329477],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6872954,"threshold_uncertainty_score":0.9999944,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2908875472","doi":"10.1137/17m115311x","title":"Schwarz Waveform Relaxation with Adaptive Pipelining","year":2019,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"Research Grants Council, University Grants Committee; National Natural Science Foundation of China","keywords":"Speedup; Waveform; Iterated function; Relaxation (psychology); Computer science; Domain decomposition methods; Algorithm; Applied mathematics; Mathematics; Parallel computing; Mathematical analysis; Finite element method","retraction":null,"screen_n_in":null,"score":{"opus":0.07714812108883291,"gpt":0.3470939797694272,"spread":0.2699458586805943,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002658861,0.000188265,0.0002993323,0.0003296881,0.0006548869,0.0004685394,0.0003003919,0.00006005378,0.0002078161],"category_scores_gemma":[0.0007565398,0.0001342197,0.0001279159,0.0007413171,0.00009247211,0.0002790544,0.00008502509,0.0006652327,0.0003278536],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001761556,"about_ca_system_score_gemma":0.000126136,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001741314,"about_ca_topic_score_gemma":0.000001954692,"domain_scores_codex":[0.9975311,0.0002159641,0.000557025,0.0003791556,0.0009071076,0.0004097078],"domain_scores_gemma":[0.9974337,0.0009429699,0.0007083833,0.0003610673,0.0003805712,0.000173345],"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.0005082788,0.001007992,0.004749046,0.0001677889,0.0004006566,0.00007923837,0.01041014,0.01171104,0.01230667,0.1550042,0.002484165,0.8011708],"study_design_scores_gemma":[0.004397944,0.002481607,0.006689498,0.00304943,0.0002166282,0.0005333936,0.005056282,0.3385901,0.005617851,0.6263174,0.005537347,0.001512569],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.544694,0.000009271679,0.449148,0.0001217191,0.001615346,0.0001958251,0.000001361476,0.00006502421,0.004149453],"genre_scores_gemma":[0.754584,4.041778e-7,0.2436442,0.00003289141,0.000184806,7.234318e-7,0.000002083527,0.00002777478,0.001523121],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7996582,"threshold_uncertainty_score":0.5473321,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1970814699","doi":"10.1137/110851377","title":"Sparse Orthogonal Linear Discriminant Analysis","year":2012,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Orthogonality; Mathematics; Linear discriminant analysis; Linear map; Norm (philosophy); Algorithm; Mathematical optimization; Applied mathematics; Pure mathematics; Geometry; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.03527926915868062,"gpt":0.2803144904155625,"spread":0.2450352212568819,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001107705,0.0001872268,0.0002676374,0.00060221,0.0004366353,0.0003004078,0.0002684189,0.00005359855,0.00008135139],"category_scores_gemma":[0.00004090293,0.0001562767,0.000266872,0.001022069,0.00007372731,0.0002061975,0.00007470621,0.0004327254,0.00009310402],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007103103,"about_ca_system_score_gemma":0.00001919023,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001406419,"about_ca_topic_score_gemma":0.000002278654,"domain_scores_codex":[0.9983161,0.00006194327,0.0003846432,0.0001962475,0.0004676351,0.0005733984],"domain_scores_gemma":[0.9991207,0.00007872476,0.0001108422,0.000323909,0.0001104961,0.0002553026],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004159389,0.0004712629,0.04166888,0.0000388454,0.001514,0.0002165463,0.003944006,0.757293,0.04028488,0.003648564,0.03474626,0.1161321],"study_design_scores_gemma":[0.0002868121,0.00006029331,0.0428412,0.0002161629,0.0004399093,0.0003196167,0.0002670443,0.8939851,0.02005156,0.0003868354,0.04046006,0.0006854251],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8865377,0.0003757211,0.1070148,0.00003592345,0.003036575,0.0000537657,0.000002839031,0.000300527,0.002642173],"genre_scores_gemma":[0.992487,0.000009093063,0.006548152,0.00003940146,0.0007377649,2.972678e-7,0.000005897445,0.00002365992,0.0001487632],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.136692,"threshold_uncertainty_score":0.637278,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4283383558","doi":"10.1137/21m1429072","title":"Monolithic Multigrid for a Reduced-Quadrature Discretization of Poroelasticity","year":2022,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Sandia National Laboratories; U.S. Department of Energy; National Nuclear Security Administration; National Science Foundation","keywords":"Discretization; Multigrid method; Mathematics; Quadrature (astronomy); Applied mathematics; Solver; Poromechanics; Finite element method; Mathematical optimization; Mathematical analysis; Partial differential equation","retraction":null,"screen_n_in":null,"score":{"opus":0.02718743241505409,"gpt":0.3096560853424307,"spread":0.2824686529273766,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001273099,0.0001265905,0.0002188861,0.0002126219,0.0005804845,0.00008384979,0.0002742152,0.0000272927,0.00001723518],"category_scores_gemma":[0.0006698017,0.0001223201,0.0001146471,0.0006046538,0.00006269917,0.00008099913,0.00007834016,0.0004646844,0.000002019301],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000151099,"about_ca_system_score_gemma":0.00004420851,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.193556e-8,"about_ca_topic_score_gemma":4.843419e-8,"domain_scores_codex":[0.9984419,0.0001058174,0.0005116477,0.0001921379,0.0005135825,0.000234867],"domain_scores_gemma":[0.9983863,0.0009228273,0.0002618982,0.0001563213,0.0001905602,0.00008206769],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001596207,0.00004711365,0.00001417176,0.00006640121,0.00001745143,0.000002009667,0.0006279105,0.9720733,0.006127198,0.004135089,0.000367618,0.01650583],"study_design_scores_gemma":[0.000272841,0.0001036646,0.0001743914,0.00007946557,0.00001168011,0.00006135732,0.0002668004,0.9639309,0.002670859,0.03017901,0.002106419,0.00014263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1492627,0.00009627425,0.847186,0.0000630272,0.002926297,0.0001762732,0.00002443459,0.00006966676,0.0001954091],"genre_scores_gemma":[0.7181793,8.821366e-7,0.2815927,0.00001614824,0.0001381959,0.000003738374,0.000006836918,0.00002208245,0.00004017865],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5689166,"threshold_uncertainty_score":0.498807,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1996178570","doi":"10.1137/050642514","title":"Moving Mesh Methods for Singular Problems on a Sphere Using Perturbed Harmonic Mappings","year":2006,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Polygon mesh; Domain (mathematical analysis); Uniqueness; Grid; Harmonic map; Mesh generation; Mathematical analysis; Curvature; Applied mathematics; Algorithm; Geometry; Finite element method; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.05615245669003438,"gpt":0.3652302643751362,"spread":0.3090778076851018,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002957381,0.0003274198,0.0004320212,0.000322711,0.0008085686,0.0006221812,0.0003853057,0.00008813628,0.00002099119],"category_scores_gemma":[0.0007291409,0.0003054263,0.0002489467,0.000739558,0.00009798836,0.0001807739,0.00007154629,0.0005807534,0.00001133696],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004201102,"about_ca_system_score_gemma":0.00006355756,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.145577e-7,"about_ca_topic_score_gemma":1.696869e-7,"domain_scores_codex":[0.9973716,0.000193279,0.0008385824,0.0004424705,0.0005203404,0.0006337255],"domain_scores_gemma":[0.9968478,0.002100159,0.0003416322,0.0002844992,0.0002806416,0.0001452627],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008206443,0.00005269075,0.000005960703,0.0001349339,0.00003079573,0.000006388973,0.000218629,0.8442447,0.03144944,0.001869537,0.0002707604,0.121708],"study_design_scores_gemma":[0.0003613509,0.00006583904,0.00002223868,0.0005759308,0.00002220814,0.0001079696,0.00007120666,0.9143791,0.004651338,0.07296711,0.006455448,0.0003202889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06609412,0.0003819039,0.9294302,0.00006423334,0.002878897,0.0003508751,0.000002539565,0.0002335833,0.0005636557],"genre_scores_gemma":[0.1104884,0.000001518926,0.8886945,0.000057555,0.0005279719,0.000003247928,0.000002907158,0.00008113269,0.0001427973],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1213877,"threshold_uncertainty_score":0.9999398,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4386746667","doi":"10.1137/22m1515884","title":"On GSOR, the Generalized Successive Overrelaxation Method for Double Saddle-Point Problems","year":2023,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Mathematics; Saddle point; Saddle; Convergence (economics); Block (permutation group theory); Mathematical analysis; Applied mathematics; Flow (mathematics); Geometry; Mathematical optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.04124037913562043,"gpt":0.3292415446169593,"spread":0.2880011654813389,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.009631109,0.0002110498,0.0002386934,0.0004170787,0.002280604,0.002197544,0.001469751,0.00005956741,0.0000255421],"category_scores_gemma":[0.0003175218,0.0001369035,0.0002521236,0.001650468,0.00007739763,0.0004152217,0.0002913128,0.0004380182,0.0001631626],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009321795,"about_ca_system_score_gemma":0.0001319112,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004206076,"about_ca_topic_score_gemma":0.000001950415,"domain_scores_codex":[0.9970528,0.0003963385,0.0005500111,0.0006141529,0.0007953251,0.0005913683],"domain_scores_gemma":[0.9966632,0.001686927,0.0006005786,0.0006045121,0.0002934724,0.0001512992],"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.00008505135,0.00009845541,0.000007236517,0.00003363415,0.00005115604,0.00002495544,0.003271383,0.3352917,0.001610272,0.552285,0.01439572,0.09284542],"study_design_scores_gemma":[0.001217667,0.0001568556,0.00004305721,0.0001379708,0.000008648272,0.00005889088,0.00009244376,0.8823887,0.002811012,0.1022629,0.01062428,0.0001975303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03244655,0.00005316578,0.9562703,0.003053765,0.006619019,0.0005360546,0.00000422533,0.0001968852,0.0008200284],"genre_scores_gemma":[0.8248098,0.00001471834,0.1599625,0.001571331,0.002197204,0.00004982064,0.0000296077,0.00007462423,0.01129035],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7963077,"threshold_uncertainty_score":0.9990183,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3194154810","doi":"10.1137/20m1346985","title":"Local Fourier Analysis of Multigrid for Hybridized and Embedded Discontinuous Galerkin Methods","year":2021,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multigrid method; Discontinuous Galerkin method; Mathematics; Galerkin method; Fourier transform; Applied mathematics; Fourier analysis; Mathematical analysis; Partial differential equation; Finite element method; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.03650799133533079,"gpt":0.3829492526301561,"spread":0.3464412612948253,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002252533,0.0001713511,0.0005891137,0.0003919367,0.0002175675,0.000189869,0.0001701609,0.0000425383,0.00002461676],"category_scores_gemma":[0.00145736,0.000157295,0.0002847468,0.001272932,0.0001540993,0.00009536945,0.00007731963,0.0002568816,0.000001049008],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006083221,"about_ca_system_score_gemma":0.00004120105,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.41374e-7,"about_ca_topic_score_gemma":5.037799e-7,"domain_scores_codex":[0.9981173,0.0002208433,0.0007088724,0.0003005617,0.0003627269,0.0002896839],"domain_scores_gemma":[0.9958046,0.00314047,0.0002459552,0.0002445576,0.0004193227,0.0001450626],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001359336,0.00004550684,0.0000307825,0.00007725177,0.0004663317,0.00001306541,0.000408596,0.6819027,0.008057847,0.0005941184,0.0001141872,0.308276],"study_design_scores_gemma":[0.0004181808,0.00002731451,0.0002803458,0.00009482355,0.0002459344,0.00005212284,0.0002765717,0.975023,0.01370104,0.008734372,0.0009800831,0.0001661993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1068478,0.0004229739,0.8911927,0.00003098976,0.001200797,0.0000966974,0.00001351229,0.00004501656,0.0001495382],"genre_scores_gemma":[0.2525365,0.000005394213,0.7472906,0.00001671444,0.00006959453,0.000001269543,0.000005278378,0.00002029069,0.00005434006],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3081098,"threshold_uncertainty_score":0.6414304,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4382359695","doi":"10.1137/21m1431199","title":"Local Fourier Analysis of p-Multigrid for High-Order Finite Element Operators","year":2023,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"U.S. Department of Energy","keywords":"Multigrid method; Finite element method; Discretization; Applied mathematics; Mathematics; Partial differential equation; Smoothing; Smoothed finite element method; Laplace operator; Mathematical analysis; Boundary knot method; Boundary element method","retraction":null,"screen_n_in":null,"score":{"opus":0.03755450190679228,"gpt":0.3413912804011748,"spread":0.3038367784943825,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001777828,0.0001616868,0.0003895833,0.0008659957,0.0002769747,0.0001250528,0.0002715748,0.00004134277,0.00004400881],"category_scores_gemma":[0.0006072752,0.0001448969,0.0001778889,0.0034661,0.0000905402,0.00008255141,0.00006802844,0.0002232119,0.00002427181],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009726513,"about_ca_system_score_gemma":0.00003517275,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.512045e-7,"about_ca_topic_score_gemma":6.047897e-7,"domain_scores_codex":[0.9980698,0.00006230257,0.0007082905,0.0002389673,0.0005652468,0.0003554584],"domain_scores_gemma":[0.9970954,0.001964544,0.0001905216,0.000224813,0.0004060985,0.0001186164],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004537696,0.00002341809,0.00003461349,0.00003822695,0.0002808234,0.000003674066,0.0002331092,0.9365,0.0003721869,0.001078173,0.0005457294,0.06088549],"study_design_scores_gemma":[0.0002547697,0.00005719663,0.000303732,0.00006256388,0.0001111803,0.000002020424,0.0001632207,0.9905824,0.001371774,0.004843796,0.002096149,0.0001512081],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09628818,0.0000344924,0.9013368,0.00004951268,0.001948798,0.0001340818,0.00002799288,0.0001127446,0.00006738253],"genre_scores_gemma":[0.5883028,0.000003804047,0.4114416,0.00002486487,0.0001110731,0.000002784113,0.00001971112,0.00002632474,0.0000670895],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4920146,"threshold_uncertainty_score":0.5908725,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4385217352","doi":"10.1137/22m1486522","title":"Fast Multigrid Reduction-in-Time for Advection via Modified Semi-Lagrangian Coarse-Grid Operators","year":2023,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Hong Kong Polytechnic University; Australian Government; Lawrence Livermore National Laboratory; U.S. Department of Energy","keywords":"Multigrid method; Advection; Mathematics; Reduction (mathematics); Grid; Applied mathematics; Lagrangian; Mathematical optimization; Mathematical analysis; Partial differential equation; Geometry; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.03029947285854765,"gpt":0.3160524451448598,"spread":0.2857529722863121,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001954555,0.0002213618,0.0003033946,0.0006717082,0.0005114744,0.0002975278,0.000311552,0.00007642131,0.00001573955],"category_scores_gemma":[0.0003892688,0.0002190994,0.0001474109,0.001669434,0.0000741802,0.0002159091,0.00005361097,0.0004533958,0.0001399236],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002543605,"about_ca_system_score_gemma":0.00003347566,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.705585e-7,"about_ca_topic_score_gemma":3.849142e-7,"domain_scores_codex":[0.997858,0.00009353793,0.0006747968,0.0003535983,0.000529938,0.0004901133],"domain_scores_gemma":[0.9985265,0.0007536378,0.0001540674,0.0002056755,0.0001979892,0.0001621417],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001229272,0.000033178,0.00001054869,0.00004591587,0.00001780179,0.000007409398,0.0004532094,0.9334006,0.01308068,0.0000778266,0.001186614,0.05167395],"study_design_scores_gemma":[0.0004664888,0.00004582133,0.000119508,0.0001951904,0.000007928982,0.00009665261,0.0001693821,0.9905943,0.002698622,0.004292322,0.001077564,0.0002361728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2594181,0.00003500665,0.7314411,0.00008608896,0.008107684,0.0003176685,0.00001053747,0.0003872299,0.0001965934],"genre_scores_gemma":[0.7412551,0.000008300584,0.2567407,0.00002612639,0.001364805,0.00001305023,0.00002767497,0.00009889282,0.0004652778],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.481837,"threshold_uncertainty_score":0.8934616,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2032988793","doi":"10.1137/040619557","title":"String Gradient Weighted Moving Finite Elements in Multiple Dimensions with Applications in Two Dimensions","year":2007,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Advanced Mathematical Modeling in Engineering","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Corpus Christi College, University of Cambridge; Natural Sciences and Engineering Research Council of Canada","keywords":"Finite element method; Polygon mesh; Mathematics; Nonlinear system; Extended finite element method; Mixed finite element method; Mathematical analysis; Applied mathematics; Geometry; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.02432582867762213,"gpt":0.2903823271603705,"spread":0.2660564984827484,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002519344,0.0002261107,0.0002640329,0.001022501,0.0006045426,0.0003105067,0.0006981877,0.00003217276,0.000002113495],"category_scores_gemma":[0.0002297592,0.0001910632,0.00006085157,0.002140428,0.00006588274,0.0003942775,0.0003337419,0.0007000625,0.00001242977],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003138429,"about_ca_system_score_gemma":0.0000676842,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005242119,"about_ca_topic_score_gemma":0.00006657124,"domain_scores_codex":[0.9970516,0.00005239613,0.000874715,0.0005851576,0.0006514243,0.0007847364],"domain_scores_gemma":[0.9976065,0.001185775,0.0002662038,0.0005400418,0.000148184,0.0002533088],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007353311,0.0002746035,0.005964876,0.00001382866,0.000009068959,0.00009552302,0.001148516,0.9541674,0.002237524,0.0264654,0.00000364585,0.009612265],"study_design_scores_gemma":[0.0008793159,0.00003662154,0.001974497,0.0005375479,0.000003315626,0.00004264662,0.0001806784,0.9900432,0.0006896246,0.005201926,0.0001705354,0.0002400636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4272593,0.00003357684,0.5720672,0.00002804995,0.0002856778,0.0001890863,4.720338e-7,0.00006206429,0.00007458344],"genre_scores_gemma":[0.6905759,0.000001383438,0.3093322,0.00002259805,0.00003380852,0.000003037931,0.000001226153,0.00001378514,0.00001603738],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.2633166,"threshold_uncertainty_score":0.7791329,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4404080263","doi":"10.1137/23m160846x","title":"Building Hierarchies of Semiclassical Jacobi Polynomials for Spectral Methods in Annuli","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"Engineering and Physical Sciences Research Council; Deutsche Forschungsgemeinschaft; Leverhulme Trust","keywords":"Mathematics; Semiclassical physics; Jacobi polynomials; Jacobi method; Applied mathematics; Gegenbauer polynomials; Orthogonal polynomials; Algebra over a field; Pure mathematics; Classical orthogonal polynomials; Calculus (dental); Quantum","retraction":null,"screen_n_in":null,"score":{"opus":0.1292507934940085,"gpt":0.5006620404765456,"spread":0.3714112469825371,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007406671,0.0001862981,0.0004910735,0.0008653635,0.000279185,0.0004914647,0.0003671208,0.0000728555,0.00004628522],"category_scores_gemma":[0.003350888,0.0001539556,0.0003528185,0.001070515,0.0001995238,0.0001546133,0.0001080151,0.0005954598,0.000004482597],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002177581,"about_ca_system_score_gemma":0.0001955294,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002448363,"about_ca_topic_score_gemma":0.000002142921,"domain_scores_codex":[0.9970701,0.0005949427,0.001020701,0.0004048001,0.0004305921,0.0004789007],"domain_scores_gemma":[0.9926618,0.006543428,0.0002907049,0.0002335668,0.000123237,0.0001472553],"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.00006511409,0.0002142399,0.00008261087,0.0003356771,0.000105389,0.00002027981,0.002204129,0.0009561779,0.2938973,0.2170853,0.001267018,0.4837668],"study_design_scores_gemma":[0.000395967,0.0001639339,0.000181283,0.0009354636,0.00005167534,0.00006471895,0.00018246,0.1100113,0.04063008,0.8425852,0.004575783,0.0002221477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2948625,0.000142289,0.7013655,0.0003019217,0.002886482,0.0002035316,0.000009920187,0.00004730035,0.0001804745],"genre_scores_gemma":[0.210399,0.000001337236,0.7889596,0.00001516606,0.0003881348,0.000002291246,8.431684e-7,0.0000286819,0.0002050017],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6254999,"threshold_uncertainty_score":0.6278129,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}