{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":58,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":58,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"65d2aabcbca5","filters":{"venue":"Numerical Linear Algebra with Applications"}},"results":[{"id":"W2104744926","doi":"10.1002/nla.622","title":"Numerical solution of large‐scale Lyapunov equations, Riccati equations, and linear‐quadratic optimal control problems","year":2008,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Model Reduction and Neural Networks","field":"Physics and Astronomy","cited_by":344,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Algebraic Riccati equation; Mathematics; Cholesky decomposition; Linear-quadratic regulator; Riccati equation; Lyapunov equation; Linear-quadratic-Gaussian control; Linear system; Applied mathematics; Lyapunov function; Optimal control; Mathematical optimization; Differential equation; Mathematical analysis; Nonlinear system","authors":[{"name":"Peter Benner","is_ca":false},{"name":"Jing‐Rebecca Li","is_ca":false},{"name":"Thilo Penzl","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0146462960125644,"gpt":0.2505833551941164,"spread":0.235937059181552,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006827449,0.0004824494,0.0006257235,0.0002532706,0.0003872206,0.0006300507,0.0004517171,0.0007973987,0.001622863],"category_scores_gemma":[0.003298101,0.0002617537,0.000274401,0.0003755204,0.001166771,0.0007754604,0.0007919307,0.0007080403,0.0002163086],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004855218,"about_ca_system_score_gemma":0.0007953452,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00405905,"about_ca_topic_score_gemma":0.002782715,"domain_scores_codex":[0.9997184,0.0001257762,0.00001366228,0.00003327352,0.0000923587,0.00001648798],"domain_scores_gemma":[0.9989458,0.0007043786,0.0001192922,0.00007963005,0.0001178773,0.00003300537],"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.0000187935,0.00001588255,0.0002217659,0.00004429729,0.00001096406,0.00002936395,0.00003569452,0.9655619,0.001554375,0.02344147,0.0003150552,0.008750365],"study_design_scores_gemma":[0.000007713486,0.000003528088,0.00002838303,0.000001646425,8.327166e-7,0.000003303713,0.000004451762,0.9947514,0.0003136077,0.004669053,0.0002144527,0.00000166421],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04909896,0.0004686233,0.9453763,0.0004313086,0.0000631404,0.00004954198,0.00003166444,0.0002080634,0.004272328],"genre_scores_gemma":[0.6830148,0.0004589404,0.3110875,0.00007586681,0.00005778125,0.0002072597,0.00009333459,0.00006756176,0.004937028],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00405905,"threshold_uncertainty_score":0.008070827,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2099359799","doi":"10.1002/nla.515","title":"Preconditioners for the discretized time‐harmonic Maxwell equations in mixed form","year":2007,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Electromagnetic Scattering and Analysis","field":"Physics and Astronomy","cited_by":106,"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; Schur complement; Eigenvalues and eigenvectors; Finite element method; Applied mathematics; Maxwell's equations; Saddle point; Saddle; Mathematical analysis; Mathematical optimization; Geometry; Physics","authors":[{"name":"Chen Greif","is_ca":true},{"name":"Dominik Schötzau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006816845117285113,"gpt":0.24769655799835,"spread":0.2408797128810649,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005588511,0.0004312741,0.0003720976,0.0002492489,0.0002793568,0.0004921061,0.0004306615,0.0005530901,0.003531945],"category_scores_gemma":[0.001666185,0.0001990261,0.0003642314,0.0002217919,0.000628692,0.0005420558,0.0009721613,0.0007618985,0.0006413748],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002293608,"about_ca_system_score_gemma":0.0006308474,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001206961,"about_ca_topic_score_gemma":0.001519358,"domain_scores_codex":[0.9997019,0.0001082646,0.00001423164,0.00002151028,0.0001300075,0.00002403658],"domain_scores_gemma":[0.9996043,0.0001560027,0.0000540493,0.00006532746,0.00008937879,0.00003091294],"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.0002693734,0.0001095815,0.0008928794,0.0002216938,0.00006743809,0.0003026512,0.0002924951,0.5286477,0.05918543,0.2813195,0.004547008,0.1241442],"study_design_scores_gemma":[0.00002056955,0.0000317474,0.00008391626,0.000006059611,0.000003942361,0.00002093594,0.00001316661,0.9835398,0.003396448,0.0104914,0.00238725,0.000004867507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02245394,0.00007290251,0.973783,0.0001573928,0.00007053107,0.00003562515,0.0000423288,0.0002028384,0.003181432],"genre_scores_gemma":[0.3733261,0.0002189249,0.6194242,0.0001331588,0.00009899294,0.0002534786,0.0001454795,0.0001614106,0.006238256],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003531945,"threshold_uncertainty_score":0.01181549,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2945154147","doi":"10.1002/nla.559","title":"Distance‐two interpolation for parallel algebraic multigrid","year":2007,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":103,"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":"Lawrence Livermore National Laboratory; U.S. Department of Energy","keywords":"Multigrid method; Scalability; Interpolation (computer graphics); Parallel computing; Convergence (economics); Computer science; Mathematics; Algorithm; Computational science; Partial differential equation","authors":[{"name":"Hans De Sterck","is_ca":true},{"name":"Robert D. Falgout","is_ca":false},{"name":"J. Nolting","is_ca":false},{"name":"Ulrike Meier Yang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01267897775696264,"gpt":0.2831024832464812,"spread":0.2704235054895186,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008586241,0.0003969353,0.0005640209,0.0005028038,0.0004938332,0.0004466985,0.0006748035,0.0004220653,0.002461852],"category_scores_gemma":[0.002643206,0.000165244,0.0004999928,0.0006564116,0.0006880672,0.0004860728,0.001428195,0.0008989122,0.0006234097],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005884783,"about_ca_system_score_gemma":0.0008107052,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002228372,"about_ca_topic_score_gemma":0.001922943,"domain_scores_codex":[0.9994656,0.0001887027,0.00002420986,0.00004599731,0.0002384234,0.00003711855],"domain_scores_gemma":[0.9990205,0.0004417348,0.00006407335,0.0001972584,0.0002282819,0.0000482061],"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.0002635749,0.00009238787,0.001753047,0.0002082891,0.0000405627,0.0001171095,0.0001412503,0.7059779,0.01333715,0.1158181,0.003958226,0.1582925],"study_design_scores_gemma":[0.00001444523,0.0000150397,0.0001085763,0.000004628211,0.000001914588,0.00001426796,0.000007154639,0.985797,0.001714805,0.01004984,0.002267548,0.000004725952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04037754,0.0003869912,0.9492922,0.0002452377,0.0001313176,0.00007553785,0.0000941469,0.0009767869,0.008420177],"genre_scores_gemma":[0.4368639,0.0002348672,0.5583903,0.00008028819,0.00005183232,0.0001637229,0.000306358,0.0003380551,0.003570633],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002461852,"threshold_uncertainty_score":0.008235693,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1919986261","doi":"10.1002/nla.1845","title":"The power and Arnoldi methods in an algebra of circulants","year":2012,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":46,"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; Centre International de Recherche sur le Cancer","keywords":"Mathematics; Circulant matrix; Algebra over a field; Linear algebra; Scalar (mathematics); Dimension (graph theory); Matrix (chemical analysis); Numerical linear algebra; Pure mathematics; Discrete mathematics; Numerical analysis; Mathematical analysis","authors":[{"name":"David F. Gleich","is_ca":false},{"name":"Chen Greif","is_ca":true},{"name":"J. M. Varah","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03708464711442809,"gpt":0.3759844170192982,"spread":0.3388997699048701,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001757527,0.0005850008,0.0007497525,0.001000554,0.0006919684,0.001421191,0.00089685,0.0004885158,0.003854497],"category_scores_gemma":[0.004815201,0.0003504278,0.0007561737,0.0007643197,0.002267868,0.002384412,0.001831037,0.001505713,0.001140705],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006414873,"about_ca_system_score_gemma":0.001095813,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00129151,"about_ca_topic_score_gemma":0.001326257,"domain_scores_codex":[0.9991597,0.0003243668,0.00004946547,0.0001175636,0.0002822345,0.0000666276],"domain_scores_gemma":[0.9980928,0.0008301495,0.0001734651,0.0003592769,0.0004062236,0.0001380667],"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.0000266854,0.00001880517,0.0001833254,0.00004814559,0.00001265891,0.00006169577,0.0001141823,0.04641102,0.002208522,0.923144,0.001854018,0.02591686],"study_design_scores_gemma":[0.000008564423,0.00002169647,0.00007188995,0.00001467312,0.000004589236,0.0000421493,0.00003512736,0.3779175,0.001765293,0.61449,0.005613739,0.00001482495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00893404,0.0001957077,0.9849979,0.0002401402,0.00008830169,0.00002890974,0.0000514742,0.00009428603,0.00536926],"genre_scores_gemma":[0.3078401,0.0008339204,0.6759871,0.0002654018,0.0002799544,0.0002108178,0.0002190833,0.0003939548,0.01396967],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003854497,"threshold_uncertainty_score":0.01289451,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2165397333","doi":"10.1002/nla.2017","title":"A family of constrained pressure residual preconditioners for parallel reservoir simulations","year":2015,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":39,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Western Canada Research Grid; CMG Reservoir Simulation Foundation; University of Calgary","keywords":"Preconditioner; Residual; Newton's method; Scalability; Scale (ratio); Reservoir simulation; Applied mathematics; Mathematics; Residual oil; Mathematical optimization; Computer science; Algorithm; Iterative method; Nonlinear system; Petroleum engineering; Geology","authors":[{"name":"Hui Liu","is_ca":true},{"name":"Kun Wang","is_ca":true},{"name":"Zhangxin Chen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04498031905365354,"gpt":0.3201237360138019,"spread":0.2751434169601484,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007011406,0.0006402883,0.0005468576,0.0003548651,0.000331416,0.0003439403,0.0007558826,0.0006858184,0.002344486],"category_scores_gemma":[0.001725522,0.000279055,0.0006382491,0.000349714,0.0005343589,0.0005879323,0.0009330498,0.001155597,0.0006987293],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002059018,"about_ca_system_score_gemma":0.0009084057,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002249971,"about_ca_topic_score_gemma":0.00160203,"domain_scores_codex":[0.9995639,0.0001353455,0.00002642066,0.00005039782,0.0001808182,0.0000431413],"domain_scores_gemma":[0.9994311,0.0001835686,0.00007219799,0.0001361929,0.0001289001,0.00004797169],"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.0003331517,0.0001210892,0.0007550561,0.0002569907,0.00009151542,0.000192419,0.0001364893,0.6825346,0.05905448,0.05687339,0.007433841,0.1922169],"study_design_scores_gemma":[0.00002616488,0.00006025304,0.0001391452,0.000007014298,0.000007216563,0.00002781913,0.000004261571,0.9818211,0.008351644,0.004770487,0.004771835,0.00001296134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0130119,0.0001982396,0.9828834,0.00009396669,0.0000520508,0.00006950038,0.0001004832,0.001211871,0.002378498],"genre_scores_gemma":[0.2508968,0.0005152096,0.7415125,0.0001043768,0.00008952402,0.000308906,0.0003787045,0.0004588303,0.005735215],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002344486,"threshold_uncertainty_score":0.007843077,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1796252776","doi":"10.1002/nla.1977","title":"A generalized predictive analysis tool for multigrid methods","year":2015,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":38,"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; National Science Foundation","keywords":"Multigrid method; Discretization; Mathematics; Applied mathematics; Computation; Diffusion; Class (philosophy); Convergence (economics); Partial differential equation; Mathematical optimization; Computer science; Mathematical analysis; Algorithm","authors":[{"name":"S. Friedhoff","is_ca":false},{"name":"Scott MacLachlan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03789095206775524,"gpt":0.364729005794814,"spread":0.3268380537270588,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001370063,0.0006824944,0.0005709485,0.00116745,0.0004174292,0.001151702,0.001187252,0.0008510691,0.005420975],"category_scores_gemma":[0.003858005,0.0003158594,0.00113248,0.0007495711,0.00099904,0.0009962365,0.001770263,0.001992318,0.001262993],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005116816,"about_ca_system_score_gemma":0.0007047605,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001758474,"about_ca_topic_score_gemma":0.001286422,"domain_scores_codex":[0.9995479,0.0001759671,0.00002051789,0.00004259716,0.000182635,0.00003039968],"domain_scores_gemma":[0.998832,0.000638679,0.00009342458,0.0001966026,0.0002022981,0.00003685383],"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.00002986343,0.00002783671,0.0005314391,0.0001236567,0.00004059065,0.000155856,0.0001575775,0.3254968,0.004133997,0.6123403,0.003627704,0.05333444],"study_design_scores_gemma":[0.000003105365,0.000004860025,0.00004938506,0.00001299627,0.000003643682,0.00001418525,0.000007831995,0.924262,0.0004393821,0.0714388,0.003759139,0.000004667911],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003052577,0.0002279837,0.9917374,0.0002120714,0.000068044,0.00002713302,0.00007127599,0.0004782061,0.004125214],"genre_scores_gemma":[0.4664645,0.0009677623,0.5178214,0.0003703659,0.0003564771,0.0004973626,0.0004210149,0.0009920603,0.01210903],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005420975,"threshold_uncertainty_score":0.01813501,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2141654299","doi":"10.1002/nla.318","title":"Consistency adjustments for pairwise comparison matrices","year":2002,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Consistency (knowledge bases); Rank (graph theory); Pairwise comparison; Transitive relation; Matrix (chemical analysis); Applied mathematics; Low-rank approximation; Linear least squares; Least-squares function approximation; Mathematical optimization; Linear model; Combinatorics; Discrete mathematics; Statistics; Mathematical analysis","authors":[{"name":"András Farkas","is_ca":false},{"name":"Peter Lancaster","is_ca":true},{"name":"Pál Rózsa","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0225620477831706,"gpt":0.2657795065740389,"spread":0.2432174587908683,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03394126,0.001031258,0.00152898,0.002278949,0.001406522,0.002864432,0.003871836,0.001581977,0.006785084],"category_scores_gemma":[0.1808268,0.001071979,0.001529287,0.002114489,0.00413475,0.004176985,0.004491518,0.00357208,0.001869124],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001235919,"about_ca_system_score_gemma":0.001686879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007257423,"about_ca_topic_score_gemma":0.0007055165,"domain_scores_codex":[0.9491579,0.03550486,0.001578161,0.005593146,0.007411622,0.0007542794],"domain_scores_gemma":[0.8937728,0.06525161,0.007234493,0.02185134,0.01107947,0.0008101544],"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.0004995827,0.0001023325,0.002416998,0.0005726189,0.0003780771,0.0001768774,0.0005273888,0.1385725,0.008491914,0.5649142,0.006728916,0.2766185],"study_design_scores_gemma":[0.00006596296,0.0002600292,0.00158785,0.0001453976,0.00007695923,0.0003024404,0.0001540793,0.5107276,0.01327145,0.4605836,0.01273937,0.00008526396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00556451,0.0001344791,0.9917246,0.0001505551,0.00007565312,0.00008397373,0.00005980415,0.0001992442,0.002007243],"genre_scores_gemma":[0.2267977,0.0001926313,0.768178,0.0002510382,0.0002027028,0.0004603306,0.0003549354,0.0004964715,0.003066131],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03394126,"threshold_uncertainty_score":0.1795006,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1976129499","doi":"10.1002/nla.715","title":"Numerical optimization for constrained image registration","year":2010,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":32,"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":"Solver; Image registration; Augmented Lagrangian method; Discretization; Multigrid method; Constraint (computer-aided design); Focus (optics); Domain (mathematical analysis); Mathematical optimization; Image (mathematics); Computer science; Matching (statistics); Volume (thermodynamics); Algorithm; Mathematics; Artificial intelligence; Geometry; Partial differential equation","authors":[{"name":"Eldad Haber","is_ca":false},{"name":"Raya Horesh","is_ca":false},{"name":"Jan Modersitzki","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01219782384400975,"gpt":0.2882343383597085,"spread":0.2760365145156988,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001929211,0.0009283495,0.001180595,0.0009977982,0.0005472584,0.001313793,0.0009995422,0.002033455,0.005334307],"category_scores_gemma":[0.008281821,0.0005964149,0.0007667409,0.0008587083,0.002145531,0.001222256,0.002608129,0.001588366,0.0009065281],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001250162,"about_ca_system_score_gemma":0.001401434,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003343565,"about_ca_topic_score_gemma":0.002209252,"domain_scores_codex":[0.9988453,0.0005153315,0.00005458916,0.0001833125,0.000346129,0.00005530369],"domain_scores_gemma":[0.9981957,0.00118508,0.0001879523,0.0001301994,0.0002382242,0.00006279854],"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.00006206542,0.0000321537,0.0002673379,0.0001490509,0.00003483803,0.00007975069,0.00008173376,0.8563814,0.002742702,0.1107938,0.002055901,0.02731934],"study_design_scores_gemma":[0.000008782651,0.000009175971,0.00004219904,0.000009309296,0.000003062394,0.00001532945,0.000006729591,0.9711638,0.0003398048,0.02673299,0.001664289,0.00000445444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0044097,0.000298083,0.9898255,0.0003926774,0.00005432399,0.00004398833,0.00004400436,0.0001446447,0.004786983],"genre_scores_gemma":[0.2725327,0.0005251276,0.7136657,0.00027926,0.0001239515,0.0005227251,0.0002636098,0.0004544854,0.01163245],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005334307,"threshold_uncertainty_score":0.01784509,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2010972644","doi":"10.1002/nla.701","title":"A simultaneous decomposition of a matrix triplet with applications","year":2010,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Shanghai Municipal Education Commission; McGill University; Natural Science Foundation of Shanghai","keywords":"Hermitian matrix; Mathematics; Matrix (chemical analysis); Decomposition; Matrix function; Matrix decomposition; Pure mathematics; Applied mathematics; Algebra over a field; Symmetric matrix; Eigenvalues and eigenvectors; Physics; Quantum mechanics; Chemistry","authors":[{"name":"Yonghui Liu","is_ca":false},{"name":"Yongge Tian","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.004614076783061271,"gpt":0.2573955205973986,"spread":0.2527814438143373,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001070494,0.000837773,0.0005512215,0.001362889,0.001012032,0.001832688,0.0007336093,0.0008400777,0.01052312],"category_scores_gemma":[0.00249387,0.000426241,0.0008164378,0.0008321556,0.001601403,0.002764714,0.00208462,0.001706121,0.001883936],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003057469,"about_ca_system_score_gemma":0.0006933444,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002559932,"about_ca_topic_score_gemma":0.0004638554,"domain_scores_codex":[0.9986406,0.0003109114,0.0000846598,0.0002668194,0.0004787325,0.0002183],"domain_scores_gemma":[0.9987809,0.0001963797,0.0001306968,0.0002246415,0.0004577645,0.0002094855],"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.00005242424,0.00006022829,0.0003007178,0.00006940543,0.00001165885,0.0002752821,0.0002719082,0.006404607,0.01707245,0.9502063,0.002417938,0.02285713],"study_design_scores_gemma":[0.00001847605,0.0001605134,0.0002822916,0.00002965009,0.00001327997,0.0004220444,0.0003058712,0.09938949,0.009347797,0.8799758,0.01001235,0.00004246932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1337123,0.0002400646,0.8166924,0.0004191071,0.0002802247,0.0001327361,0.0001202416,0.0005108539,0.0478921],"genre_scores_gemma":[0.7277187,0.0002546425,0.2492599,0.0003214715,0.0002718921,0.000129299,0.0002191908,0.0003101222,0.02151494],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01052312,"threshold_uncertainty_score":0.03520334,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2121096325","doi":"10.1002/nla.567","title":"Efficiency‐based <i>h</i>‐ and <i>hp</i>‐refinement strategies for finite element methods","year":2008,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":31,"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":"Dimension (graph theory); Finite element method; Grid; Work (physics); Mathematical optimization; Mathematics; Reduction (mathematics); Partial differential equation; Singularity; Applied mathematics; Computer science; Algorithm; Geometry; Mathematical analysis","authors":[{"name":"Hans De Sterck","is_ca":true},{"name":"Thomas A. Manteuffel","is_ca":false},{"name":"Steve McCormick","is_ca":false},{"name":"J. Nolting","is_ca":false},{"name":"J. Ruge","is_ca":false},{"name":"Liang Tang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03086172452935074,"gpt":0.3294186889575105,"spread":0.2985569644281597,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002896724,0.000666263,0.0007982004,0.0009916717,0.0003992186,0.0008370426,0.001625398,0.0007832556,0.001730697],"category_scores_gemma":[0.006850801,0.0004785116,0.0006238531,0.0004961984,0.001345607,0.00135493,0.001308194,0.0008633535,0.0005260643],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008500885,"about_ca_system_score_gemma":0.00103749,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002457462,"about_ca_topic_score_gemma":0.001925724,"domain_scores_codex":[0.9986577,0.0004434238,0.0001055918,0.0001011907,0.0006012226,0.00009085859],"domain_scores_gemma":[0.99732,0.001466526,0.0002657854,0.0003582502,0.0005137129,0.00007570232],"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.0003636073,0.0003195039,0.003017656,0.0004361871,0.0001248314,0.000176358,0.0004017116,0.4961439,0.04388254,0.1503967,0.001936384,0.3028005],"study_design_scores_gemma":[0.00005126715,0.000121611,0.000487499,0.00003673547,0.00002287907,0.00007994633,0.000040859,0.9636732,0.01727381,0.01615769,0.002028184,0.00002638435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01459214,0.0002774712,0.9826066,0.00009767866,0.00001520377,0.0000739563,0.00001012201,0.0001230353,0.002203887],"genre_scores_gemma":[0.3866964,0.000402288,0.6093176,0.0001197637,0.00002981119,0.0002178488,0.00005339037,0.0001755605,0.002987275],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002896724,"threshold_uncertainty_score":0.01531953,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2056707245","doi":"10.1002/nla.258","title":"On the growth factor in Gaussian elimination for generalized Higham matrices","year":2002,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":30,"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":"Gaussian elimination; Hermitian matrix; Mathematics; Positive-definite matrix; Matrix (chemical analysis); Gaussian; Combinatorics; Class (philosophy); Factor (programming language); Upper and lower bounds; Pure mathematics; Mathematical analysis; Physics; Computer science; Chemistry; Computational chemistry","authors":[{"name":"Alan D. George","is_ca":true},{"name":"Khakim D. Ikramov","is_ca":false},{"name":"Andrey B. Kucherov","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01661374818348609,"gpt":0.2450198333137332,"spread":0.2284060851302471,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004042332,0.001168305,0.0008322928,0.001309344,0.001209178,0.001447842,0.0009971011,0.001099251,0.005591102],"category_scores_gemma":[0.02912167,0.0003591039,0.000590584,0.0008319835,0.003661128,0.003188848,0.002272069,0.002131986,0.00140028],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00115496,"about_ca_system_score_gemma":0.0009589494,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002378181,"about_ca_topic_score_gemma":0.002277753,"domain_scores_codex":[0.9977963,0.0009230741,0.00005384431,0.0001460588,0.0007912375,0.0002894392],"domain_scores_gemma":[0.9787139,0.01602345,0.001021394,0.001248592,0.002270349,0.000722311],"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.0004722611,0.00008507443,0.002635096,0.0002155126,0.00003858276,0.0004555107,0.0004094392,0.08486697,0.00749488,0.8528371,0.008316772,0.04217292],"study_design_scores_gemma":[0.00003831565,0.00009801802,0.0005205221,0.00007630906,0.00001585285,0.000313465,0.00008689373,0.577813,0.007184472,0.4102465,0.003546167,0.00006038893],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2045355,0.001896481,0.7575524,0.002238406,0.0004271853,0.0001061624,0.0001350805,0.0007314318,0.03237731],"genre_scores_gemma":[0.9088691,0.001254425,0.07567997,0.0005004446,0.0003072659,0.0001572946,0.0001957166,0.0004493878,0.01258639],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005591102,"threshold_uncertainty_score":0.0213781,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3135361124","doi":"10.1002/nla.2367","title":"Optimizing multigrid reduction‐in‐time and Parareal coarse‐grid operators for linear advection","year":2021,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":30,"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; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Australian Research Council Centre of Excellence for Mathematical and Statistical Frontiers; Australian Government; Lawrence Livermore National Laboratory; U.S. Department of Energy","keywords":"Multigrid method; Partial differential equation; Advection; Convergence (economics); Mathematics; Applied mathematics; Reduction (mathematics); Grid; Elliptic partial differential equation; Upwind scheme; Polygon mesh; Mathematical optimization; Hyperbolic partial differential equation; Computer science; Mathematical analysis; Geometry; Discretization","authors":[{"name":"Hans De Sterck","is_ca":true},{"name":"Robert D. Falgout","is_ca":false},{"name":"Stephanie Friedhoff","is_ca":false},{"name":"Oliver A. Krzysik","is_ca":false},{"name":"Scott MacLachlan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01548230655425855,"gpt":0.2866689558773092,"spread":0.2711866493230507,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008412011,0.0005174059,0.0003502661,0.0003022873,0.0002828139,0.0005937022,0.0006546036,0.0004961516,0.001648771],"category_scores_gemma":[0.002338791,0.0001657417,0.0003258553,0.0002445371,0.000712703,0.0005056231,0.0008296584,0.0009009659,0.0003364429],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005211683,"about_ca_system_score_gemma":0.0009634151,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003492464,"about_ca_topic_score_gemma":0.003581986,"domain_scores_codex":[0.9996799,0.0001104212,0.0000127628,0.00003783415,0.000112871,0.00004617931],"domain_scores_gemma":[0.9990343,0.0005046953,0.0001039503,0.0001423417,0.0001613732,0.00005330245],"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.0001732014,0.0001579618,0.001173068,0.00009874526,0.00002407372,0.00008119211,0.00008085759,0.9203528,0.01880568,0.02146278,0.001205635,0.03638414],"study_design_scores_gemma":[0.000008501469,0.00001930911,0.00005582324,0.0000016306,0.000001203052,0.00000381252,0.000007122059,0.9963298,0.00238048,0.0009213181,0.0002686052,0.000002274761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1923068,0.0002468802,0.7968689,0.0003519643,0.0001020103,0.00009347015,0.00006315556,0.0007788938,0.009187945],"genre_scores_gemma":[0.7365183,0.00009294847,0.2603191,0.000072349,0.00001725514,0.00008604087,0.00009527635,0.0002903038,0.002508544],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003492464,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1983085277","doi":"10.1002/nla.642","title":"A twisted factorization method for symmetric SVD of a complex symmetric tridiagonal matrix","year":2009,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Blind Source Separation Techniques","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":"McMaster University","funders":"","keywords":"Tridiagonal matrix; Orthogonality; Singular value decomposition; Mathematics; Matrix decomposition; QR decomposition; Singular value; Factorization; FLOPS; Matrix (chemical analysis); Divide and conquer algorithms; Symmetric matrix; Applied mathematics; Incomplete LU factorization; Algebra over a field; Algorithm; Pure mathematics; Computer science; Parallel computing; Geometry","authors":[{"name":"Wei Xu","is_ca":false},{"name":"Sanzheng Qiao","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02501987492455005,"gpt":0.3326721764473136,"spread":0.3076523015227635,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007293417,0.0008656515,0.000722678,0.0008847496,0.0005192989,0.000810094,0.0007721268,0.0005081251,0.007360427],"category_scores_gemma":[0.002814984,0.0002746225,0.0008451613,0.0006636601,0.0009228161,0.001161659,0.001130284,0.0009637388,0.002661404],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003209524,"about_ca_system_score_gemma":0.0009266179,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001783507,"about_ca_topic_score_gemma":0.001907623,"domain_scores_codex":[0.9995659,0.0001322384,0.00002894672,0.00005108827,0.0001844352,0.00003739866],"domain_scores_gemma":[0.9991658,0.0003120647,0.00006255075,0.0001556208,0.0002485689,0.00005545301],"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.0002988657,0.00008033512,0.000798249,0.0004006946,0.0001119823,0.000507195,0.0004775214,0.2504093,0.05009967,0.1559035,0.007060463,0.5338522],"study_design_scores_gemma":[0.00002840986,0.00006228669,0.00007861087,0.00002273995,0.00001341723,0.0001494327,0.00005154365,0.9578059,0.007782415,0.02906569,0.004917511,0.00002207351],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001759057,0.00002885729,0.9976053,0.00001564876,0.00002373107,0.00001440569,0.00001226243,0.0001553616,0.0003852652],"genre_scores_gemma":[0.05288935,0.0001323775,0.945217,0.00003322234,0.00003771614,0.00007249841,0.00008519564,0.0001429801,0.001389649],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007360427,"threshold_uncertainty_score":0.0246231,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2111507332","doi":"10.1002/nla.1837","title":"Steepest descent preconditioning for nonlinear GMRES optimization","year":2012,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":25,"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; Lawrence Livermore National Laboratory; U.S. Department of Energy","keywords":"Generalized minimal residual method; Mathematics; Gradient descent; Method of steepest descent; Nonlinear conjugate gradient method; Mathematical optimization; Conjugate gradient method; Optimization problem; Line search; Convergence (economics); Nonlinear system; Applied mathematics; Iterative method; Computer science; Artificial neural network","authors":[{"name":"Hans De Sterck","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04170620897805142,"gpt":0.3519899076566608,"spread":0.3102836986786093,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005125419,0.0006567836,0.0006110484,0.0002987489,0.0003258341,0.0004881751,0.0005110652,0.0005812052,0.004066003],"category_scores_gemma":[0.001635179,0.0002194841,0.0005301946,0.0003006261,0.0006848635,0.0004346048,0.0009099633,0.0009818934,0.001585496],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003654318,"about_ca_system_score_gemma":0.001020772,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001823554,"about_ca_topic_score_gemma":0.001992876,"domain_scores_codex":[0.9995928,0.0001536331,0.00002015572,0.00005848956,0.0001463106,0.00002860518],"domain_scores_gemma":[0.9995766,0.000119245,0.00005067075,0.00008752433,0.0001396724,0.00002629281],"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.0001675147,0.0000511165,0.0007878319,0.0005346697,0.00006098068,0.0003504806,0.0001917917,0.6468144,0.04634269,0.1212301,0.01295063,0.1705178],"study_design_scores_gemma":[0.000009293209,0.00003373562,0.000130908,0.00001734585,0.000004427713,0.0000425642,0.000009816736,0.9742708,0.005455111,0.01176987,0.008243883,0.00001226948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005502185,0.0001852766,0.988602,0.0001600957,0.00009793978,0.00003386584,0.00005102347,0.0003615072,0.005006201],"genre_scores_gemma":[0.3271456,0.0007927475,0.656772,0.0002703909,0.0002007159,0.0002531896,0.0003373292,0.0004000245,0.01382797],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004066003,"threshold_uncertainty_score":0.01360208,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2988137070","doi":"10.1002/nla.2297","title":"Nesterov acceleration of alternating least squares for canonical tensor decomposition: Momentum step size selection and restart mechanisms","year":2020,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":23,"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":"Acceleration; Mathematics; Gradient descent; Nonlinear system; Conjugate gradient method; Robustness (evolution); Tensor (intrinsic definition); Nonlinear conjugate gradient method; Mathematical optimization; Line search; Applied mathematics; Algorithm; Rate of convergence; Computer science; Artificial intelligence; Geometry; Key (lock)","authors":[{"name":"Drew Mitchell","is_ca":false},{"name":"Nan Ye","is_ca":false},{"name":"Hans De Sterck","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03470059674419496,"gpt":0.3201134359785043,"spread":0.2854128392343093,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001035386,0.00104502,0.0005439444,0.0004814342,0.0004191282,0.0005940571,0.0009692596,0.0006874897,0.002652851],"category_scores_gemma":[0.00416643,0.0004007327,0.0005554336,0.0004375844,0.0005775771,0.0008500974,0.001000149,0.001236758,0.001307349],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004515206,"about_ca_system_score_gemma":0.001078062,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004962014,"about_ca_topic_score_gemma":0.006731092,"domain_scores_codex":[0.999371,0.0001911365,0.00003768373,0.00008667742,0.0002634963,0.00005000818],"domain_scores_gemma":[0.9987179,0.0004061178,0.0001373955,0.0002421817,0.0004217828,0.00007459177],"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.0002897524,0.00008893152,0.002175408,0.000177391,0.0001067348,0.0001676151,0.0002315493,0.5511095,0.02858108,0.03824332,0.007709098,0.3711197],"study_design_scores_gemma":[0.000006923703,0.00001733609,0.0001264677,0.000005397783,0.000002957876,0.00001576951,0.000005432828,0.9933864,0.003140253,0.0018892,0.001396487,0.000007319404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01253497,0.0001618106,0.9842743,0.0001255083,0.00007000534,0.00002833258,0.00003149261,0.001128276,0.001645268],"genre_scores_gemma":[0.2348076,0.0002291039,0.7579418,0.0001470714,0.00006148503,0.0001468508,0.0002215976,0.0004971687,0.005947255],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004962014,"threshold_uncertainty_score":0.009866297,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2336877474","doi":"10.1002/nla.2047","title":"Preconditioning a mass‐conserving discontinuous Galerkin discretization of the Stokes equations","year":2016,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":23,"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; National Science Foundation","keywords":"Preconditioner; Multigrid method; Discretization; Mathematics; Saddle point; Discontinuous Galerkin method; Finite element method; Applied mathematics; Navier–Stokes equations; Linear system; Galerkin method; Saddle; Relaxation (psychology); Block (permutation group theory); Mathematical analysis; Mathematical optimization; Compressibility; Partial differential equation; Geometry; Physics","authors":[{"name":"James H. Adler","is_ca":false},{"name":"Thomas R. Benson","is_ca":false},{"name":"Scott MacLachlan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01127663032184782,"gpt":0.2477752979146314,"spread":0.2364986675927836,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003068282,0.0003362914,0.0004726316,0.000178992,0.0002330025,0.00045402,0.0004477205,0.0004885438,0.001904133],"category_scores_gemma":[0.0008478792,0.0001621208,0.0002502831,0.000197883,0.0004786635,0.000230255,0.0005558427,0.0005507124,0.0002433765],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002296258,"about_ca_system_score_gemma":0.0007117596,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001985696,"about_ca_topic_score_gemma":0.001508852,"domain_scores_codex":[0.999804,0.00006930122,0.000009240286,0.00002622395,0.00006961434,0.00002159128],"domain_scores_gemma":[0.999703,0.0001417951,0.0000378413,0.0000397924,0.00005516636,0.00002232098],"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.0001834912,0.00009890406,0.001008671,0.0001248034,0.00002259561,0.0001343089,0.000138059,0.8789634,0.04431392,0.02655078,0.001807788,0.04665333],"study_design_scores_gemma":[0.00001281531,0.00002579956,0.0001121772,0.000002311629,0.000001867268,0.000009168768,0.000005280221,0.9953152,0.002512354,0.00125428,0.0007465901,0.000002250878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1453756,0.0001118616,0.8472807,0.0002028694,0.0000914233,0.00006317253,0.0001296802,0.0004610076,0.006283675],"genre_scores_gemma":[0.7645078,0.00007939697,0.2313741,0.00006334589,0.00004398005,0.00009169422,0.0001662339,0.0000738227,0.003599545],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001985696,"threshold_uncertainty_score":0.006369948,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1992234740","doi":"10.1002/nla.782","title":"Parallel numerical solution of the time‐harmonic Maxwell equations in mixed form","year":2011,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","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 British Columbia","funders":"","keywords":"Multigrid method; Discretization; Mathematics; Curl (programming language); Solver; Finite element method; Preconditioner; Maxwell's equations; Polygon mesh; Iterative method; Applied mathematics; Electromagnetic field solver; Mathematical analysis; Partial differential equation; Algorithm; Geometry; Computer science; Mathematical optimization; Physics","authors":[{"name":"Dan Li","is_ca":true},{"name":"Chen Greif","is_ca":true},{"name":"Dominik Schötzau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03025319188831007,"gpt":0.266435190812476,"spread":0.2361819989241659,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003147394,0.0004915168,0.0006537576,0.0002723184,0.0003029488,0.0005767533,0.0006796398,0.0004195145,0.002275802],"category_scores_gemma":[0.0007952505,0.0002771174,0.0004453082,0.0003342005,0.0004712936,0.0006413278,0.0009705552,0.0004112733,0.0005038307],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002649583,"about_ca_system_score_gemma":0.0005859455,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001529281,"about_ca_topic_score_gemma":0.001256494,"domain_scores_codex":[0.999797,0.00004151699,0.00000937087,0.00002334082,0.0001049633,0.00002365102],"domain_scores_gemma":[0.999679,0.00009839831,0.00004316985,0.00006864031,0.00008363749,0.00002725427],"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.0001203804,0.00007936816,0.0009190021,0.00009640989,0.00005851583,0.0002592375,0.000105534,0.8751758,0.02888524,0.04390914,0.002151598,0.04823973],"study_design_scores_gemma":[0.0000137405,0.00001236716,0.00007657234,0.000001747759,0.000002888961,0.00001962396,0.000005130316,0.9941865,0.001999932,0.00276967,0.0009085666,0.000003187001],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1040131,0.0001972269,0.8763393,0.0002823628,0.00009698285,0.00007370942,0.0001245531,0.0008186686,0.01805415],"genre_scores_gemma":[0.6333237,0.000212798,0.3567685,0.00009199596,0.00007514394,0.0002055337,0.0002090459,0.0001860654,0.008927242],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002275802,"threshold_uncertainty_score":0.007613301,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2806424598","doi":"10.1002/nla.2147","title":"Local Fourier analysis of block‐structured multigrid relaxation schemes for the Stokes equations","year":2018,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Advanced Numerical Methods in Computational Mathematics","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":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multigrid method; Discretization; Relaxation (psychology); Mathematics; Block (permutation group theory); Convergence (economics); Applied mathematics; Saddle point; Fourier transform; Saddle; Finite element method; Mathematical optimization; Algorithm; Partial differential equation; Mathematical analysis; Geometry; Physics","authors":[{"name":"Yunhui He","is_ca":true},{"name":"Scott MacLachlan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01966037727123458,"gpt":0.3040190220013343,"spread":0.2843586447300997,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009922246,0.0003521407,0.0003636187,0.0004551529,0.0002579321,0.0004570161,0.0004510094,0.0004544088,0.001530332],"category_scores_gemma":[0.002078852,0.0001655738,0.0004370929,0.0002266899,0.0005960092,0.0005617831,0.0005007297,0.0005969281,0.0002959249],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003211759,"about_ca_system_score_gemma":0.0004806845,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001853718,"about_ca_topic_score_gemma":0.0008672515,"domain_scores_codex":[0.9997725,0.00009857358,0.000008282062,0.0000166651,0.00008152576,0.00002252509],"domain_scores_gemma":[0.999059,0.0004618925,0.0001084698,0.00007208025,0.0002554906,0.00004309966],"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.0001519429,0.00007696752,0.0009412863,0.0001461808,0.00003008976,0.00006939822,0.0002196324,0.8481712,0.0332758,0.08164148,0.001036675,0.03423936],"study_design_scores_gemma":[0.000003127116,0.000009682964,0.00007611702,0.000002487497,0.000001452297,0.000003777314,0.00000736023,0.9972844,0.000970541,0.001420176,0.000218021,0.000002916734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08633382,0.0002433289,0.9094437,0.0001845839,0.00003256636,0.00004358259,0.00003875939,0.0001536624,0.003526006],"genre_scores_gemma":[0.8453157,0.000405782,0.1481326,0.00008100129,0.00004914345,0.0001598989,0.0001375659,0.0001941984,0.005523967],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001853718,"threshold_uncertainty_score":0.005247414,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963626304","doi":"10.1002/nla.1963","title":"A nonlinearly preconditioned conjugate gradient algorithm for rank‐<i>R</i> canonical tensor approximation","year":2014,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":19,"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":"Laboratory Directed Research and Development; Natural Sciences and Engineering Research Council of Canada; Lawrence Livermore National Laboratory; U.S. Department of Energy","keywords":"Preconditioner; Conjugate gradient method; Convergence (economics); Mathematics; Rank (graph theory); Tensor (intrinsic definition); Acceleration; Nonlinear conjugate gradient method; Nonlinear system; Algorithm; Applied mathematics; Mathematical optimization; Computer science; Iterative method; Pure mathematics; Gradient descent; Combinatorics; Artificial intelligence; Artificial neural network","authors":[{"name":"Hans De Sterck","is_ca":true},{"name":"Manda Winlaw","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01939508976469891,"gpt":0.2887760599794227,"spread":0.2693809702147238,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009164944,0.0009378429,0.0007364334,0.000493917,0.0004624056,0.0008783579,0.000976389,0.0009052016,0.004719144],"category_scores_gemma":[0.002859632,0.0003501706,0.00078026,0.0005788427,0.0009303245,0.0007337058,0.00126691,0.001600966,0.002123911],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006253195,"about_ca_system_score_gemma":0.001988116,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006477968,"about_ca_topic_score_gemma":0.005986226,"domain_scores_codex":[0.9993734,0.0002202234,0.00003991072,0.0001045149,0.0001913045,0.00007071319],"domain_scores_gemma":[0.9989557,0.000400567,0.00009674492,0.000171885,0.0003006647,0.00007447234],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002165773,0.000113157,0.001069322,0.000197482,0.00005918361,0.0001817732,0.0002029096,0.6603172,0.01706739,0.06990583,0.01065051,0.2400187],"study_design_scores_gemma":[0.000009691052,0.00001757874,0.00005269067,0.000004525018,0.000002278416,0.00001873712,0.00000754657,0.9929479,0.001641512,0.004119522,0.001172356,0.000005689632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00496142,0.00005782132,0.9928125,0.0001266605,0.00003925393,0.00003596129,0.00002961471,0.0004861726,0.001450774],"genre_scores_gemma":[0.1070498,0.0001202645,0.8881336,0.00009887305,0.00005517471,0.0001219346,0.0002160515,0.000319425,0.003884733],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006477968,"threshold_uncertainty_score":0.01578707,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3006898615","doi":"10.1002/nla.2285","title":"Two‐level Fourier analysis of multigrid for higher‐order finite‐element discretizations of the Laplacian","year":2020,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":19,"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","keywords":"Multigrid method; Smoothing; Finite element method; Applied mathematics; Relaxation (psychology); Mathematics; Grid; Convergence (economics); Mathematical optimization; Laplace operator; Fourier analysis; Fourier transform; Partial differential equation; Computer science; Algorithm; Mathematical analysis; Geometry","authors":[{"name":"Yunhui He","is_ca":true},{"name":"Scott MacLachlan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03753276415587457,"gpt":0.3065091364014927,"spread":0.2689763722456182,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001083751,0.0003079177,0.0002929695,0.0006143285,0.000426007,0.0006967139,0.0004375521,0.0004414189,0.002259151],"category_scores_gemma":[0.002978976,0.0001639589,0.0004923766,0.00027936,0.0006777698,0.0007762641,0.0006317132,0.0009177348,0.0004293947],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004956295,"about_ca_system_score_gemma":0.0005691105,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002506637,"about_ca_topic_score_gemma":0.001959552,"domain_scores_codex":[0.9997098,0.0001016517,0.00001292464,0.00002149786,0.0001261338,0.00002810768],"domain_scores_gemma":[0.9986641,0.0006561711,0.00009867732,0.0002221578,0.0003140074,0.00004477432],"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.0001424071,0.0001233037,0.002554717,0.0001438291,0.00003645571,0.0001426396,0.0004468123,0.7181607,0.03936058,0.1482942,0.002176189,0.08841819],"study_design_scores_gemma":[0.000001809163,0.000004386225,0.0001254439,0.000002495971,7.605547e-7,0.000004867974,0.000008375494,0.9954579,0.001311716,0.002696853,0.0003825329,0.000002789831],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04480457,0.00006790468,0.9511802,0.0001883374,0.00003613558,0.00003055923,0.00002405983,0.0003177671,0.003350474],"genre_scores_gemma":[0.7353993,0.0001131454,0.2599157,0.00008614553,0.00003033959,0.0001121654,0.00009408707,0.0003648934,0.003884221],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002506637,"threshold_uncertainty_score":0.007557631,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1840032205","doi":"10.1002/nla.1823","title":"On condition numbers for Moore–Penrose inverse and linear least squares problem involving Kronecker products","year":2012,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Kronecker product; Mathematics; Kronecker delta; Combinatorics; Moore–Penrose pseudoinverse; Inverse; Rank (graph theory); Linear least squares; Least-squares function approximation; Product (mathematics); Condition number; Applied mathematics; Upper and lower bounds; Matrix (chemical analysis); Linear model; Statistics; Mathematical analysis; Geometry","authors":[{"name":"Huaian Diao","is_ca":false},{"name":"Weiguo Wang","is_ca":false},{"name":"Yimin Wei","is_ca":false},{"name":"Sanzheng Qiao","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01265069169889564,"gpt":0.2548747174177887,"spread":0.242224025718893,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00838121,0.001691294,0.00120941,0.00235037,0.001028229,0.003554712,0.001682975,0.00183861,0.01034016],"category_scores_gemma":[0.04769444,0.0006568203,0.0007478701,0.001630521,0.004714347,0.00774918,0.002725134,0.00469366,0.002453918],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001361458,"about_ca_system_score_gemma":0.001671343,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001205463,"about_ca_topic_score_gemma":0.001118722,"domain_scores_codex":[0.9950788,0.001986249,0.0002436027,0.000586107,0.001781454,0.0003237473],"domain_scores_gemma":[0.9560767,0.03326536,0.002246604,0.002074111,0.005407988,0.0009290659],"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.0003731269,0.0000934403,0.001220709,0.0005273558,0.00004406077,0.0002376639,0.0002822194,0.1333966,0.01146884,0.7967519,0.005351761,0.05025233],"study_design_scores_gemma":[0.00001630534,0.00007628604,0.000384989,0.0001304129,0.00001314525,0.0001072451,0.00007433631,0.7273915,0.007621608,0.2616406,0.002476816,0.00006667869],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02231846,0.001062461,0.9648126,0.0006435435,0.0001238208,0.00005170833,0.0001553953,0.0002132714,0.01061873],"genre_scores_gemma":[0.4595287,0.002267594,0.5231252,0.0005322347,0.0004556984,0.0006309741,0.0007714462,0.0005766476,0.01211132],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01034016,"threshold_uncertainty_score":0.04432458,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1636009176","doi":"10.1002/nla.800","title":"Fast multilevel methods for Markov chains","year":2011,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":17,"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":"Israel Science Foundation","keywords":"Markov chain; Speedup; Residual; Mathematics; Algorithm; Iterative method; Markov process; Applied mathematics; Markov model; Computer science; Mathematical optimization; Parallel computing; Statistics","authors":[{"name":"Hans De Sterck","is_ca":true},{"name":"Killian Miller","is_ca":true},{"name":"Eran Treister","is_ca":false},{"name":"Irad Yavneh","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02959064902754927,"gpt":0.3115063589447691,"spread":0.2819157099172198,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009060731,0.0004553391,0.0007535883,0.0007289519,0.0006247233,0.0008108701,0.0009416442,0.0007493626,0.00563101],"category_scores_gemma":[0.003837039,0.0003468518,0.0009088529,0.0007933197,0.0005555101,0.0008120447,0.001459835,0.001509601,0.001384006],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006700098,"about_ca_system_score_gemma":0.001210728,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004073597,"about_ca_topic_score_gemma":0.004204821,"domain_scores_codex":[0.9993363,0.0002524014,0.00002638791,0.00004849815,0.0002796724,0.00005657104],"domain_scores_gemma":[0.9984363,0.0008403021,0.0001136529,0.0002178602,0.0003131588,0.00007878193],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006838573,0.0000416305,0.0007634929,0.0002734177,0.00009681033,0.0001165789,0.0002158042,0.5838642,0.004442969,0.2954907,0.006266069,0.10836],"study_design_scores_gemma":[0.000009919888,0.000007157071,0.00006530813,0.00001351254,0.000003979197,0.00001213212,0.000009062066,0.9645569,0.0004125836,0.03198172,0.002921365,0.000006211379],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004528983,0.0003587512,0.9907041,0.000191856,0.00006427884,0.00004191505,0.0001103607,0.0003156965,0.003684123],"genre_scores_gemma":[0.2371739,0.0009540973,0.7521833,0.0001759505,0.0001576359,0.0004803585,0.0004021294,0.0004398223,0.008032754],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00563101,"threshold_uncertainty_score":0.01883757,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2113559515","doi":"10.1002/nla.757","title":"An efficient hierarchical preconditioner for quadratic discretizations of finite element problems","year":2010,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":15,"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":"Preconditioner; Multigrid method; Krylov subspace; Finite element method; Discretization; Solver; Mathematics; Applied mathematics; Mathematical optimization; Robustness (evolution); Iterative method; Linear system; Polygon mesh; Computer science; Quadratic equation; Algorithm; Partial differential equation; Mathematical analysis","authors":[{"name":"A. El maliki","is_ca":true},{"name":"R. Guénette","is_ca":true},{"name":"M. Fortin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01151573169547392,"gpt":0.2890850281962522,"spread":0.2775692965007783,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008194732,0.0004227863,0.0004443863,0.0003633877,0.0003637548,0.0003602355,0.0007250821,0.0005807984,0.003339217],"category_scores_gemma":[0.00169015,0.0002330303,0.000532635,0.0005268122,0.0004621946,0.00063633,0.001143536,0.001053342,0.001150377],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002798447,"about_ca_system_score_gemma":0.0009663353,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002712437,"about_ca_topic_score_gemma":0.003846391,"domain_scores_codex":[0.9993345,0.0001624411,0.00003198838,0.0000503901,0.0003665002,0.00005408244],"domain_scores_gemma":[0.9994987,0.000153201,0.00004598533,0.0001052134,0.0001584346,0.00003843845],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001463263,0.000111825,0.00089109,0.0004403364,0.00005170823,0.0002640591,0.0002961859,0.541279,0.08913897,0.09224033,0.01131321,0.263827],"study_design_scores_gemma":[0.00002028996,0.00003618633,0.0002221547,0.000006998688,0.000004748583,0.00004592078,0.00001361609,0.9801136,0.006779769,0.004953945,0.007793099,0.000009589777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004313064,0.00004978871,0.9937485,0.00006357515,0.00003725885,0.00003010642,0.00004966844,0.0003413495,0.001366688],"genre_scores_gemma":[0.09740592,0.000117593,0.8981194,0.00008388334,0.00004423842,0.0001137574,0.000270516,0.0001813877,0.003663161],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003339217,"threshold_uncertainty_score":0.01117086,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2018978449","doi":"10.1002/nla.640","title":"Backward perturbation analysis for scaled total least‐squares problems","year":2009,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Statistical and numerical algorithms","field":"Mathematics","cited_by":15,"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":"Ordinary least squares; Mathematics; Perturbation (astronomy); Upper and lower bounds; Least-squares function approximation; Applied mathematics; Mathematical optimization; Statistics; Mathematical analysis","authors":[{"name":"Xiaohui Chang","is_ca":true},{"name":"David Titley-Péloquin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02843203753759685,"gpt":0.302662501843118,"spread":0.2742304643055211,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004084817,0.001298023,0.0009490141,0.0009626371,0.0005835693,0.001089078,0.0009549004,0.001126771,0.003578395],"category_scores_gemma":[0.01390301,0.0005181314,0.0008846375,0.0006473193,0.001679571,0.001412385,0.002325477,0.002051409,0.0006533755],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001106459,"about_ca_system_score_gemma":0.001095534,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003045722,"about_ca_topic_score_gemma":0.001480527,"domain_scores_codex":[0.9976331,0.001263509,0.00008050604,0.0001901396,0.0007446362,0.00008816397],"domain_scores_gemma":[0.9907871,0.007208427,0.0004177165,0.0002947302,0.001132182,0.0001597743],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001166551,0.00003705419,0.0006995327,0.0002254744,0.00006835989,0.0001780531,0.00008855146,0.8608255,0.004076719,0.1031551,0.00234634,0.02818278],"study_design_scores_gemma":[0.00000411306,0.00001030769,0.00005565567,0.00001055351,0.000003363724,0.00001147154,0.000008417249,0.9761524,0.0005758145,0.02266836,0.0004945892,0.000004957031],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003700356,0.0001785914,0.9942043,0.0002383757,0.00004040769,0.00002713214,0.00003220777,0.00008050965,0.001498049],"genre_scores_gemma":[0.4348768,0.001182499,0.5493016,0.0005466893,0.0002835969,0.0006364951,0.0005515792,0.0004676297,0.01215305],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004084817,"threshold_uncertainty_score":0.02160281,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2163749311","doi":"10.1002/nla.811","title":"A Markov‐modulated fluid flow queueing model under <i>D</i>‐policy","year":2011,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Idle; Markov chain; Queueing theory; Markov process; Fluid queue; Mathematical optimization; Mathematics; Flow (mathematics); Computer science; Applied mathematics; Statistics; Operating system","authors":[{"name":"Jung Woo Baek","is_ca":true},{"name":"Ho Woo Lee","is_ca":false},{"name":"Se Won Lee","is_ca":false},{"name":"Soohan Ahn","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01708096428007033,"gpt":0.235374970001567,"spread":0.2182940057214967,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001398019,0.0006997001,0.00111013,0.0005622633,0.0007471431,0.00180406,0.001539359,0.001529515,0.002074831],"category_scores_gemma":[0.003023068,0.0005041511,0.0007068952,0.0005887507,0.001438283,0.001448899,0.0008420355,0.001053495,0.0002883633],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002657803,"about_ca_system_score_gemma":0.001821551,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02053357,"about_ca_topic_score_gemma":0.005429685,"domain_scores_codex":[0.9989395,0.0002982398,0.00003807656,0.000196605,0.0001897209,0.0003378772],"domain_scores_gemma":[0.9986406,0.000557915,0.0002960846,0.00008100243,0.0002474609,0.0001769365],"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.0001610702,0.00008372707,0.001061253,0.00004717838,0.00002591489,0.0002457341,0.0001014294,0.9131634,0.002600482,0.07719268,0.001055445,0.004261738],"study_design_scores_gemma":[0.00001099612,0.00001275424,0.00008124354,0.000002363946,0.000004622215,0.00000830544,0.000007744284,0.9956694,0.0001140598,0.003959392,0.0001223769,0.000006834436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3314651,0.0007987376,0.6488269,0.002519757,0.0002335352,0.0001603422,0.0005256482,0.0004547631,0.01501517],"genre_scores_gemma":[0.9875508,0.0001828445,0.007854911,0.00009290575,0.00005973118,0.00005576102,0.00006356568,0.0000154008,0.004124135],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02053357,"threshold_uncertainty_score":0.04082811,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2338260032","doi":"10.1002/nla.2050","title":"Towards an optimal condition number of certain augmented Lagrangian‐type saddle‐point matrices","year":2016,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":11,"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","keywords":"Mathematics; Invertible matrix; Saddle point; Eigenvalues and eigenvectors; Augmented Lagrangian method; Rank (graph theory); Block (permutation group theory); Matrix (chemical analysis); Saddle; Applied mathematics; Type (biology); Singular value decomposition; Combinatorics; Block matrix; Lagrangian; Singular value; Pure mathematics; Mathematical optimization; Algorithm; Geometry","authors":[{"name":"Ron Estrin","is_ca":true},{"name":"Chen Greif","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009549939276433841,"gpt":0.2723625157209429,"spread":0.2628125764445091,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001747702,0.001032474,0.0007088042,0.0007550447,0.0004706207,0.001118177,0.0007352785,0.0009169788,0.003462798],"category_scores_gemma":[0.005135449,0.0005685377,0.0003826069,0.0003950459,0.001263424,0.001235104,0.000973855,0.0009951276,0.0004897841],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008555427,"about_ca_system_score_gemma":0.001181007,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001060822,"about_ca_topic_score_gemma":0.001042983,"domain_scores_codex":[0.9996767,0.00016187,0.0000104989,0.00004286241,0.00007222463,0.0000358687],"domain_scores_gemma":[0.9985649,0.0008445921,0.0001860093,0.00009035038,0.0002105037,0.0001036565],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001088912,0.00006003213,0.0004587212,0.0001635649,0.00004025423,0.0001045067,0.0000954761,0.6485856,0.01158119,0.3245847,0.002370524,0.01184655],"study_design_scores_gemma":[0.00000642869,0.00002542504,0.000091173,0.00001390756,0.00000355849,0.00001213945,0.00001391066,0.9590865,0.001008629,0.0393829,0.000346327,0.000009052496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07178549,0.0002560508,0.9158143,0.0003758506,0.00003532078,0.00004871734,0.00008077631,0.0001331683,0.01147034],"genre_scores_gemma":[0.8006534,0.0004262873,0.1925064,0.0001408233,0.00005163558,0.0002432851,0.0001773649,0.0002828116,0.005517988],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003462798,"threshold_uncertainty_score":0.01158416,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2013095747","doi":"10.1002/nla.242","title":"A divide and conquer approach to computing the mean first passage matrix for Markov chains via Perron complement reductions","year":2001,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Markov chain; FLOPS; Block matrix; Partition (number theory); Matrix multiplication; Combinatorics; Ergodic theory; Complement (music); Matrix (chemical analysis); Divide and conquer algorithms; Diagonal; Discrete mathematics; Computation; Algorithm; Parallel computing; Computer science; Pure mathematics","authors":[{"name":"Stephen Kirkland","is_ca":true},{"name":"Michael Neumann","is_ca":false},{"name":"Jianhong Xu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01515081388627167,"gpt":0.2651078357017424,"spread":0.2499570218154707,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001743376,0.0007983556,0.001192252,0.001582809,0.001107948,0.001232253,0.001319395,0.001006997,0.00519427],"category_scores_gemma":[0.005735911,0.0005543877,0.0008631179,0.001114441,0.001747732,0.002269824,0.001417775,0.001693025,0.0008990334],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001297578,"about_ca_system_score_gemma":0.001673336,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005456619,"about_ca_topic_score_gemma":0.00735388,"domain_scores_codex":[0.99911,0.0003640431,0.00003222668,0.0001100256,0.000265698,0.0001178612],"domain_scores_gemma":[0.9973889,0.001854423,0.0001277655,0.0002612965,0.0002707992,0.00009678683],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000522463,0.0002046159,0.0008262415,0.0001746612,0.0001006544,0.0001820361,0.0002567527,0.5494545,0.006671585,0.2464114,0.003092748,0.1921023],"study_design_scores_gemma":[0.00002611064,0.00001664071,0.00004518447,0.000005180344,0.000005561229,0.00001168221,0.00001266946,0.9367864,0.001605578,0.0609507,0.0005273577,0.000007008857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0224529,0.0001034474,0.974069,0.0001749766,0.00002358186,0.00004616656,0.00003738903,0.0006438886,0.002448785],"genre_scores_gemma":[0.2430436,0.00009340774,0.7532601,0.0001104133,0.00005152683,0.0002543349,0.0001300502,0.0002239097,0.002832674],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005456619,"threshold_uncertainty_score":0.0173766,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2146675507","doi":"10.1002/nla.1999","title":"A cyclic algorithm for maximum likelihood estimation using Schur complement","year":2015,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Traffic Prediction and Management Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Centre interuniversitaire de recherche sur les reseaux d'entreprise, la logistique et le transport","keywords":"Hessian matrix; Schur complement; Coordinate descent; Mathematics; Complement (music); Algorithm; Mathematical optimization; Matrix (chemical analysis); Block (permutation group theory); Schur decomposition; System of linear equations; Hessian equation; Transformation (genetics); Applied mathematics; Linear system; Descent (aeronautics); Eigenvalues and eigenvectors; Partial differential equation","authors":[{"name":"Assi N’Guessan","is_ca":false},{"name":"Issa Cherif Geraldo","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02318148606959327,"gpt":0.2715561412659055,"spread":0.2483746551963122,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002963735,0.001030576,0.001260657,0.001596157,0.000987235,0.001313608,0.001878474,0.001421417,0.008280056],"category_scores_gemma":[0.01227169,0.0007831365,0.001028692,0.001699145,0.001394575,0.001401382,0.002640403,0.002501456,0.001923371],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001466395,"about_ca_system_score_gemma":0.003886555,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01020864,"about_ca_topic_score_gemma":0.01120458,"domain_scores_codex":[0.9980515,0.0009493824,0.00009219399,0.0002696667,0.0005073383,0.0001299314],"domain_scores_gemma":[0.9954025,0.003110813,0.0002235078,0.00042502,0.0007137376,0.0001244309],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001621601,0.00009288892,0.0005231108,0.0001285221,0.00007009785,0.0001114345,0.0001655331,0.6307506,0.003990108,0.1265232,0.004957347,0.2325251],"study_design_scores_gemma":[0.00001141144,0.00001472011,0.00004780974,0.000006625117,0.00000273192,0.00001390141,0.000007547823,0.9810241,0.000587746,0.01733511,0.0009390239,0.000009289206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001354784,0.00003611574,0.9977634,0.00005834773,0.00001131127,0.00003745796,0.0000243738,0.0001588122,0.0005553839],"genre_scores_gemma":[0.06221389,0.00008636663,0.9350207,0.00008371564,0.0000463366,0.0003751712,0.0002272669,0.0001773161,0.00176919],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01020864,"threshold_uncertainty_score":0.02769959,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2108510172","doi":"10.1002/nla.1995","title":"Spectral recycling strategies for the solution of nonlinear eigenproblems in thermoacoustics","year":2015,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Combustion and flame dynamics","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Krylov subspace; Solver; Nonlinear system; Generalized minimal residual method; Eigenvalues and eigenvectors; Block (permutation group theory); Chebyshev filter; Arnoldi iteration; Mathematics; Stability (learning theory); Computer science; Applied mathematics; Integrator; Mathematical optimization; Iterative method; Algorithm; Mathematical analysis","authors":[{"name":"Pablo Salas","is_ca":false},{"name":"Luc Giraud","is_ca":false},{"name":"Yousef Saad","is_ca":false},{"name":"Stéphane Moreau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01994205781747695,"gpt":0.2485625784271067,"spread":0.2286205206096297,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008740449,0.0005884329,0.00053228,0.0005929202,0.0004524786,0.0007234625,0.0007106084,0.0006682879,0.002884549],"category_scores_gemma":[0.001873315,0.0003246859,0.0004690961,0.000409291,0.001029199,0.0008127844,0.001299585,0.0007571522,0.0008928848],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003940426,"about_ca_system_score_gemma":0.000672407,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001531502,"about_ca_topic_score_gemma":0.001688569,"domain_scores_codex":[0.9997283,0.0001149981,0.00001739235,0.00002202773,0.00009505417,0.00002220939],"domain_scores_gemma":[0.9994045,0.0002857445,0.00005650335,0.00008780135,0.0001367494,0.00002864674],"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.000146602,0.0001483296,0.000480459,0.0003175646,0.00006287591,0.0001299215,0.0003312394,0.669524,0.02388932,0.1760435,0.001642022,0.1272842],"study_design_scores_gemma":[0.00001032702,0.00002676792,0.00003598522,0.00001565062,0.000005082045,0.00001581411,0.00002455861,0.9809264,0.002889862,0.01463342,0.001409167,0.000006944014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03588686,0.0007927933,0.9533575,0.0001959747,0.00004485852,0.00006885346,0.00002272223,0.0002671807,0.009363231],"genre_scores_gemma":[0.5282192,0.00114144,0.4606949,0.0001223048,0.00005240364,0.0002852569,0.00007230999,0.0002508468,0.009161339],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002884549,"threshold_uncertainty_score":0.009649754,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2166356498","doi":"10.1002/nla.787","title":"On the perturbation of the Q‐factor of the QR factorization","year":2011,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":8,"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":"Perturbation (astronomy); Mathematics; Invertible matrix; Factorization; Applied mathematics; Combinatorics; Pure mathematics; Algorithm; Physics; Quantum mechanics","authors":[{"name":"Xiaohui Chang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01687156204401739,"gpt":0.2127217399330281,"spread":0.1958501778890108,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004502464,0.001342765,0.0007143877,0.001164862,0.0005087902,0.001334649,0.0005760544,0.0006903306,0.003313821],"category_scores_gemma":[0.01893734,0.0003456403,0.0006380599,0.0006046264,0.002813564,0.002426874,0.002269518,0.002420056,0.001269646],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009195374,"about_ca_system_score_gemma":0.0008336854,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001365856,"about_ca_topic_score_gemma":0.000446198,"domain_scores_codex":[0.9962168,0.001741677,0.0001033243,0.0003235993,0.001372596,0.000241946],"domain_scores_gemma":[0.9874797,0.008227094,0.0008556325,0.001184167,0.001938593,0.0003146916],"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.0005432234,0.00007864105,0.001399218,0.0003201007,0.0001042924,0.0004910976,0.0003199195,0.418189,0.03392775,0.473385,0.005778699,0.06546305],"study_design_scores_gemma":[0.000007513989,0.0000838025,0.0004621841,0.0000458612,0.00001072303,0.0001259972,0.00004875488,0.8673813,0.008149683,0.1212515,0.00239802,0.00003455571],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0116222,0.0003814558,0.9820769,0.0003560258,0.00009622755,0.00003050274,0.00006651771,0.0001746462,0.005195493],"genre_scores_gemma":[0.7342249,0.0019602,0.2518767,0.0007154925,0.0005463223,0.0002684632,0.0004003086,0.0005081082,0.009499446],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004502464,"threshold_uncertainty_score":0.02381158,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3092221604","doi":"10.1002/nla.2337","title":"Minimizing convex quadratics with variable precision conjugate gradients","year":2020,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Agence Nationale de la Recherche","keywords":"Mathematics; Conjugate gradient method; Context (archaeology); Computation; Conjugate; Quadratic equation; Matrix (chemical analysis); Mathematical optimization; Regular polygon; Variable (mathematics); Convex optimization; Applied mathematics; Algorithm; Mathematical analysis; Geometry","authors":[{"name":"Serge Gratton","is_ca":false},{"name":"Ehouarn Simon","is_ca":false},{"name":"David Titley-Péloquin","is_ca":true},{"name":"Philippe L. Toint","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04017474802119845,"gpt":0.3171565609560845,"spread":0.2769818129348861,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002619691,0.0008186459,0.001011136,0.0004794197,0.0003467749,0.001352337,0.0007178892,0.0008510525,0.001747298],"category_scores_gemma":[0.009643325,0.0004088129,0.0003821666,0.0006296287,0.001707103,0.001216391,0.001388189,0.001470659,0.0004660195],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007929584,"about_ca_system_score_gemma":0.001065142,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00160354,"about_ca_topic_score_gemma":0.001285627,"domain_scores_codex":[0.9989427,0.0005721984,0.00002682087,0.0001067974,0.0002862309,0.00006524228],"domain_scores_gemma":[0.9972474,0.001840546,0.0002109442,0.0002856228,0.0003346898,0.00008085911],"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.0001105122,0.00002802749,0.0002506879,0.0001019625,0.00003527881,0.00005382302,0.00005840533,0.8590746,0.003781101,0.1035456,0.001602756,0.03135725],"study_design_scores_gemma":[0.000006628292,0.00001911926,0.00003499588,0.000004842605,0.000001980531,0.000006830784,0.000003439533,0.9849195,0.0008862377,0.01377145,0.0003410917,0.00000385855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01616641,0.0002515632,0.9807767,0.0003404157,0.00005693838,0.00002009601,0.00001430367,0.0001100038,0.002263564],"genre_scores_gemma":[0.6348909,0.0005058144,0.3580291,0.0001993001,0.0001345628,0.0001214742,0.00006995363,0.0002625599,0.00578632],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002619691,"threshold_uncertainty_score":0.01385444,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2170774163","doi":"10.1002/nla.1825","title":"Hermitian‐type generalized singular value decomposition with applications","year":2012,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Shanghai Municipal Education Commission; National Natural Science Foundation of China; McGill University; Natural Science Foundation of Shanghai","keywords":"Hermitian matrix; Mathematics; Hermitian function; Singular value decomposition; Matrix (chemical analysis); Matrix function; Rank (graph theory); Pure mathematics; Algebra over a field; Applied mathematics; Symmetric matrix; Mathematical analysis; Combinatorics; Algorithm; Physics","authors":[{"name":"Yonghui Liu","is_ca":false},{"name":"Yongge Tian","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009507974454374934,"gpt":0.2641563078538695,"spread":0.2546483333994945,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008324895,0.0007902386,0.0005368338,0.000637303,0.0002533121,0.0007534074,0.0004775857,0.0003928095,0.003677427],"category_scores_gemma":[0.002433691,0.0002118611,0.000600369,0.0009794519,0.0008665394,0.0008091165,0.00111452,0.001137497,0.0008185628],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003081682,"about_ca_system_score_gemma":0.0004162155,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007259892,"about_ca_topic_score_gemma":0.0007020978,"domain_scores_codex":[0.9994381,0.0002432502,0.00003189634,0.00007788991,0.0001736142,0.00003521931],"domain_scores_gemma":[0.9992821,0.0002139316,0.00006856649,0.0001094974,0.000279061,0.00004686578],"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.00003381267,0.00004155504,0.0003617842,0.0001542837,0.0000395424,0.0001647536,0.0001061535,0.08954181,0.004354047,0.8052554,0.005858524,0.09408846],"study_design_scores_gemma":[0.000009227525,0.00003567712,0.0002302268,0.00002427973,0.000007395238,0.0001273127,0.00003581498,0.5285364,0.001121671,0.461395,0.008462345,0.0000145833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005964012,0.0007345363,0.9851993,0.0002500686,0.0001508817,0.00002548489,0.00004833868,0.00008250352,0.007544789],"genre_scores_gemma":[0.4953852,0.00275445,0.4872297,0.0003332044,0.0008109494,0.0001429627,0.0002650234,0.000167266,0.0129112],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003677427,"threshold_uncertainty_score":0.01230222,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4403584193","doi":"10.1002/nla.2593","title":"Multigrid Reduction‐In‐Time Convergence for Advection Problems: A Fourier Analysis Perspective","year":2024,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":5,"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; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multigrid method; Mathematics; Reduction (mathematics); Advection; Convergence (economics); Perspective (graphical); Fourier transform; Fourier analysis; Applied mathematics; Mathematical optimization; Partial differential equation; Mathematical analysis; Geometry","authors":[{"name":"Hans De Sterck","is_ca":true},{"name":"Stephanie Friedhoff","is_ca":false},{"name":"Oliver A. Krzysik","is_ca":true},{"name":"Scott MacLachlan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01327935357970048,"gpt":0.3005640920308566,"spread":0.2872847384511561,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002281688,0.0007492454,0.000584794,0.001227847,0.0004541542,0.001325956,0.0009757315,0.0009929111,0.00308064],"category_scores_gemma":[0.005277297,0.0002894361,0.001050436,0.0005577735,0.002228552,0.001563336,0.001948592,0.002931909,0.0006672528],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008176297,"about_ca_system_score_gemma":0.0007952387,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002069283,"about_ca_topic_score_gemma":0.0008848277,"domain_scores_codex":[0.9992662,0.0003073494,0.00003148333,0.00006389419,0.0002827078,0.00004838323],"domain_scores_gemma":[0.997549,0.001462147,0.0001637552,0.0002484025,0.0004978095,0.00007895973],"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.00004380072,0.00006052009,0.0006907727,0.0001809876,0.00004007572,0.0001373577,0.0002413259,0.2234101,0.008691326,0.7348468,0.00293695,0.02872006],"study_design_scores_gemma":[0.000006280068,0.00001453538,0.0001337498,0.00001875343,0.000003757532,0.00003737235,0.00002653566,0.8922259,0.001594652,0.1023921,0.003536813,0.000009522993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01147304,0.0008199626,0.9743202,0.001335073,0.0001566775,0.00003081301,0.0000337456,0.000116661,0.01171366],"genre_scores_gemma":[0.557551,0.002482857,0.4186666,0.0005934473,0.0005773376,0.000251187,0.0001960271,0.0006229342,0.01905864],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00308064,"threshold_uncertainty_score":0.01206684,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2067594519","doi":"10.1002/nla.428","title":"Asymptotic properties of the <i>QR</i> factorization of banded Hessenberg–Toeplitz matrices","year":2005,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"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":"Toeplitz matrix; Mathematics; QR decomposition; Factorization; Diagonal; Matrix decomposition; Matrix (chemical analysis); Combinatorics; Applied mathematics; Algebra over a field; Pure mathematics; Algorithm; Eigenvalues and eigenvectors; Geometry","authors":[{"name":"Xiao-Wen Chang","is_ca":true},{"name":"Martin J. Gander","is_ca":false},{"name":"Samir Karaa","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008905594285361623,"gpt":0.2126713604533317,"spread":0.20376576616797,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001990018,0.0005376029,0.0004094047,0.0005299513,0.0002993973,0.000868508,0.0004624193,0.0004318408,0.004847203],"category_scores_gemma":[0.01373373,0.0003094548,0.0003046069,0.0003771091,0.0014619,0.00144876,0.0007673286,0.0008304885,0.001168774],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00052776,"about_ca_system_score_gemma":0.0006319191,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002109669,"about_ca_topic_score_gemma":0.001230216,"domain_scores_codex":[0.9993147,0.0002576156,0.00002883823,0.00008270224,0.0002356267,0.00008050819],"domain_scores_gemma":[0.994967,0.002583728,0.0006391695,0.0006536933,0.00097471,0.0001816105],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003679301,0.00007495579,0.002310853,0.0002829941,0.00005450182,0.0003467898,0.0004380244,0.5236498,0.03132753,0.3827491,0.004103674,0.05429387],"study_design_scores_gemma":[0.00001132995,0.00005002756,0.0005035609,0.00002957704,0.000005091305,0.00008531094,0.0000579822,0.9534612,0.003977871,0.04054306,0.001258177,0.00001683145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07559112,0.0003295949,0.916478,0.000253544,0.00004776963,0.00003464784,0.00008523373,0.000455653,0.00672438],"genre_scores_gemma":[0.8426095,0.0005024538,0.1509002,0.0001257305,0.00007406481,0.00009370575,0.0003360714,0.000239098,0.005119293],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004847203,"threshold_uncertainty_score":0.0162155,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4385694302","doi":"10.1002/nla.2529","title":"Impact of correlated observation errors on the conditioning of variational data assimilation problems","year":2023,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Meteorological Phenomena and Simulations","field":"Earth and Planetary Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"European Commission; Institut national de recherche en informatique et en automatique (INRIA)","keywords":"Data assimilation; Mathematics; Covariance; Weighting; Applied mathematics; Covariance matrix; Condition number; Rate of convergence; Non-linear least squares; Matrix (chemical analysis); Convergence (economics); Diagonal; Conjugate gradient method; Algorithm; Mathematical optimization; Eigenvalues and eigenvectors; Statistics; Computer science; Estimation theory; Key (lock)","authors":[{"name":"Olivier Goux","is_ca":false},{"name":"Selime Gürol","is_ca":false},{"name":"Anthony Weaver","is_ca":false},{"name":"Youssef Diouane","is_ca":true},{"name":"Oliver Guillet","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07422935551257316,"gpt":0.2880792033795224,"spread":0.2138498478669493,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007507319,0.0008588855,0.001026513,0.0005459709,0.0009291295,0.0017534,0.0008078049,0.001367597,0.001445429],"category_scores_gemma":[0.03604736,0.0008529245,0.0007525177,0.0004001924,0.002609626,0.001856788,0.002319853,0.002347355,0.0001825731],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001039186,"about_ca_system_score_gemma":0.002116392,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01185874,"about_ca_topic_score_gemma":0.004650095,"domain_scores_codex":[0.9972722,0.001487767,0.0001515589,0.0003282915,0.0005021059,0.0002581005],"domain_scores_gemma":[0.9623948,0.0302949,0.00244945,0.001824796,0.002486363,0.0005498184],"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.0001449977,0.00004144523,0.004137908,0.00007158451,0.00006710336,0.00014508,0.0001313686,0.9608557,0.004330517,0.02291512,0.0005515916,0.006607694],"study_design_scores_gemma":[0.000009083567,0.00001413838,0.0004807664,0.00001061599,0.000005350991,0.000007688823,0.00001054534,0.9946725,0.001405497,0.003259705,0.0001151031,0.000009092313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2900723,0.0007209216,0.7011446,0.001528282,0.000177382,0.00009586762,0.0001581041,0.0004467625,0.005655727],"genre_scores_gemma":[0.9552739,0.0002560522,0.04288742,0.0001758727,0.00005137328,0.00007657299,0.0001560894,0.0002336718,0.0008890931],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01185874,"threshold_uncertainty_score":0.03970301,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3183856668","doi":"10.1002/nla.2399","title":"ODE‐based double‐preconditioning for solving linear systems Aαx=b and f(A)x=b","year":2021,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"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; Carleton University; Statistics Canada","funders":"","keywords":"Ode; Mathematics; Linear system; Computation; Applied mathematics; Ordinary differential equation; Extension (predicate logic); Matrix (chemical analysis); Linear differential equation; System of linear equations; Coefficient matrix; Algebraic number; Algebra over a field; Algorithm; Differential equation; Pure mathematics; Mathematical analysis; Computer science","authors":[{"name":"Xavier Antoine","is_ca":false},{"name":"Emmanuel Lorin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01619017058013841,"gpt":0.2607405617680234,"spread":0.244550391187885,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003342136,0.0003449293,0.0005520712,0.0002605201,0.0002523036,0.0003395176,0.0003757372,0.0004545938,0.002567762],"category_scores_gemma":[0.0008776681,0.0001326811,0.0002885503,0.0002472968,0.0004580589,0.0003678253,0.0006224684,0.000707666,0.0004178018],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002750692,"about_ca_system_score_gemma":0.0007445737,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002190375,"about_ca_topic_score_gemma":0.002450378,"domain_scores_codex":[0.999868,0.00003393817,0.000007775584,0.00001448698,0.00005236812,0.00002342499],"domain_scores_gemma":[0.9997427,0.00009369722,0.00002346068,0.00003635616,0.00007344812,0.00003036165],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002797894,0.00015768,0.001337028,0.0003968379,0.00006324935,0.0002920066,0.0002332353,0.6888878,0.09337112,0.0595455,0.003433771,0.152002],"study_design_scores_gemma":[0.00001014818,0.00003512255,0.0001461306,0.000006210973,0.000003234208,0.00002118972,0.000008891541,0.9888362,0.007426728,0.001864672,0.001636989,0.000004461083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04710496,0.0001221925,0.9470642,0.0001495638,0.000112248,0.0000398496,0.0000692027,0.0004148477,0.004922907],"genre_scores_gemma":[0.5819402,0.0002067009,0.4099239,0.00007481001,0.00007528524,0.0001183127,0.0002120105,0.0001649501,0.00728379],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002567762,"threshold_uncertainty_score":0.008590043,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4389941500","doi":"10.1002/nla.2543","title":"Generalizing reduction‐based algebraic multigrid","year":2023,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"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","keywords":"Mathematics; Diagonally dominant matrix; Multigrid method; Applied mathematics; Robustness (evolution); Discretization; Condition number; Mathematical optimization; Bounded function; Algorithm; Mathematical analysis; Pure mathematics; Partial differential equation","authors":[{"name":"Tareq Uz Zaman","is_ca":true},{"name":"Nicolas Nytko","is_ca":false},{"name":"Ali Taghibakhshi","is_ca":false},{"name":"Scott MacLachlan","is_ca":true},{"name":"Luke N. Olson","is_ca":false},{"name":"Matthew West","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01617655189294508,"gpt":0.2601246523332715,"spread":0.2439481004403264,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008042656,0.0007144017,0.0007655111,0.001171015,0.0004426774,0.000769877,0.001207857,0.0008377164,0.003463404],"category_scores_gemma":[0.003213746,0.0003095241,0.00103267,0.0005554717,0.001276689,0.000655702,0.002854767,0.001492498,0.001208311],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000567703,"about_ca_system_score_gemma":0.0006189602,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003162258,"about_ca_topic_score_gemma":0.002945004,"domain_scores_codex":[0.9993311,0.0001737461,0.00002544482,0.00008820663,0.0003325038,0.00004893928],"domain_scores_gemma":[0.9991327,0.0002741978,0.00004967303,0.0002649351,0.0002414234,0.00003704784],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006789467,0.00007359657,0.0005667743,0.0001381939,0.00005039646,0.00009235075,0.0001684514,0.7487857,0.01243648,0.1671006,0.003323397,0.06719624],"study_design_scores_gemma":[0.000006101628,0.00001179514,0.00003994197,0.000004629274,0.00000254168,0.00001379873,0.000006454341,0.9754157,0.0009300199,0.02003474,0.003530643,0.00000360388],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008733402,0.00008460882,0.9817886,0.0001656838,0.00009765646,0.00008103807,0.00004836347,0.0005517708,0.008448929],"genre_scores_gemma":[0.3258981,0.0002881338,0.663382,0.0003136038,0.0001874018,0.000275214,0.0003627758,0.000721342,0.008571534],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003463404,"threshold_uncertainty_score":0.01158631,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4366774998","doi":"10.1002/nla.2500","title":"A closed‐form multigrid smoothing factor for an additive Vanka‐type smoother applied to the Poisson equation","year":2023,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Numerical methods in engineering","field":"Engineering","cited_by":5,"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","keywords":"Mathematics; Poisson's equation; Smoothing; Finite element method; Mathematical analysis; Multigrid method; Applied mathematics; Discretization; Discrete Poisson equation; Partial differential equation; Mixed finite element method; Mass matrix; Laplace's equation","authors":[{"name":"Chen Greif","is_ca":true},{"name":"Yunhui He","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03566184032007813,"gpt":0.2983817119453563,"spread":0.2627198716252782,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002036794,0.000570429,0.0005589083,0.0006017232,0.0005398734,0.001074836,0.001059328,0.001226957,0.003103989],"category_scores_gemma":[0.005456834,0.0003388743,0.0007152696,0.0004205291,0.001062106,0.001145074,0.00126,0.001306924,0.0006626791],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007842806,"about_ca_system_score_gemma":0.001241884,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002928628,"about_ca_topic_score_gemma":0.003224962,"domain_scores_codex":[0.9994296,0.0001551116,0.00002489151,0.00008038057,0.0002555832,0.00005433052],"domain_scores_gemma":[0.9986524,0.0006114912,0.00009135291,0.0001538641,0.0004094575,0.00008157294],"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.0002269136,0.0001679826,0.001505549,0.0002719748,0.00008280962,0.0001743021,0.0003801987,0.4598847,0.04124914,0.3744731,0.00314317,0.1184402],"study_design_scores_gemma":[0.000007208596,0.00001851915,0.00007512711,0.00001094143,0.000006038312,0.00001879325,0.00001272673,0.9872366,0.001966228,0.009216512,0.001421885,0.000009373814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007211728,0.00007890067,0.9912875,0.00009069122,0.00005542183,0.0000245439,0.00001180591,0.000120034,0.001119309],"genre_scores_gemma":[0.3625959,0.0002931767,0.6295881,0.0001941594,0.00008575675,0.0001735393,0.00009243777,0.0003802005,0.006596573],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003103989,"threshold_uncertainty_score":0.01077175,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2605276264","doi":"10.1002/nla.2095","title":"A stabilized multigrid solver for hyperelastic image registration","year":2017,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":4,"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; Discretization; Mathematics; Hyperelastic material; Hessian matrix; Solver; Applied mathematics; Mathematical optimization; Regularization (linguistics); Partial differential equation; Finite element method; Computer science; Mathematical analysis; Artificial intelligence","authors":[{"name":"Lars Ruthotto","is_ca":false},{"name":"Chen Greif","is_ca":true},{"name":"Jan Modersitzki","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02607809847944596,"gpt":0.3188376433450104,"spread":0.2927595448655644,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006053572,0.0004824722,0.0006211397,0.0005079694,0.0003905663,0.0006787854,0.0009578381,0.001584686,0.002966237],"category_scores_gemma":[0.001636481,0.0003629404,0.0005902835,0.0004056656,0.0006617352,0.0005327645,0.001419865,0.001061064,0.000638711],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000534322,"about_ca_system_score_gemma":0.0009648026,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002860639,"about_ca_topic_score_gemma":0.002852895,"domain_scores_codex":[0.9997223,0.00009117899,0.00001536379,0.00004345567,0.0001065723,0.00002108906],"domain_scores_gemma":[0.9995559,0.0002020375,0.00004913794,0.00006364382,0.00009842805,0.00003094053],"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.00008014184,0.00005540906,0.0005079816,0.00006862776,0.00002717346,0.0001526664,0.0001301199,0.918695,0.01634662,0.02716745,0.001832828,0.034936],"study_design_scores_gemma":[0.000004903289,0.000004421375,0.00002287063,0.000001589508,7.903665e-7,0.000006333001,0.00000409407,0.9974862,0.0006080261,0.001380327,0.000478586,0.000001763093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01353464,0.0000558658,0.983656,0.0001572043,0.0000292723,0.00003858353,0.00004998054,0.0003503393,0.002128014],"genre_scores_gemma":[0.3204751,0.00007562795,0.6727248,0.0001230326,0.00003589856,0.0002132124,0.0002453337,0.000360892,0.005746162],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002966237,"threshold_uncertainty_score":0.009923041,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2128985516","doi":"10.1002/nla.1826","title":"Finding off‐diagonal entries of the inverse of a large symmetric sparse matrix","year":2012,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Diagonal; Inverse; Mathematics; Diagonal matrix; Node (physics); Matrix (chemical analysis); Combinatorics; Vertex (graph theory); Algorithm; Block matrix; Band matrix; Square matrix; Symmetric matrix; Eigenvalues and eigenvectors; Geometry; Graph","authors":[{"name":"Shawn C. Eastwood","is_ca":true},{"name":"Justin W. L. Wan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01242476064321722,"gpt":0.2608739387652651,"spread":0.2484491781220479,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004908455,0.0004916487,0.0004534467,0.0006601863,0.0003286682,0.0005234308,0.0005420904,0.0003389753,0.002859745],"category_scores_gemma":[0.00272875,0.0002705351,0.0005069437,0.0003065238,0.0007134805,0.0008513611,0.0008608158,0.0006717246,0.0006689592],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003030661,"about_ca_system_score_gemma":0.0006427492,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001369936,"about_ca_topic_score_gemma":0.002033343,"domain_scores_codex":[0.9997074,0.00005911534,0.00001581419,0.00004301615,0.0001441836,0.00003044048],"domain_scores_gemma":[0.9990595,0.0004561964,0.0001091366,0.0001188077,0.0002042759,0.00005220555],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003519856,0.0001462581,0.003749196,0.0003627618,0.00006825108,0.0006997627,0.0006414152,0.4026173,0.1293945,0.1543752,0.006252195,0.3013411],"study_design_scores_gemma":[0.00002055013,0.0000766899,0.0004416083,0.00001379211,0.000007068263,0.0001693508,0.00006628779,0.9455926,0.01870918,0.03191042,0.002975772,0.00001658951],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03190982,0.00002955499,0.9658684,0.00006782613,0.00002065403,0.00002760058,0.00003127579,0.0002807337,0.001764108],"genre_scores_gemma":[0.3289505,0.00006960615,0.6674333,0.00005424879,0.00002371677,0.0000545382,0.000171366,0.0001389923,0.003103709],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002859745,"threshold_uncertainty_score":0.009566784,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2945974182","doi":"10.1002/nla.2271","title":"Convergence analysis for parallel‐in‐time solution of hyperbolic systems","year":2019,"lang":"en","type":"preprint","venue":"Numerical Linear Algebra with Applications","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":3,"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; Verafin (Canada); University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multigrid method; Partial differential equation; Applied mathematics; Mathematics; Fourier analysis; Convergence (economics); Spacetime; Algebraic number; Fourier transform; Dimension (graph theory); Computer science; Mathematical optimization; Mathematical analysis; Physics","authors":[{"name":"Hans De Sterck","is_ca":true},{"name":"Stephanie Friedhoff","is_ca":false},{"name":"Alexander J. M. Howse","is_ca":true},{"name":"Scott MacLachlan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0241027217736144,"gpt":0.2951315000422264,"spread":0.271028778268612,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002055133,0.0006087329,0.0005846886,0.0009335864,0.0004827073,0.0008354266,0.0006793487,0.0005331688,0.002717122],"category_scores_gemma":[0.005867607,0.0001861521,0.0007737203,0.0002885368,0.001555091,0.0007459984,0.001685929,0.001119991,0.000378778],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006792697,"about_ca_system_score_gemma":0.0007642297,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003499979,"about_ca_topic_score_gemma":0.001278312,"domain_scores_codex":[0.9993151,0.0002456366,0.00003074022,0.00004746983,0.0002993527,0.00006166413],"domain_scores_gemma":[0.997068,0.00150427,0.0002109778,0.000265942,0.0008536547,0.00009716737],"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.0001562338,0.00008788629,0.00161714,0.000157784,0.00004852487,0.0001182656,0.000254269,0.7400946,0.008610308,0.2285593,0.001405135,0.0188906],"study_design_scores_gemma":[0.00000393755,0.0000089754,0.00007234618,0.00000376886,0.000002084463,0.000006616241,0.00001190746,0.9843277,0.0006398853,0.01450731,0.0004129401,0.000002452428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0701269,0.0002386168,0.9145623,0.0005949995,0.000103203,0.00009535188,0.000079089,0.0002437681,0.01395574],"genre_scores_gemma":[0.8318714,0.0003826005,0.1566796,0.0001456033,0.0001037286,0.0002840606,0.0001990828,0.0003638541,0.009970015],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003499979,"threshold_uncertainty_score":0.01086873,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4253510993","doi":"10.1002/nla.258.abs","title":"On the growth factor in Gaussian elimination for generalized Higham matrices","year":2002,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Gaussian elimination; Positive-definite matrix; Hermitian matrix; Mathematics; Gaussian; Matrix (chemical analysis); Class (philosophy); Factor (programming language); Combinatorics; Pure mathematics; Computer science; Physics; Chemistry","authors":[{"name":"Alan D. George","is_ca":true},{"name":"Khakim D. Ikramov","is_ca":false},{"name":"Andrey B. Kucherov","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01661374818348609,"gpt":0.2450198333137332,"spread":0.2284060851302471,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004600713,0.001612219,0.0009940545,0.00180981,0.001484975,0.001879205,0.001185575,0.001560279,0.006416315],"category_scores_gemma":[0.03267874,0.0004527883,0.0007313442,0.001305121,0.005008751,0.004897421,0.003160141,0.003185742,0.002068197],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001469733,"about_ca_system_score_gemma":0.00121336,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002340176,"about_ca_topic_score_gemma":0.002145685,"domain_scores_codex":[0.9976393,0.0009304945,0.00006528758,0.0001939602,0.0007925316,0.0003784911],"domain_scores_gemma":[0.9761752,0.01777582,0.001149991,0.001448279,0.002457295,0.0009935505],"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.0003950225,0.00008211745,0.002137784,0.000248274,0.00003978635,0.0004223321,0.0004497728,0.05486995,0.006325887,0.8826679,0.009374245,0.04298699],"study_design_scores_gemma":[0.00004098464,0.0001149757,0.0005417627,0.0001022589,0.00002252815,0.0003709684,0.0001158228,0.3362243,0.005967466,0.6511624,0.005264387,0.00007214779],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1580901,0.004227336,0.7850611,0.00330046,0.0006380026,0.0001247787,0.0001898103,0.0008170773,0.04755138],"genre_scores_gemma":[0.8842868,0.003705249,0.08714555,0.0008821543,0.0007027683,0.0002668326,0.0003515847,0.0005959399,0.02206312],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006416315,"threshold_uncertainty_score":0.02433121,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2154024134","doi":"10.1002/nla.337","title":"Irreversible Markov processes for phylogenetic models","year":2003,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Evolution and Paleontology Studies","field":"Earth and Planetary Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Markov chain; Markov process; Time reversibility; Markov model; Mathematics; Diversification (marketing strategy); Process (computing); Computer science; Algorithm; Statistical physics; Theoretical computer science; Applied mathematics; Mathematical economics; Markov property; Statistics; Programming language","authors":[{"name":"Erich Bohl","is_ca":false},{"name":"Peter Lancaster","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02116604428217539,"gpt":0.2362803065339344,"spread":0.2151142622517591,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002597592,0.0007394066,0.0006950516,0.001072571,0.0007796484,0.001615684,0.001189549,0.001447997,0.007996399],"category_scores_gemma":[0.01019394,0.0003182437,0.001016277,0.0007731012,0.002320311,0.002034645,0.001739506,0.002469835,0.0009136238],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00149641,"about_ca_system_score_gemma":0.0008983463,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003599115,"about_ca_topic_score_gemma":0.002278049,"domain_scores_codex":[0.9990075,0.0005075241,0.00004173141,0.0001224981,0.0002348049,0.00008595391],"domain_scores_gemma":[0.9960656,0.002790583,0.0004259063,0.0002195428,0.0003281558,0.0001702249],"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.000006799153,0.000009350522,0.000209391,0.00002820612,0.000008356086,0.0000500786,0.00007839392,0.1090381,0.0001872632,0.8864663,0.0007321713,0.00318564],"study_design_scores_gemma":[0.000004904733,0.000004630172,0.00005337873,0.000007650458,0.000002862876,0.00001623525,0.00001308536,0.3928619,0.00006361889,0.6057338,0.001230851,0.000007047851],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0284432,0.001205754,0.9474665,0.002124096,0.000180225,0.00006027386,0.0002180265,0.0002424064,0.02005954],"genre_scores_gemma":[0.8547075,0.00220351,0.1121506,0.0006188501,0.0005593498,0.0004449903,0.000507445,0.0001931,0.02861459],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007996399,"threshold_uncertainty_score":0.02675068,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3137409987","doi":"10.1002/nla.2426","title":"Low‐order preconditioning of the Stokes equations","year":2021,"lang":"en","type":"preprint","venue":"Numerical Linear Algebra with Applications","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":3,"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; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Nuclear Security Administration; Office of Science; Advanced Scientific Computing Research; Sandia National Laboratories; U.S. Department of Energy","keywords":"Multigrid method; Discretization; Preconditioner; Order (exchange); Mathematics; Stokes flow; Mathematical analysis; Geometry; Partial differential equation; Linear system; Flow (mathematics)","authors":[{"name":"Alexey Voronin","is_ca":false},{"name":"Yunhui He","is_ca":true},{"name":"Scott MacLachlan","is_ca":true},{"name":"Luke N. Olson","is_ca":false},{"name":"Ray Tuminaro","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01827425167728905,"gpt":0.2851458680345385,"spread":0.2668716163572494,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006835926,0.0005322942,0.0005719638,0.0004536605,0.0003619099,0.000821903,0.000483047,0.0006001207,0.004473376],"category_scores_gemma":[0.002666655,0.0002061449,0.000421332,0.0003144964,0.001247377,0.000663742,0.001393486,0.001093053,0.0009255109],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004113802,"about_ca_system_score_gemma":0.0008557413,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001642783,"about_ca_topic_score_gemma":0.001441959,"domain_scores_codex":[0.9992404,0.0002754731,0.0000341832,0.00007742545,0.0002986405,0.00007385114],"domain_scores_gemma":[0.9990397,0.0003536612,0.0001247088,0.0002091543,0.0002109337,0.00006181693],"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.0001555019,0.00007696968,0.001088736,0.0002043371,0.00003304728,0.0001731374,0.0002255902,0.613088,0.06260522,0.2527141,0.004454623,0.06518073],"study_design_scores_gemma":[0.00001432562,0.00002856548,0.0001686649,0.000007975073,0.000002576135,0.00002085109,0.00001145554,0.9704399,0.010029,0.01582301,0.003447549,0.000006287054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06031263,0.0001784475,0.9234053,0.0003640443,0.0001971184,0.00005781879,0.00008708557,0.0005893069,0.01480824],"genre_scores_gemma":[0.7104074,0.0002634189,0.2806399,0.0001946951,0.0001376438,0.0001083901,0.0002236638,0.0002659981,0.007758916],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004473376,"threshold_uncertainty_score":0.014965,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4405384795","doi":"10.1002/nla.2608","title":"Quaternion Tensor Completion via <scp>QR</scp> Decomposition and Nuclear Norm Minimization","year":2024,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":3,"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":"Fundo para o Desenvolvimento das Ciências e da Tecnologia; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Quaternion; Singular value decomposition; Robustness (evolution); Mathematics; Tensor (intrinsic definition); Matrix completion; Matrix norm; Mathematical optimization; Matrix decomposition; Minification; Singular value; Generalization; Algorithm; Computer science; Artificial intelligence; Mathematical analysis; Pure mathematics; Geometry; Eigenvalues and eigenvectors","authors":[{"name":"Jian Sun","is_ca":false},{"name":"Xin Liu","is_ca":false},{"name":"Yang Zhang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01797523011889221,"gpt":0.2937145160819113,"spread":0.2757392859630191,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014325,0.001244281,0.0008574573,0.0008611172,0.0003244943,0.0009718965,0.0008858969,0.0005893545,0.003101217],"category_scores_gemma":[0.003409641,0.0003098974,0.001055161,0.0009677971,0.001432947,0.001440747,0.001592761,0.001892211,0.00105153],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005533649,"about_ca_system_score_gemma":0.001379049,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004459111,"about_ca_topic_score_gemma":0.002327945,"domain_scores_codex":[0.9991063,0.000330078,0.00005512255,0.0001830637,0.000266377,0.00005895721],"domain_scores_gemma":[0.9986933,0.0003415408,0.0001869135,0.0002364769,0.0004234308,0.000118287],"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.0001352581,0.00009038336,0.0008175325,0.0003728433,0.00009141598,0.0002095612,0.0002298347,0.4636521,0.019211,0.3078708,0.01297173,0.1943475],"study_design_scores_gemma":[0.000005794317,0.00002593796,0.0000843531,0.000007432236,0.000004189465,0.00003347315,0.00001507422,0.9733896,0.001746024,0.0227587,0.001917616,0.00001179032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002007484,0.00006992082,0.9971629,0.00007262501,0.00003424231,0.00001619607,0.00003655435,0.00009560727,0.0005043627],"genre_scores_gemma":[0.1629498,0.0005866671,0.8310306,0.0001528618,0.0001973429,0.0001588401,0.0005844964,0.000303033,0.004036481],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004459111,"threshold_uncertainty_score":0.01037467,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2970518087","doi":"10.1002/nla.2306","title":"A local Fourier analysis of additive Vanka relaxation for the Stokes equations","year":2020,"lang":"en","type":"preprint","venue":"Numerical Linear Algebra with Applications","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":2,"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":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Multigrid method; Discretization; Relaxation (psychology); Convergence (economics); Grid; Applied mathematics; Finite element method; Mathematical optimization; Computer science; Fourier transform; Fourier analysis; Partial differential equation; Algorithm; Mathematics; Mathematical analysis; Geometry; Physics","authors":[{"name":"Patrick E. Farrell","is_ca":false},{"name":"Yunhui He","is_ca":true},{"name":"Scott MacLachlan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03410598634867729,"gpt":0.3163663646694529,"spread":0.2822603783207757,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007352371,0.0004119704,0.0002894839,0.0004520413,0.0002953525,0.0006502703,0.0005320239,0.0004292668,0.001792057],"category_scores_gemma":[0.002022533,0.0001675404,0.0004689946,0.0001693602,0.000753196,0.0007523065,0.0007853041,0.0009296382,0.0003736018],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003151681,"about_ca_system_score_gemma":0.0003303936,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001197499,"about_ca_topic_score_gemma":0.0008309445,"domain_scores_codex":[0.9997396,0.0001041552,0.000007203789,0.00002687859,0.00009390697,0.00002832462],"domain_scores_gemma":[0.9993297,0.0003540836,0.00007335248,0.00005857318,0.0001502888,0.00003398925],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001537424,0.00009894497,0.001116313,0.0001722059,0.00003563341,0.0001322512,0.0002740182,0.6814913,0.05904941,0.2002252,0.001729225,0.05552179],"study_design_scores_gemma":[0.000002850963,0.00001679867,0.0001001232,0.000004746508,0.000002559968,0.00001332787,0.00001761689,0.9928021,0.002092026,0.004436745,0.0005059481,0.000005128006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08776328,0.0003465606,0.9038283,0.0002515007,0.00005704027,0.00003675828,0.00003249886,0.0001729695,0.007510988],"genre_scores_gemma":[0.8612633,0.0003690445,0.1302181,0.0001085282,0.00008051423,0.0001007481,0.00007129426,0.000224616,0.007563721],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001792057,"threshold_uncertainty_score":0.005994976,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2105813930","doi":"10.1002/nla.730","title":"A note on simultaneous preconditioning and symmetrization of non-symmetric linear systems","year":2010,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":2,"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; Killam Trusts","keywords":"Symmetrization; Mathematics; Duality (order theory); Applied mathematics; Partial differential equation; Linear system; Scheme (mathematics); Iterative method; Mathematical optimization; Mathematical analysis; Pure mathematics","authors":[{"name":"Nassif Ghoussoub","is_ca":true},{"name":"Amir Moradifam","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008644112826970859,"gpt":0.2754375070949733,"spread":0.2667933942680024,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001741364,0.0008672617,0.0008419445,0.0003578173,0.0004934994,0.0006243346,0.0009094073,0.0008567938,0.00302713],"category_scores_gemma":[0.003289974,0.000387261,0.001009733,0.0004806501,0.001776164,0.001623272,0.002468232,0.002612587,0.000779088],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001980346,"about_ca_system_score_gemma":0.0006583736,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005581168,"about_ca_topic_score_gemma":0.0009388676,"domain_scores_codex":[0.9990525,0.0003975318,0.00006134776,0.000114125,0.0003116216,0.0000628136],"domain_scores_gemma":[0.9987656,0.0005242592,0.000094057,0.0003937391,0.0001315531,0.00009075616],"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.0002464566,0.0001347778,0.0007492963,0.0008602576,0.0001197846,0.001054725,0.0008546773,0.08072479,0.07455769,0.6486235,0.0129156,0.1791585],"study_design_scores_gemma":[0.00008066903,0.0002955804,0.0005699613,0.00006147327,0.00006157102,0.0005068218,0.00006312233,0.627252,0.03214724,0.2979888,0.04089964,0.00007314752],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006156684,0.0006811531,0.9890265,0.0004714431,0.0004663419,0.00004921985,0.00002541992,0.000174707,0.002948515],"genre_scores_gemma":[0.1495106,0.001966273,0.8400999,0.0005294788,0.0008597708,0.0002481636,0.00009356718,0.0003813984,0.006310936],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00302713,"threshold_uncertainty_score":0.01012677,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1984710842","doi":"10.1002/nla.240","title":"Lanczos, Householder transformations, and implicit deflation for fast and reliable dominant singular subspace computation","year":2001,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"University of California, San Diego; California State University San Marcos; McGill University; University of California Berkeley","keywords":"Lanczos resampling; Lanczos algorithm; Linear subspace; Mathematics; Computation; Krylov subspace; Subspace topology; Matrix (chemical analysis); Singular value; Signal subspace; Algorithm; Numerical linear algebra; Applied mathematics; Algebra over a field; Sparse matrix; Singular spectrum analysis; Singular value decomposition; Eigenvalues and eigenvectors; Pure mathematics; Mathematical analysis; Computer science; Numerical analysis; Iterative method; Noise (video); Artificial intelligence","authors":[{"name":"Ricardo D. Fierro","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009264214916319834,"gpt":0.2428126637843949,"spread":0.2335484488680751,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008492375,0.0006318812,0.0006224921,0.0004696353,0.000439532,0.0007287428,0.0006677054,0.0005209873,0.003729773],"category_scores_gemma":[0.004012063,0.0003087602,0.0003190585,0.0008318718,0.0007053716,0.001166262,0.0009280651,0.0008507602,0.001541096],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003731517,"about_ca_system_score_gemma":0.001016965,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003710185,"about_ca_topic_score_gemma":0.004633211,"domain_scores_codex":[0.9994857,0.0001868343,0.0000340902,0.00003885027,0.000216939,0.00003748446],"domain_scores_gemma":[0.9989385,0.0004464898,0.0001112527,0.000230592,0.0002231343,0.00005004888],"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.0004759471,0.00007965229,0.0009653967,0.0002388121,0.00007484076,0.0002916382,0.0003847297,0.3822567,0.03263201,0.1191153,0.01172414,0.4517608],"study_design_scores_gemma":[0.00003290422,0.00003058044,0.00007774585,0.000006097213,0.000003934063,0.00002826039,0.00001112844,0.983291,0.004540211,0.009233357,0.002735949,0.000008815284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01288356,0.000227702,0.9838783,0.0001088555,0.00005206906,0.00003251151,0.00003646544,0.001436296,0.001344232],"genre_scores_gemma":[0.1512845,0.0002454309,0.8447849,0.00004929823,0.0000395649,0.0001024854,0.000151334,0.0002130296,0.003129276],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003729773,"threshold_uncertainty_score":0.01247728,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4379648388","doi":"10.1002/nla.2514","title":"A Vanka‐based parameter‐robust multigrid relaxation for the Stokes–Darcy Brinkman problems","year":2023,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":1,"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":"University of British Columbia","keywords":"Mathematics; Multigrid method; Discretization; Mathematical analysis; Applied mathematics; Relaxation (psychology); Stokes flow; Darcy number; Partial differential equation; Geometry; Physics; Flow (mathematics); Mechanics; Reynolds number","authors":[{"name":"Yunhui He","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0439613445610292,"gpt":0.2994658209317939,"spread":0.2555044763707647,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005912182,0.0005805234,0.0006918612,0.0004590513,0.0003934189,0.00065359,0.000951182,0.001025591,0.001032862],"category_scores_gemma":[0.001257947,0.0003689349,0.0007251315,0.0003529754,0.0007892114,0.0006839572,0.0009313541,0.001081653,0.0002496197],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005148854,"about_ca_system_score_gemma":0.001009786,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005807992,"about_ca_topic_score_gemma":0.004078847,"domain_scores_codex":[0.9997328,0.0001090884,0.00001113566,0.00003631096,0.00007710128,0.00003365736],"domain_scores_gemma":[0.9996752,0.0001479992,0.00004654927,0.00004162674,0.00006201294,0.00002662942],"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.00006378008,0.00005269939,0.0004534428,0.0001093831,0.000034707,0.00005780223,0.00009940522,0.9374217,0.01454644,0.02903806,0.0005612104,0.01756133],"study_design_scores_gemma":[0.000005083265,0.000009349984,0.00003850002,0.000003184435,0.000001701478,0.000005558304,0.000006395257,0.9977009,0.0006824318,0.00111614,0.0004265131,0.000004317939],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05467401,0.0003435252,0.9406756,0.0002473941,0.00006566321,0.00005081299,0.00005024212,0.0001204849,0.003772284],"genre_scores_gemma":[0.6046099,0.0002995924,0.3891684,0.000123192,0.00004724304,0.0002218372,0.0001853619,0.0001970222,0.005147509],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005807992,"threshold_uncertainty_score":0.0115484,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2779052738","doi":"10.1002/nla.2206","title":"A multigrid solver to the Helmholtz equation with a point source based on travel time and amplitude","year":2018,"lang":"en","type":"preprint","venue":"Numerical Linear Algebra with Applications","topic":"Seismic Imaging and Inversion Techniques","field":"Earth and Planetary Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Seventh Framework Programme","keywords":"Helmholtz equation; Discretization; Multigrid method; Solver; Wave equation; Mathematical analysis; Eikonal equation; Mathematics; Amplitude; Applied mathematics; Partial differential equation; Physics; Mathematical optimization; Boundary value problem","authors":[{"name":"Eran Treister","is_ca":false},{"name":"Eldad Haber","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01385753378964502,"gpt":0.2245611686145886,"spread":0.2107036348249436,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005160947,0.0005580516,0.0006137078,0.000546504,0.0004089808,0.0007918804,0.0009689927,0.001058055,0.003026459],"category_scores_gemma":[0.001933168,0.0003944164,0.0008875858,0.0006261083,0.0006121341,0.0007535348,0.001596117,0.00132399,0.0007235397],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005784183,"about_ca_system_score_gemma":0.001349828,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005564466,"about_ca_topic_score_gemma":0.005168655,"domain_scores_codex":[0.9997308,0.00006093562,0.00001669036,0.0000364602,0.0001290829,0.00002605298],"domain_scores_gemma":[0.999471,0.0002317375,0.00003985593,0.00006586855,0.0001538974,0.00003751764],"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.00008359089,0.0001096613,0.00111275,0.0001525842,0.00005468318,0.0002355181,0.0002597488,0.8021421,0.02039051,0.07763476,0.004781986,0.09304216],"study_design_scores_gemma":[0.000009201659,0.000006452897,0.00003921796,0.000003028112,0.00000210002,0.00001351001,0.000009424219,0.9936135,0.0009751416,0.003708845,0.001616213,0.000003210915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005992565,0.00004564812,0.9917089,0.00008913984,0.00003415944,0.00003215431,0.00004041559,0.0002174554,0.001839471],"genre_scores_gemma":[0.1286023,0.0001162813,0.8637604,0.0001030608,0.00006094277,0.0001571954,0.0002493319,0.0003485189,0.006601959],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005564466,"threshold_uncertainty_score":0.01106411,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}