{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":35,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":35,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"0bce8855159e","filters":{"venue":"SIAM Journal on Matrix Analysis and Applications"}},"results":[{"id":"W2118811613","doi":"10.1137/s089547980036838x","title":"Twice Differentiable Spectral Functions","year":2001,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":90,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Differentiable function; Hessian matrix; Eigenvalues and eigenvectors; Pure mathematics; Symmetric matrix; Function (biology); Mathematical analysis; Matrix (chemical analysis); Applied mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.007979552960835083,"gpt":0.2555741821285429,"spread":0.2475946291677078,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003072697,0.000130475,0.000213427,0.0004138462,0.0006573855,0.0004248416,0.0004184104,0.00004083329,0.0002986526],"category_scores_gemma":[0.000006575659,0.0001043218,0.00023297,0.001802877,0.00003421228,0.0002525265,0.00005792219,0.0002446789,0.000132353],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002471105,"about_ca_system_score_gemma":0.00002293997,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005772965,"about_ca_topic_score_gemma":0.000004766564,"domain_scores_codex":[0.9989212,0.00006465918,0.0002801889,0.0002810516,0.0002193926,0.0002334831],"domain_scores_gemma":[0.9990737,0.00008343186,0.0001513463,0.0004105936,0.00007438856,0.0002065678],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002389501,0.0005601052,0.005420151,0.00001070668,0.001120663,0.00002733695,0.000115759,0.003420671,0.0009052522,0.9247822,0.001877932,0.0617353],"study_design_scores_gemma":[0.00134983,0.0004322136,0.03595209,0.00002832256,0.002210159,0.0008565624,0.0003209082,0.1297569,0.0005431959,0.1943224,0.6331168,0.001110599],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01743168,0.0002916279,0.9764917,0.001185831,0.00004677095,0.000090357,0.000005180834,0.00006477467,0.004392113],"genre_scores_gemma":[0.9748088,0.0007760816,0.01251805,0.000249758,0.0006194842,0.00004314862,0.00001145733,0.00001073266,0.01096254],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9639736,"threshold_uncertainty_score":0.5056144,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2015224767","doi":"10.1137/s0895479802402818","title":"Optimization and Pseudospectra, with Applications to Robust Stability","year":2003,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Lipschitz continuity; Mathematical analysis; Matrix (chemical analysis); Condition number; Applied mathematics; Complex plane","retraction":null,"screen_n_in":null,"score":{"opus":0.01048618722052016,"gpt":0.2502751010984845,"spread":0.2397889138779643,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005699379,0.0001447774,0.0002223885,0.000325798,0.0005704287,0.0003652015,0.0002561371,0.00003985632,0.00007645282],"category_scores_gemma":[0.00001223299,0.0001126296,0.00007363052,0.002047468,0.00005023622,0.0002051707,0.00003428031,0.0001692944,0.00001069219],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003087609,"about_ca_system_score_gemma":0.0000412873,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000253326,"about_ca_topic_score_gemma":0.000004970977,"domain_scores_codex":[0.9988272,0.00009233312,0.0002794947,0.0003986604,0.0002147163,0.0001876568],"domain_scores_gemma":[0.9988646,0.0001015734,0.0001488567,0.0004594159,0.0001398691,0.0002857153],"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.000009447264,0.0002169055,0.002161225,0.0000144344,0.0002521956,0.000001928927,0.0001220401,0.1652638,0.0001416089,0.8206841,0.00004663872,0.01108565],"study_design_scores_gemma":[0.003878322,0.001416188,0.01674433,0.00009061617,0.004044829,0.001018582,0.001582059,0.6106639,0.005504232,0.2108817,0.1404712,0.003704023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002468778,0.0002109083,0.9952355,0.0006974926,0.000008187165,0.0003483434,0.000007151511,0.00004720667,0.0009764178],"genre_scores_gemma":[0.4616334,0.0003788822,0.5370938,0.000246386,0.0001063653,0.000255074,0.000006862601,0.00001330509,0.0002658854],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6098024,"threshold_uncertainty_score":0.4592903,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1969892577","doi":"10.1137/s0895479898348519","title":"On a Newton-Like Method for Solving Algebraic Riccati Equations","year":2000,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":62,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Controllability; Mathematics; Algebraic Riccati equation; Newton's method; Convergence (economics); Algebraic equation; Algebraic number; Applied mathematics; Riccati equation; Conjecture; Rate of convergence; Mathematical analysis; Pure mathematics; Partial differential equation; Computer science; Nonlinear system","retraction":null,"screen_n_in":null,"score":{"opus":0.04000195251417463,"gpt":0.404159534645647,"spread":0.3641575821314724,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000932282,0.0002367556,0.0005142784,0.0005607303,0.0009093241,0.0002111061,0.0002580302,0.00009731252,0.001062723],"category_scores_gemma":[0.0004107148,0.0001961834,0.0005556766,0.001515743,0.00004504679,0.0001041286,0.00001897606,0.0003203609,0.00006702347],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007449572,"about_ca_system_score_gemma":0.0000475956,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001279929,"about_ca_topic_score_gemma":0.00001579913,"domain_scores_codex":[0.9980634,0.0001859761,0.000700806,0.0003838926,0.0003518585,0.0003140166],"domain_scores_gemma":[0.9950119,0.003713693,0.0003684678,0.0004741419,0.0001705399,0.0002612759],"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.00004165364,0.0005781904,0.00002559817,0.000030056,0.001184312,6.478658e-7,0.0001540863,0.00248687,0.0006657148,0.7149354,0.001045526,0.278852],"study_design_scores_gemma":[0.0004934565,0.0001491783,0.0002408984,0.0000216861,0.002439412,0.00000820992,0.00006843489,0.03800646,0.0001175422,0.9425359,0.0156506,0.0002682733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003046336,0.0000862105,0.9938089,0.001627141,0.00003269637,0.0005751345,0.00005494593,0.00006182415,0.0007068031],"genre_scores_gemma":[0.05196309,0.0001959758,0.9398946,0.0005150593,0.0004124509,0.0006866514,0.00006349647,0.00006566007,0.006203014],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2785837,"threshold_uncertainty_score":0.9998505,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1968250174","doi":"10.1137/040620047","title":"A Multipreconditioned Conjugate Gradient Algorithm","year":2006,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":51,"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":"Conjugate gradient method; Preconditioner; Mathematics; Derivation of the conjugate gradient method; Conjugate residual method; Algorithm; Positive-definite matrix; Generalization; Matrix (chemical analysis); Nonlinear conjugate gradient method; Applied mathematics; Biconjugate gradient method; Linear system; Block (permutation group theory); Cholesky decomposition; Gradient method; Conjugate; Domain decomposition methods; Relation (database); Coefficient matrix; Gradient descent; Computer science; Iterative method; Combinatorics; Mathematical analysis; Eigenvalues and eigenvectors; Finite element method; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.005290628705126683,"gpt":0.2455948881573417,"spread":0.240304259452215,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000419709,0.0001470552,0.0002470867,0.0004485634,0.0005822123,0.0003833156,0.0003790319,0.00004586129,0.00007775429],"category_scores_gemma":[0.000004423522,0.0001211626,0.0002435546,0.001167454,0.00005068277,0.0002429827,0.00005094738,0.0001948487,0.00007469094],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002945117,"about_ca_system_score_gemma":0.00002187939,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002067908,"about_ca_topic_score_gemma":0.00000611439,"domain_scores_codex":[0.998769,0.00008294563,0.0003860715,0.0003123841,0.000227709,0.0002219218],"domain_scores_gemma":[0.9990438,0.000101576,0.0002413363,0.0003540169,0.0001036897,0.0001555814],"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.000005210492,0.000473801,0.0003316345,0.000007967594,0.0004579575,0.00002177127,0.00005867282,0.003935085,0.0003247855,0.8631027,0.0006388948,0.1306415],"study_design_scores_gemma":[0.001695929,0.0002803443,0.009227598,0.00002525827,0.001034143,0.0003774857,0.0001034728,0.4200037,0.001802121,0.4193366,0.1451926,0.0009207429],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003140372,0.0003096943,0.9943689,0.000834387,0.00004692952,0.0001414731,0.00002553791,0.00006568181,0.001067024],"genre_scores_gemma":[0.8165972,0.0003718216,0.1784594,0.0004021448,0.0009424608,0.0001451855,0.00006646567,0.00001972554,0.002995601],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8159094,"threshold_uncertainty_score":0.4940869,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2131237233","doi":"10.1137/080742531","title":"Adaptive First-Order Methods for General Sparse Inverse Covariance Selection","year":2010,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Statistical Methods and Inference","field":"Mathematics","cited_by":47,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Estimation of covariance matrices; Covariance; Applied mathematics; Gaussian; Inverse; Lasso (programming language); Covariance matrix; Conditional independence; Algorithm; Mathematical optimization; Statistics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.06542253355019306,"gpt":0.436244996765416,"spread":0.3708224632152229,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001089782,0.0001443193,0.0003358574,0.0002139176,0.000478008,0.0001051451,0.0001266481,0.00009535426,0.0002837119],"category_scores_gemma":[0.0006679343,0.0001150624,0.0001788326,0.0008526211,0.0000654344,0.00006007677,0.0000189697,0.0003746621,0.000007447794],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002335649,"about_ca_system_score_gemma":0.00004494503,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001346816,"about_ca_topic_score_gemma":0.00008366936,"domain_scores_codex":[0.9989261,0.0001221318,0.0003835641,0.0002484251,0.0001263803,0.0001933895],"domain_scores_gemma":[0.9976384,0.001351429,0.0002819831,0.000201356,0.0003548939,0.00017195],"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.0000343357,0.0001318388,0.0003501166,0.0000171811,0.0004343089,3.755871e-7,0.00004633794,0.0003035902,0.002238279,0.9469227,0.0008121888,0.04870876],"study_design_scores_gemma":[0.0003946409,0.0001317808,0.001364533,0.000008054965,0.001397252,0.00002336177,0.00005104546,0.2399284,0.0004869883,0.716552,0.03943504,0.0002269304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002838941,0.0000256459,0.995904,0.0004327433,0.00005522994,0.0002839178,0.00003358754,0.00002171675,0.0004042612],"genre_scores_gemma":[0.008129201,0.00007730511,0.9905891,0.0001115617,0.0003424488,0.0001644143,0.000004946935,0.00001462765,0.0005664253],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2396248,"threshold_uncertainty_score":0.4692107,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2123353000","doi":"10.1137/s0895479803433313","title":"Pseudospectral Components and the Distance to Uncontrollability","year":2004,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Advanced Control Systems Optimization","field":"Engineering","cited_by":47,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Parameterized complexity; Function (biology); Norm (philosophy); Signed distance function; Combinatorics; Discrete mathematics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.003172831931721366,"gpt":0.2245980615940208,"spread":0.2214252296622994,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002302325,0.00009929594,0.0002447444,0.0001015074,0.0002252803,0.0001013648,0.00008759845,0.00002413173,0.000004627688],"category_scores_gemma":[0.00001335424,0.00006734452,0.00008595251,0.0005249006,0.00004258901,0.00006610597,0.000009395731,0.0001267129,0.000005986706],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007399766,"about_ca_system_score_gemma":0.000005327501,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001018797,"about_ca_topic_score_gemma":0.00003565727,"domain_scores_codex":[0.9993346,0.00002770026,0.0002634399,0.0001278821,0.0001238869,0.000122521],"domain_scores_gemma":[0.9995298,0.00006572031,0.00006411968,0.0001826772,0.00004761161,0.0001100305],"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.00003325465,0.0000160144,0.0008193292,0.000006153422,0.0002791568,4.670754e-7,0.00007193242,0.9606013,0.0004941928,0.03616089,0.000007181763,0.001510147],"study_design_scores_gemma":[0.02085953,0.0002001877,0.1264075,0.0001102327,0.004387913,0.0001448126,0.0006672671,0.6728905,0.0003528918,0.1432872,0.02921476,0.001477174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04792341,0.0008290625,0.9491205,0.001481627,0.00002002667,0.0003328369,0.00001115843,0.0000393664,0.0002419812],"genre_scores_gemma":[0.9965279,0.0002353411,0.002965749,0.00005724324,0.00009713803,0.00007228919,0.000003178975,0.000008679772,0.00003245972],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9486045,"threshold_uncertainty_score":0.274623,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2069382953","doi":"10.1137/s0895479898342432","title":"Convergence of Subdivision Schemes Associated with Nonnegative Masks","year":2000,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","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 Alberta","funders":"","keywords":"Subdivision; Mathematics; Convergence (economics); Sequence (biology); Combinatorics; Euclidean space; Applied mathematics; Matrix (chemical analysis); Discrete mathematics; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0040495328849278,"gpt":0.2454083454348722,"spread":0.2413588125499444,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001212552,0.0001231476,0.0003191795,0.0002309799,0.00011199,0.00002465986,0.0001150601,0.00004464031,0.0004062284],"category_scores_gemma":[0.000009726799,0.00009225106,0.0001381887,0.001554647,0.00006425348,0.00009487047,0.000006993824,0.0001845772,0.000009400558],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003445438,"about_ca_system_score_gemma":0.000006575057,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003646461,"about_ca_topic_score_gemma":0.000005873394,"domain_scores_codex":[0.9991975,0.00002458096,0.000308149,0.0001374791,0.0002038208,0.0001284065],"domain_scores_gemma":[0.9994435,0.0000806821,0.0001261142,0.0001616886,0.0000956602,0.00009233812],"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.0001774663,0.001199358,0.06375211,0.000112875,0.01841803,0.00002473481,0.0005738574,0.5320824,0.02022202,0.02041475,0.0008016106,0.3422208],"study_design_scores_gemma":[0.002755375,0.001329101,0.1307527,0.0004929383,0.01513762,0.00005743175,0.0007491691,0.6650146,0.09884798,0.03002538,0.05191604,0.00292166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4141558,0.0005634676,0.5833031,0.00008401521,0.000003981557,0.0001543666,0.00002852081,0.00013338,0.001573396],"genre_scores_gemma":[0.9945294,0.001134603,0.004044908,0.00001535504,0.0000210065,0.0000219262,0.0000140362,0.00001204051,0.0002067187],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5803736,"threshold_uncertainty_score":0.4447916,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2143526866","doi":"10.1137/120896499","title":"Birkhoff--von Neumann Theorem for Multistochastic Tensors","year":2014,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":31,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Extreme point; Permutation (music); Tensor (intrinsic definition); Class (philosophy); Permutation matrix; Von Neumann architecture; Set (abstract data type); Pure mathematics; Regular polygon; Combinatorics; Algebra over a field; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.02107124498745568,"gpt":0.336864662001912,"spread":0.3157934170144563,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005033144,0.0001872031,0.0003794711,0.0004047823,0.0007128883,0.000158564,0.0002170887,0.00007591106,0.0001007254],"category_scores_gemma":[0.0001022108,0.0001512185,0.0003730079,0.0006404635,0.00007376003,0.00005998466,0.00002110881,0.000204231,0.00005447871],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003254234,"about_ca_system_score_gemma":0.00001378252,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002328747,"about_ca_topic_score_gemma":0.000007216137,"domain_scores_codex":[0.9986889,0.00006696872,0.0005049555,0.0003038548,0.0002057729,0.0002295076],"domain_scores_gemma":[0.9980274,0.0007808588,0.0003581297,0.0004083279,0.0002110081,0.00021421],"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.00001965143,0.0002348301,0.0001643875,0.00002524454,0.0003575792,2.719409e-7,0.0000542964,0.0008188864,0.000851252,0.9855895,0.001609503,0.01027459],"study_design_scores_gemma":[0.001402127,0.0002153604,0.003487205,0.00003428758,0.003201572,0.00006784959,0.0002385706,0.05461184,0.0003359724,0.794996,0.1408255,0.0005837081],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02380157,0.00006203527,0.9725561,0.00171266,0.00002130743,0.0005326898,0.00006320036,0.00008589283,0.001164596],"genre_scores_gemma":[0.9597341,0.00007031726,0.03746924,0.0003199221,0.0004318434,0.0004183069,0.00004378123,0.00003764619,0.001474791],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9359326,"threshold_uncertainty_score":0.6166512,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1982059058","doi":"10.1137/080724071","title":"Stopping Criteria for the Iterative Solution of Linear Least Squares Problems","year":2009,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Residual; Least-squares function approximation; Mathematical optimization; Limit (mathematics); Applied mathematics; Iterative method; Numerical analysis; Property (philosophy); Linear least squares; Algorithm; Linear model; Statistics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.02002872561713478,"gpt":0.3183769069064006,"spread":0.2983481812892659,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006263161,0.00009148915,0.0001859543,0.0001965351,0.0006087608,0.0001797391,0.0003429335,0.00002926304,0.00001233661],"category_scores_gemma":[0.00001572123,0.00005884989,0.0001941581,0.0007266751,0.00003638352,0.000184508,0.00002411499,0.0001173406,0.000002145831],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001240351,"about_ca_system_score_gemma":0.00002082902,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000022455,"about_ca_topic_score_gemma":0.000001479718,"domain_scores_codex":[0.9991792,0.00006373494,0.0003078949,0.000171373,0.0001462282,0.0001315835],"domain_scores_gemma":[0.9990909,0.0001734822,0.0002541675,0.000251943,0.0001703272,0.00005924565],"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.00003515922,0.0003128095,0.0001230883,0.00003817686,0.000618519,9.777868e-7,0.001226426,0.02052702,0.007230364,0.74387,0.0003755787,0.2256419],"study_design_scores_gemma":[0.0005444872,0.0004337561,0.002844934,0.00004846774,0.000618149,0.00003336473,0.0002355442,0.8894588,0.001508532,0.08376794,0.020243,0.0002629881],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001310386,0.0006592368,0.9945986,0.003044383,0.00002263973,0.0002345063,0.00001203345,0.0000154289,0.0001027802],"genre_scores_gemma":[0.969191,0.0002227708,0.0299011,0.000154836,0.0002684235,0.00004192428,0.0000052323,0.000003550926,0.0002112356],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9678805,"threshold_uncertainty_score":0.4682158,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2803106003","doi":"10.1137/16m1107863","title":"Orthogonal Nonnegative Matrix Factorization by Sparsity and Nuclear Norm Optimization","year":2018,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"Hong Kong Baptist University","keywords":"Mathematics; Factorization; Matrix decomposition; Matrix norm; Sparse matrix; Coefficient matrix; Non-negative matrix factorization; Matrix (chemical analysis); Incomplete LU factorization; Norm (philosophy); Algorithm; Applied mathematics; Mathematical optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.00649217373800545,"gpt":0.2568799767331522,"spread":0.2503878029951468,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000200285,0.0001228366,0.0001759494,0.0002794837,0.0007312613,0.000374297,0.0001917974,0.00006972597,0.0001061841],"category_scores_gemma":[0.00001340318,0.0001036988,0.00007780985,0.0009258651,0.00006697565,0.000454142,0.00006991322,0.0001448288,0.00003809658],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002537076,"about_ca_system_score_gemma":0.0000188195,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000755107,"about_ca_topic_score_gemma":0.000004797838,"domain_scores_codex":[0.9990088,0.00005816175,0.0002543378,0.0002956934,0.0002366176,0.0001463854],"domain_scores_gemma":[0.9991288,0.00005238201,0.0002393004,0.0001888703,0.0002257672,0.0001648467],"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.0003972504,0.002861125,0.04833492,0.0001606867,0.004882317,0.00002306832,0.007742681,0.05351277,0.04269172,0.4635635,0.03762268,0.3382073],"study_design_scores_gemma":[0.001713257,0.0006979564,0.01541097,0.00007678289,0.001167936,0.00009888098,0.0006449197,0.8909832,0.002111832,0.01285391,0.07312102,0.0011193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02636823,0.00009049835,0.9720471,0.0007673862,0.00003222882,0.0001243955,0.0000252498,0.0000404423,0.0005044906],"genre_scores_gemma":[0.955633,0.0007272834,0.04289777,0.0002221676,0.0002099615,0.00001201678,0.00005478362,0.00000972112,0.000233315],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9292647,"threshold_uncertainty_score":0.5624345,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2924691308","doi":"10.1137/19m1245505","title":"The Block Rational Arnoldi Method","year":2020,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and 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":"Toronto Metropolitan University","funders":"Engineering and Physical Sciences Research Council","keywords":"Orthonormal basis; Mathematics; Applied mathematics; Eigenvalues and eigenvectors; Block (permutation group theory); Arnoldi iteration; Krylov subspace; MATLAB; Rational function; Stability (learning theory); Generalized minimal residual method; Elliptic rational functions; Mathematical optimization; Pure mathematics; Computer science; Iterative method; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.01217846181103648,"gpt":0.2954704634421431,"spread":0.2832920016311066,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007041113,0.0001017528,0.0001640814,0.00009991616,0.0009599851,0.0005300168,0.0005931755,0.00003028576,0.00002904033],"category_scores_gemma":[0.00003012193,0.00006469802,0.0001999127,0.001286971,0.00003439772,0.0001358819,0.00007734959,0.0002421551,0.00004894515],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001079547,"about_ca_system_score_gemma":0.00003927402,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.782352e-7,"about_ca_topic_score_gemma":8.589042e-7,"domain_scores_codex":[0.9989027,0.0001518906,0.0002931447,0.0002362993,0.0002634115,0.0001524925],"domain_scores_gemma":[0.9989046,0.0003394126,0.0001874783,0.000271069,0.00009477781,0.0002026351],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000006556877,0.00003308352,0.00008255264,0.000003015875,0.000326792,0.000002817795,0.00009385565,0.006212684,0.0002396757,0.9355275,0.0007595952,0.0567119],"study_design_scores_gemma":[0.0004123922,0.0001165273,0.001000428,0.00000449767,0.0004786659,0.00008890524,0.0001366315,0.4207365,0.0006009565,0.08819294,0.487927,0.0003045008],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0002551721,0.0004301239,0.9794424,0.01896363,0.00002259938,0.00009346482,0.000004636927,0.00003390849,0.0007541283],"genre_scores_gemma":[0.6176237,0.001979779,0.3697943,0.005262974,0.002524093,0.0001558199,0.00001433866,0.00002765381,0.00261736],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8473345,"threshold_uncertainty_score":0.7383527,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3083409701","doi":"10.1137/20m1365326","title":"A Multiprecision Derivative-Free Schur--Parlett Algorithm for Computing Matrix Functions","year":2021,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and 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":"Toronto Metropolitan University","funders":"Engineering and Physical Sciences Research Council; Royal Society","keywords":"Schur decomposition; Mathematics; Algebra over a field; Matrix (chemical analysis); Matrix function; Schur product theorem; Schur's theorem; Decomposition; Algorithm; Schur complement; Pure mathematics; Symmetric matrix; Eigenvalues and eigenvectors","retraction":null,"screen_n_in":null,"score":{"opus":0.01237753551692138,"gpt":0.294455632274379,"spread":0.2820780967574576,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0008325085,0.0002266524,0.0004230983,0.0004866397,0.001322761,0.0006861184,0.0007185403,0.00009034459,0.00007592186],"category_scores_gemma":[0.0001035144,0.0001994101,0.000476507,0.002347506,0.00005360443,0.0003323505,0.0002681855,0.0003339223,0.00002815441],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005032127,"about_ca_system_score_gemma":0.000095969,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005331716,"about_ca_topic_score_gemma":0.000005286034,"domain_scores_codex":[0.9979822,0.0001606559,0.0005901806,0.000569776,0.0003570453,0.0003401137],"domain_scores_gemma":[0.9974573,0.0006427314,0.000358978,0.0008057098,0.0004788002,0.0002564906],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001574105,0.0004808613,0.0002556175,0.00002889182,0.00118589,0.00002487759,0.0001976628,0.007215196,0.001524116,0.1877518,0.001714423,0.7996049],"study_design_scores_gemma":[0.001725713,0.000153988,0.0009765422,0.00004861669,0.0008499829,0.0002594492,0.0003921672,0.8092074,0.001363266,0.06104666,0.1233802,0.0005960328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001202094,0.000888382,0.9954353,0.001693484,0.0001135636,0.000262011,0.00009888017,0.00008260498,0.0002236536],"genre_scores_gemma":[0.04431304,0.0003948649,0.9516369,0.0003866772,0.0009464692,0.0001099261,0.0001365495,0.00002793441,0.002047706],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8019922,"threshold_uncertainty_score":0.9999774,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2150327219","doi":"10.1137/100789890","title":"Finite-state Markov Chains Obey Benford’s Law","year":2011,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Benford’s Law and Fraud Detection","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Vrije Universiteit Amsterdam","keywords":"Benford's law; Mathematics; Markov chain; Additive Markov chain; Continuous-time Markov chain; Aperiodic graph; Stochastic matrix; Markov kernel; Probability distribution; Discrete phase-type distribution; Markov property; Balance equation; Markov chain mixing time; Discrete mathematics; Absorbing Markov chain; Variable-order Markov model; Markov model; Combinatorics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.03654148876467839,"gpt":0.2982677345771709,"spread":0.2617262458124925,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004903166,0.0001954199,0.0003588714,0.000359771,0.0005770719,0.0001234446,0.0001946162,0.00009295524,0.0004466919],"category_scores_gemma":[0.0000293858,0.0001590391,0.0003445054,0.0008363771,0.00007784885,0.0001487079,0.00003585914,0.0003442412,0.00005635308],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000399534,"about_ca_system_score_gemma":0.0000222793,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007423128,"about_ca_topic_score_gemma":0.000261611,"domain_scores_codex":[0.9986316,0.0000562263,0.0005425812,0.000245919,0.0002595969,0.0002640736],"domain_scores_gemma":[0.9986944,0.0001746573,0.0003718812,0.0003937766,0.0001418248,0.0002234526],"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.00006330089,0.0003915922,0.0008214939,0.00003975848,0.001173069,0.00001437559,0.0004713003,0.0001473152,0.0001154012,0.9709245,0.0005175792,0.02532032],"study_design_scores_gemma":[0.001663029,0.0005534489,0.005229817,0.00006439447,0.005593221,0.0002138782,0.0008014849,0.01233854,0.001857246,0.8315787,0.1388878,0.001218456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03649103,0.0002885133,0.9009734,0.000325641,0.0001028989,0.0005551809,0.00008903311,0.0001609068,0.06101339],"genre_scores_gemma":[0.985828,0.0003988674,0.009940553,0.0002069261,0.0002097875,0.00007294364,0.00001288018,0.00002782297,0.003302215],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.949337,"threshold_uncertainty_score":0.6485426,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2278832452","doi":"10.1137/16m1062454","title":"Reordering Strategy for Blocking Optimization in Sparse Linear Solvers","year":2017,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"Direction Générale de l’Armement; Université de Bordeaux; Agence Nationale de la Recherche","keywords":"Granularity; Solver; Computer science; Block (permutation group theory); Kernel (algebra); Sparse matrix; Parallel computing; Linear algebra; LU decomposition; Linear system; Computation; Algorithm; Theoretical computer science; Matrix decomposition; Mathematics; Eigenvalues and eigenvectors","retraction":null,"screen_n_in":null,"score":{"opus":0.02994591289847937,"gpt":0.3352709230479765,"spread":0.3053250101494971,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004728659,0.00009642101,0.0001856975,0.0003787816,0.0008314219,0.0005961254,0.0005063821,0.00004818734,0.000004189311],"category_scores_gemma":[0.00003446622,0.00009024924,0.0001097398,0.0003695647,0.00002580838,0.0002674683,0.00006750945,0.0001352504,0.00000115695],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002711025,"about_ca_system_score_gemma":0.00003305243,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001242438,"about_ca_topic_score_gemma":0.00000935288,"domain_scores_codex":[0.999167,0.00002669038,0.0002906148,0.0002409209,0.000118871,0.0001559076],"domain_scores_gemma":[0.9989897,0.00005709235,0.000352193,0.0004108642,0.0001155249,0.00007463533],"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.000002947161,0.00003098122,0.0009182658,0.000003761826,0.00004718787,9.422243e-7,0.00002722824,0.9761435,0.00001597773,0.01250121,0.00003532453,0.01027273],"study_design_scores_gemma":[0.0002210156,0.00003244104,0.0009170666,0.00001416462,0.00005238791,0.000004587061,0.00001389208,0.9951832,0.00009141928,0.002120909,0.001241762,0.0001071338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001170638,0.00008370503,0.9974577,0.0005742093,0.00001759184,0.0001573746,0.000001774759,0.00004944214,0.0004875344],"genre_scores_gemma":[0.5813081,0.0004529239,0.4179191,0.00004691942,0.00009778023,0.00003591417,0.000005150851,0.000006704683,0.0001274828],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5801374,"threshold_uncertainty_score":0.6394709,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4311941380","doi":"10.1137/21m1449579","title":"Linear Asymptotic Convergence of Anderson Acceleration: Fixed-Point Analysis","year":2022,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and 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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Fixed point; Lipschitz continuity; Differentiable function; Acceleration; Mathematical analysis; Convergence (economics); Applied mathematics; Function (biology); Weak convergence; Physics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01101449805114485,"gpt":0.2730494077438461,"spread":0.2620349096927013,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009017577,0.0001348933,0.0003903935,0.0008997009,0.000794646,0.0001337127,0.0006304181,0.00002961572,0.0007071853],"category_scores_gemma":[0.00001158976,0.0001206797,0.0004410986,0.00508551,0.00004599364,0.0002129604,0.0001646296,0.0002760295,0.00000942016],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004104925,"about_ca_system_score_gemma":0.00005436434,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008924472,"about_ca_topic_score_gemma":0.00000374601,"domain_scores_codex":[0.9983357,0.0001974939,0.0005099431,0.0003359083,0.0004449994,0.0001759751],"domain_scores_gemma":[0.9986357,0.0001409137,0.000446072,0.0004968499,0.000136087,0.0001443542],"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.00004994121,0.0008961497,0.01463031,0.00004424829,0.008248585,0.00002500867,0.0009585925,0.3894669,0.001292951,0.5588197,0.0006010412,0.02496663],"study_design_scores_gemma":[0.000725823,0.000402677,0.009714008,0.000006885007,0.005235235,0.00008713783,0.0007765348,0.9489883,0.001410139,0.01985225,0.01222395,0.000577045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01597344,0.0003467913,0.9820613,0.001054377,0.00004590652,0.000134445,0.00002447904,0.00002938045,0.0003298374],"genre_scores_gemma":[0.9898725,0.0001855851,0.009180836,0.0001570821,0.00009693984,0.00004613112,0.00001908445,0.000005290294,0.0004365341],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9738991,"threshold_uncertainty_score":0.7743183,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2004529037","doi":"10.1137/s0895479803428230","title":"Block Diagonal and Schur Complement Preconditioners for Block-Toeplitz Systems with Small Size Blocks","year":2007,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and 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":"Toronto Metropolitan University","funders":"","keywords":"Toeplitz matrix; Mathematics; Schur complement; Block matrix; Block (permutation group theory); Levinson recursion; Hermitian matrix; Combinatorics; Eigenvalues and eigenvectors; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01284949964051417,"gpt":0.2684716224729193,"spread":0.2556221228324051,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001260847,0.0001977424,0.0003394127,0.000331927,0.0007361727,0.0004550386,0.000338497,0.00005541388,0.00001736707],"category_scores_gemma":[0.00001398126,0.0001501184,0.0001481439,0.0007739087,0.00007203174,0.0001318132,0.00005844383,0.0001970118,0.000003317326],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003665205,"about_ca_system_score_gemma":0.00004320411,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000947766,"about_ca_topic_score_gemma":0.00001704892,"domain_scores_codex":[0.9984521,0.00005265496,0.0004894384,0.0004084305,0.0002598887,0.0003374544],"domain_scores_gemma":[0.9982836,0.0005528121,0.000347105,0.0003382501,0.0001727592,0.0003055274],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002245447,0.001014211,0.007017212,0.0002304966,0.004795088,0.00004043466,0.0006409839,0.02427995,0.001118855,0.898845,0.001268844,0.0605244],"study_design_scores_gemma":[0.01233624,0.003382825,0.03819521,0.0004044612,0.008286498,0.003203112,0.00338805,0.2621465,0.002708819,0.07410045,0.5877017,0.004146136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03514703,0.0005777475,0.9623553,0.0008037437,0.00004295777,0.0005771336,0.00006963559,0.00004837938,0.000378037],"genre_scores_gemma":[0.9483733,0.0001602313,0.0498565,0.0002026417,0.0004118747,0.0001585726,0.00002037732,0.00001511751,0.0008013929],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9132262,"threshold_uncertainty_score":0.612165,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4249550536","doi":"10.1137/100808885","title":"Convexity Properties of the Condition Number II","year":2012,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Universitat de Barcelona; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro; Agencia Nacional de Promoción Científica y Tecnológica; Consejo Nacional de Investigaciones Científicas y Técnicas; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Mathematics; Hessian matrix; Geodesic; Rank (graph theory); Lipschitz continuity; Pure mathematics; Matrix (chemical analysis); Metric (unit); Convex function; Homogeneous space; Convexity; Piecewise linear function; Mathematical analysis; Combinatorics; Applied mathematics; Regular polygon; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01340991002774894,"gpt":0.2645891389298888,"spread":0.2511792289021399,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002382768,0.00006030569,0.0001200608,0.00007469098,0.0004027953,0.00005764829,0.0002304669,0.00002228402,0.00002291823],"category_scores_gemma":[0.000007971768,0.00003586404,0.0001175316,0.0007011496,0.00005099745,0.0002145402,0.00008029849,0.00009989866,0.000011209],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001442155,"about_ca_system_score_gemma":0.00002493539,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007743708,"about_ca_topic_score_gemma":0.000001543009,"domain_scores_codex":[0.9993854,0.00005137299,0.0002069373,0.00008655587,0.0001637495,0.0001059391],"domain_scores_gemma":[0.9994408,0.00002400598,0.0002041214,0.0001871873,0.00007216103,0.00007165367],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00001205782,0.0006659173,0.04621745,0.00003423739,0.0008060485,2.947868e-7,0.001268843,0.001550803,0.01087369,0.8797851,0.001159009,0.05762652],"study_design_scores_gemma":[0.001521611,0.0001952152,0.6989858,0.0001281844,0.002137226,0.0002535373,0.0004028776,0.06618833,0.05862723,0.08852511,0.08204438,0.0009905323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6208347,0.0003259348,0.3759553,0.001917662,0.00008255109,0.0001407222,0.000004968581,0.00002019817,0.0007179176],"genre_scores_gemma":[0.9987401,0.00002960467,0.0007676449,0.0001124107,0.0001278473,0.00001122407,0.000001089251,0.000001864828,0.0002082665],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.79126,"threshold_uncertainty_score":0.3098016,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1966533816","doi":"10.1137/110843137","title":"A Structure-Preserving Curve for Symplectic Pairs and Its Applications","year":2012,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and 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":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Symplectic geometry; Parameterized complexity; Monotonic function; Numerical analysis; Fixed-point iteration; Convergence (economics); Newton's method; Hermitian matrix; Positive-definite matrix; Matrix (chemical analysis); Mathematical analysis; Fixed point; Applied mathematics; Eigenvalues and eigenvectors; Pure mathematics; Combinatorics; Nonlinear system","retraction":null,"screen_n_in":null,"score":{"opus":0.01326261175675787,"gpt":0.2915573135472009,"spread":0.278294701790443,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006057557,0.0001511441,0.0002449641,0.0003431303,0.0007914503,0.0003067706,0.0004175509,0.00005750482,0.00003611553],"category_scores_gemma":[0.00003266885,0.0001246116,0.0001545449,0.001104544,0.00002760527,0.0004117453,0.000103261,0.0001826098,0.000007661529],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002407508,"about_ca_system_score_gemma":0.0000239688,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001778669,"about_ca_topic_score_gemma":0.000003039422,"domain_scores_codex":[0.9988614,0.00007609859,0.0003105367,0.0002783415,0.0001751737,0.0002984355],"domain_scores_gemma":[0.9986518,0.0003496872,0.0002246759,0.0003581464,0.0001289238,0.0002867603],"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.000006229448,0.0001129401,0.002061736,0.00005069832,0.0004274493,3.19246e-7,0.0001951845,0.0004472721,0.0007291321,0.9691995,0.0001211752,0.02664841],"study_design_scores_gemma":[0.001734693,0.0002907832,0.01653769,0.00005067529,0.003115,0.0004140358,0.0004687009,0.2521156,0.002853247,0.5020149,0.2188733,0.001531353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007442884,0.002448905,0.9885573,0.000776403,0.00003043088,0.0004540895,0.00003757764,0.00004507239,0.0002072808],"genre_scores_gemma":[0.9768434,0.000337497,0.02168851,0.0001334569,0.000479215,0.0002493539,0.00001122652,0.00001090649,0.0002465003],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9694005,"threshold_uncertainty_score":0.6087276,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4323825473","doi":"10.1137/21m1459265","title":"GPMR: An Iterative Method for Unsymmetric Partitioned Linear Systems","year":2023,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Generalized minimal residual method; Mathematics; Linear system; Block (permutation group theory); Residual; Iterative method; Applied mathematics; Matrix (chemical analysis); Iterative and incremental development; Algorithm; Computer science; Combinatorics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.02283501379380748,"gpt":0.3525266311840969,"spread":0.3296916173902895,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001494608,0.000134675,0.0002966057,0.000994644,0.0006978018,0.0004854346,0.0004015682,0.00005441375,0.0000138102],"category_scores_gemma":[0.00003165966,0.0001072859,0.0002221008,0.004385368,0.00002049327,0.0003170921,0.00004453015,0.0001511664,0.00005037533],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002312748,"about_ca_system_score_gemma":0.00003158789,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004933996,"about_ca_topic_score_gemma":0.000001463148,"domain_scores_codex":[0.9985917,0.0002130523,0.0003886911,0.000346575,0.0002302854,0.0002297514],"domain_scores_gemma":[0.998529,0.0004277419,0.0002401889,0.0003807899,0.0002100523,0.0002122055],"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.00001446014,0.0001626391,0.0001313776,0.00003156904,0.0006263854,0.000005995551,0.0002504359,0.04961716,0.0003233202,0.9126782,0.0007910823,0.03536734],"study_design_scores_gemma":[0.0003024073,0.0001487237,0.0003564448,0.000008381664,0.0003056709,0.00002467715,0.000161026,0.9355074,0.0002072568,0.02844293,0.03434815,0.0001869427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0009263974,0.0001976463,0.9975051,0.0007068291,0.00005344208,0.0002940157,0.00004463834,0.0001058675,0.0001660862],"genre_scores_gemma":[0.563834,0.0009813933,0.4246865,0.0005115402,0.002275908,0.001135053,0.0002409213,0.00004976915,0.006284914],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8858902,"threshold_uncertainty_score":0.5366998,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2765671816","doi":"10.1137/140986566","title":"On the Symmetric Componentwise Relative Backward Error for Linear Systems of Equations","year":2017,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and 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":"McGill University","funders":"Fondation Sciences et Technologies pour l’Aéronautique et l’Espace","keywords":"Mathematics; Upper and lower bounds; Order (exchange); Applied mathematics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.03473794733293011,"gpt":0.3214565597452558,"spread":0.2867186124123257,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001105882,0.000118007,0.0002806498,0.0003923252,0.001474946,0.0003425058,0.0008703136,0.00004494067,0.00001146964],"category_scores_gemma":[0.0001962984,0.00007480011,0.000287339,0.0006849046,0.00008763461,0.0002116438,0.00007411919,0.0001935936,0.00002099023],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002227337,"about_ca_system_score_gemma":0.00003171467,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000976815,"about_ca_topic_score_gemma":0.0000015491,"domain_scores_codex":[0.9988625,0.0001169679,0.0003920313,0.000222209,0.0002597453,0.0001465545],"domain_scores_gemma":[0.996893,0.001239743,0.0007490126,0.0007912978,0.000225945,0.0001009241],"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.000007644047,0.00008302023,0.00007608614,0.000009245312,0.0003091524,4.356734e-7,0.00004659151,0.004495625,0.00004167476,0.9927825,0.00009704652,0.002050989],"study_design_scores_gemma":[0.0006888795,0.0002661932,0.002237988,0.00006451296,0.0009226763,0.00001202901,0.000157188,0.8503079,0.0002366149,0.1354222,0.009406458,0.0002772466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003936555,0.0002281743,0.9920432,0.002448646,0.00006505183,0.000394905,0.00004428674,0.00001390757,0.0008252607],"genre_scores_gemma":[0.9920871,0.00008795539,0.006860833,0.00005020622,0.0001533124,0.00009508694,0.000005358958,0.000006438009,0.0006536847],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9881506,"threshold_uncertainty_score":0.999825,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4407923948","doi":"10.1137/23m1605454","title":"M<scp>in</scp>A<scp>res</scp>: An Iterative Solver for Symmetric Linear Systems","year":2025,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Solver; Mathematics; Linear system; Iterative method; Applied mathematics; Combinatorics; Mathematical optimization; Algebra over a field; Mathematical analysis; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01116957610156792,"gpt":0.2962808699257752,"spread":0.2851112938242072,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001243426,0.0002441218,0.0005128321,0.001768257,0.0006170097,0.0007695492,0.000779409,0.0001186959,0.000002916386],"category_scores_gemma":[0.0001999632,0.000203363,0.00032198,0.004679175,0.00004878817,0.0004462261,0.00009772179,0.0003558827,0.00001880804],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006400248,"about_ca_system_score_gemma":0.00009350084,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001355668,"about_ca_topic_score_gemma":0.000008202394,"domain_scores_codex":[0.9979035,0.0002043569,0.0006540717,0.0005529925,0.0002949599,0.0003901644],"domain_scores_gemma":[0.99697,0.00157555,0.0003552037,0.0005788683,0.0002851204,0.0002352588],"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.000004493658,0.0004986431,0.001171598,0.00008586474,0.0007950345,0.00001097186,0.0005405093,0.01874353,0.0002508023,0.9619828,0.001969494,0.01394626],"study_design_scores_gemma":[0.001214055,0.0002765767,0.002286914,0.00008701239,0.0007882565,0.00003746421,0.001500681,0.7343164,0.0006142805,0.03948359,0.2192288,0.0001659399],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01369304,0.00204038,0.9807259,0.0002689512,0.0001369656,0.0005369951,0.00004262452,0.00005941393,0.00249566],"genre_scores_gemma":[0.9315045,0.001433274,0.04474098,0.000665786,0.001226919,0.0007273019,0.00007379672,0.00004279101,0.01958457],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.935985,"threshold_uncertainty_score":0.8292903,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2995137628","doi":"10.1137/19m1240964","title":"A Structured Condition Number for Kemeny's Constant","year":2019,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"Natural Sciences and Engineering Research Council of Canada; University of Manitoba","keywords":"Mathematics; Markov chain; Constant (computer programming); Combinatorics; Discrete mathematics; Upper and lower bounds; Expected value; Perturbation (astronomy); Markov process; Applied mathematics; Statistics; Mathematical analysis; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.009487592498764835,"gpt":0.333692457915539,"spread":0.3242048654167742,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003686476,0.00009679761,0.0002040026,0.0002806498,0.0002901078,0.0002216292,0.0003398914,0.00003768403,0.0001598666],"category_scores_gemma":[0.00001200718,0.0000777633,0.0001798337,0.001000326,0.00004530137,0.0002074824,0.00004395786,0.0001629006,0.00005822239],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003212907,"about_ca_system_score_gemma":0.00003726745,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.797297e-7,"about_ca_topic_score_gemma":0.000002224604,"domain_scores_codex":[0.999014,0.00005097056,0.000238313,0.0002660572,0.0002344291,0.0001962283],"domain_scores_gemma":[0.9989677,0.0001878242,0.0001711055,0.0003619135,0.0001812729,0.0001301802],"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.00001624081,0.00003701098,0.002805677,0.000009192815,0.0003000269,9.71787e-7,0.00003227588,0.0009873242,0.001883299,0.9843957,0.000165671,0.009366603],"study_design_scores_gemma":[0.001419251,0.000189305,0.004833825,0.00001603642,0.0003512662,0.00009066869,0.000201159,0.03521685,0.001242334,0.9037775,0.05227611,0.0003856903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0234746,0.00008213897,0.9744053,0.0005725276,0.00002682653,0.0003944976,0.0000321162,0.00002600865,0.0009860238],"genre_scores_gemma":[0.9716929,0.00008762858,0.02727272,0.0001322408,0.00006931813,0.00008137262,0.00001642698,0.000007039374,0.0006403447],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9482183,"threshold_uncertainty_score":0.3171096,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3047080367","doi":"10.1137/19m1290991","title":"BiLQ: An Iterative Method for Nonsymmetric Linear Systems with a Quasi-Minimum Error Property","year":2020,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lanczos resampling; Mathematics; Residual; Applied mathematics; Tridiagonal matrix; Lanczos algorithm; Linear system; Monotonic function; Norm (philosophy); Eigenvalues and eigenvectors; Mathematical optimization; Mathematical analysis; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.02744703060901632,"gpt":0.324059853564332,"spread":0.2966128229553157,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008067212,0.0001968917,0.0004354041,0.00044257,0.0005386605,0.0005244629,0.0005448784,0.00005600026,0.00001068477],"category_scores_gemma":[0.00003396131,0.0001110006,0.0001941116,0.003021003,0.0000335215,0.000363235,0.00004928375,0.0002363708,0.00001293003],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000222766,"about_ca_system_score_gemma":0.00007696867,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008765438,"about_ca_topic_score_gemma":0.000002230357,"domain_scores_codex":[0.9983449,0.0002386645,0.000417155,0.0004897768,0.0002792584,0.0002302684],"domain_scores_gemma":[0.9983839,0.0002501376,0.0003315673,0.0003674274,0.0002846153,0.0003823565],"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.0005918288,0.002367825,0.001212012,0.000418179,0.005374736,0.000059455,0.004777213,0.07624877,0.002206623,0.6807339,0.001507637,0.2245018],"study_design_scores_gemma":[0.000496279,0.0009052787,0.00005765232,0.0000132293,0.0004703382,0.00005172504,0.0003023289,0.9711969,0.0001507831,0.001005263,0.02511103,0.0002392173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000690499,0.0002513698,0.9957085,0.002543165,0.00001808957,0.0005512249,0.00003496691,0.00005742458,0.0001447724],"genre_scores_gemma":[0.3935344,0.00009924828,0.6030144,0.0008249193,0.0009456539,0.0004284604,0.0000282517,0.00003121835,0.001093479],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8949481,"threshold_uncertainty_score":0.5057408,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2988877209","doi":"10.1137/19m1298317","title":"On Fixed-Point, Krylov, and $2\\times 2$ Block Preconditioners for Nonsymmetric Problems","year":2020,"lang":"en","type":"preprint","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; U.S. Department of Energy","keywords":"Preconditioner; Schur complement; Mathematics; Generalized minimal residual method; Block (permutation group theory); Applied mathematics; Discretization; Block matrix; Krylov subspace; Convergence (economics); Linear system; Iterative method; Mathematical optimization; Mathematical analysis; Eigenvalues and eigenvectors; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.01329744191349747,"gpt":0.2782597135055652,"spread":0.2649622715920678,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000678935,0.0003545758,0.0006355799,0.001102486,0.0006151549,0.0008564848,0.0007353724,0.0001842732,0.00004197981],"category_scores_gemma":[0.00006375161,0.0003009361,0.0004847805,0.001480882,0.00006871016,0.0001555526,0.0003217525,0.0007395159,0.00002400244],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004849373,"about_ca_system_score_gemma":0.00009057901,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004072572,"about_ca_topic_score_gemma":0.000001889025,"domain_scores_codex":[0.9978037,0.0001207407,0.0006276633,0.0008403337,0.0003219566,0.0002855707],"domain_scores_gemma":[0.9976537,0.0005474659,0.0006729983,0.000606945,0.0001602186,0.000358631],"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.00005366211,0.0006270035,0.0002464202,0.0004820771,0.003810403,0.00001095858,0.0004009533,0.04041129,0.0001317423,0.8758471,0.006981868,0.07099652],"study_design_scores_gemma":[0.001108718,0.0005682915,0.001043774,0.0001582558,0.002451437,0.0000912215,0.00007750016,0.1898486,0.0002656054,0.7792407,0.02407681,0.001069144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001721204,0.0009420846,0.9899232,0.004989024,0.0001047789,0.0009856541,0.0002212063,0.00009401178,0.001018853],"genre_scores_gemma":[0.8788444,0.003827879,0.1102539,0.001332319,0.001551492,0.001452494,0.0002919338,0.00008427453,0.002361219],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8796692,"threshold_uncertainty_score":0.9999443,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2759845240","doi":"10.1137/16m1084717","title":"Discrete Fourier Transform Tensors and Their Ranks","year":2017,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Rank (graph theory); Tensor (intrinsic definition); Discrete Fourier transform (general); Dimension (graph theory); Generalization; Tensor contraction; Tensor field; Tensor product; Symmetric tensor; Pure mathematics; Tensor density; Mathematical analysis; Fourier transform; Combinatorics; Fourier analysis; Exact solutions in general relativity; Fractional Fourier transform","retraction":null,"screen_n_in":null,"score":{"opus":0.02347186208720721,"gpt":0.3424713928746753,"spread":0.3189995307874681,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0003437409,0.0001825228,0.0003609803,0.000221376,0.001801281,0.0004897289,0.0002699101,0.00007439448,0.0001258912],"category_scores_gemma":[0.00002903598,0.0001276576,0.0002706399,0.0002033834,0.0001542483,0.0001530408,0.00003273454,0.0002727828,0.00001531638],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001756569,"about_ca_system_score_gemma":0.00001359201,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006536867,"about_ca_topic_score_gemma":0.00002106182,"domain_scores_codex":[0.9989772,0.0000339698,0.000381032,0.0002572234,0.0001629474,0.0001875722],"domain_scores_gemma":[0.9985343,0.0001711412,0.0003526005,0.0006109303,0.00009953709,0.0002314849],"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.00007135318,0.0004946745,0.005184141,0.00007398814,0.002757427,0.000006796959,0.0008038488,0.0001104847,0.001743526,0.8453682,0.002706052,0.1406795],"study_design_scores_gemma":[0.001884873,0.0001227062,0.03418575,0.00005827173,0.003250706,0.0002165883,0.0009950834,0.009621623,0.000836645,0.7890844,0.1589366,0.0008068263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.292552,0.0006684331,0.6623728,0.02576601,0.00004053365,0.001111503,0.0002863157,0.0001407217,0.01706173],"genre_scores_gemma":[0.9890624,0.0008371786,0.008072356,0.000125285,0.0001964292,0.0001017315,0.00001157044,0.00002072463,0.00157234],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6965104,"threshold_uncertainty_score":0.9994982,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2013927575","doi":"10.1137/100812483","title":"Monotonicity of Perturbed Tridiagonal $M$-Matrices","year":2012,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Molecular spectroscopy and chirality","field":"Chemistry","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":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Tridiagonal matrix; Mathematics; Rank (graph theory); Monotonic function; Toeplitz matrix; Tridiagonal matrix algorithm; Applied mathematics; Matrix (chemical analysis); Inverse; Linear algebra; Combinatorics; Pure mathematics; Mathematical analysis; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.007754189406753544,"gpt":0.2929794551796511,"spread":0.2852252657728976,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002780511,0.0001206219,0.000289926,0.0001579168,0.0002011333,0.00004309036,0.0001572572,0.00007069033,0.0007729899],"category_scores_gemma":[0.00001647744,0.00009706728,0.0003316881,0.0004959457,0.00004678197,0.00008248312,0.00002503782,0.0002392849,0.00001009217],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003054664,"about_ca_system_score_gemma":0.00002380869,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001347545,"about_ca_topic_score_gemma":0.000002805688,"domain_scores_codex":[0.9990208,0.0000285513,0.0003684002,0.0001421324,0.0002375089,0.0002025969],"domain_scores_gemma":[0.9990985,0.00007345968,0.0003208023,0.0002521001,0.00006262861,0.0001925464],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0003201183,0.003618805,0.3552117,0.0003952101,0.007489071,0.000007584822,0.0007963639,0.001400185,0.442523,0.1606469,0.0009135281,0.02667756],"study_design_scores_gemma":[0.003318495,0.0002272664,0.1585209,0.000109545,0.01466228,0.000215421,0.001089914,0.004297015,0.5760643,0.01361546,0.2260374,0.001842036],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9632925,0.004394961,0.0248179,0.0003005626,0.00001773713,0.00007666896,0.00005809773,0.00002326247,0.007018269],"genre_scores_gemma":[0.9973084,0.0008966223,0.001160815,0.0000425931,0.0002633086,0.0000196089,0.00001720062,0.000007503833,0.0002839026],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2251239,"threshold_uncertainty_score":0.8463698,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4407998410","doi":"10.1137/23m1624580","title":"A Stable Matrix Version of the 2D Fast Multipole Method","year":2025,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Electromagnetic Scattering and Analysis","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Fast multipole method; Matrix (chemical analysis); Multipole expansion; Algebra over a field; Applied mathematics; Algorithm; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.003638787230225049,"gpt":0.288541207461415,"spread":0.2849024202311899,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002757374,0.0001110412,0.0002757351,0.0002897338,0.0004006409,0.00007722724,0.0002231076,0.00002715223,0.0002692039],"category_scores_gemma":[0.000003801407,0.00007571669,0.0004040142,0.001589836,0.000038014,0.00003546859,0.00005265199,0.0001945136,0.000007825763],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001777691,"about_ca_system_score_gemma":0.00004306198,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001380352,"about_ca_topic_score_gemma":0.000005579958,"domain_scores_codex":[0.9991109,0.00008441057,0.0003134115,0.0001790136,0.0001603346,0.0001519345],"domain_scores_gemma":[0.9992032,0.0001007845,0.0002335614,0.0003092514,0.00009477714,0.00005841239],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00009440789,0.001508132,0.350954,0.0001192214,0.01285213,0.000001100761,0.0003750102,0.06406362,0.1034123,0.1819801,0.006872802,0.2777672],"study_design_scores_gemma":[0.00747151,0.0005434729,0.2097329,0.0005805518,0.05006968,0.00002144886,0.00797653,0.1985473,0.1176805,0.09595065,0.3091593,0.002266236],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1603698,0.0005918673,0.8299479,0.00220771,0.00003767473,0.0002524908,0.00007926353,0.00001651254,0.006496728],"genre_scores_gemma":[0.9891986,0.00004027196,0.004468696,0.00004129692,0.00009259764,0.00002406913,0.00001035156,0.00000577739,0.006118369],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8288288,"threshold_uncertainty_score":0.3087637,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2979140977","doi":"10.1137/20m1358955","title":"Fast Interpolation-Based Globality Certificates for Computing Kreiss Constants and the Distance to Uncontrollability","year":2021,"lang":"en","type":"preprint","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Division of Mathematical Sciences; York University; Courant Institute of Mathematical Sciences, New York University; National Science Foundation","keywords":"Interpolation (computer graphics); Mathematics; Eigenvalues and eigenvectors; Variable (mathematics); Convergence (economics); Function (biology); State (computer science); Algorithm; Applied mathematics; Computer science; Mathematical analysis; Image (mathematics)","retraction":null,"screen_n_in":null,"score":{"opus":0.01250953728077803,"gpt":0.2994487403312132,"spread":0.2869392030504351,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00216405,0.0002632931,0.0006882547,0.0001880023,0.0008136643,0.001485649,0.0007572412,0.00009906422,0.00001113643],"category_scores_gemma":[0.0001487578,0.0001835631,0.000432755,0.0008998578,0.0001952969,0.00008421612,0.0003495618,0.0004169955,0.000001441932],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006779501,"about_ca_system_score_gemma":0.0001417587,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002451459,"about_ca_topic_score_gemma":0.00003616957,"domain_scores_codex":[0.9976813,0.0003631646,0.0007388863,0.0007007184,0.0002738127,0.0002421485],"domain_scores_gemma":[0.9966878,0.001236655,0.0005950507,0.0008284129,0.0004336729,0.0002183978],"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.0004896226,0.0005481028,0.008083357,0.0004245271,0.003014626,0.000006078503,0.001201598,0.1349891,0.0001637765,0.7067358,0.0002179541,0.1441254],"study_design_scores_gemma":[0.0009992806,0.00003261928,0.002425079,0.00008797421,0.0007348514,0.00000828048,0.0002791086,0.9366169,0.00006648712,0.05656216,0.001851783,0.0003355101],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006479854,0.0008655424,0.9838156,0.007639786,0.00009007284,0.0008269306,0.0001470704,0.00003732636,0.00009782213],"genre_scores_gemma":[0.9584227,0.00006252046,0.04078837,0.0003681363,0.0001631443,0.0001183807,0.00003052619,0.000007643065,0.0000385294],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9519429,"threshold_uncertainty_score":0.9995509,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2895568660","doi":"10.1137/18m1207399","title":"The Eigenvalue Distribution of Special 2-by-2 Block Matrix-Sequences with Applications to the Case of Symmetrized Toeplitz Structures","year":2019,"lang":"en","type":"preprint","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Advanced Algebra and Geometry","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Toeplitz matrix; Eigenvalues and eigenvectors; Combinatorics; Mathematics; Matrix (chemical analysis); Unitary matrix; Sequence (biology); Character (mathematics); Locally integrable function; Permutation (music); Singular value; Pure mathematics; Integrable system; Unitary state; Physics; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.01463111397823796,"gpt":0.3298336403774974,"spread":0.3152025263992594,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000822623,0.0003256236,0.0007760808,0.0003417694,0.0007310311,0.000169615,0.0006714241,0.0001657437,0.00003028729],"category_scores_gemma":[0.0001180733,0.0001747976,0.0004486583,0.00205156,0.000219136,0.00004509685,0.0001991926,0.0006762784,0.000005586418],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008191895,"about_ca_system_score_gemma":0.0001338942,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003554157,"about_ca_topic_score_gemma":0.0001028512,"domain_scores_codex":[0.9976524,0.000152159,0.00101715,0.0004298918,0.0004856685,0.000262798],"domain_scores_gemma":[0.9955333,0.001083423,0.001601611,0.001109448,0.0005196271,0.000152615],"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.0002344051,0.000437497,0.001014686,0.000453125,0.005104794,0.00001149891,0.0003389874,0.04233757,0.0003942431,0.9216593,0.00393323,0.0240807],"study_design_scores_gemma":[0.001124896,0.0004035358,0.001554097,0.0001873708,0.01160125,0.0005955535,0.004006714,0.001593681,0.002530944,0.9220144,0.0533414,0.001046156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2391795,0.002992451,0.7504227,0.001778938,0.00008639178,0.00278912,0.002432741,0.00002841392,0.000289773],"genre_scores_gemma":[0.9931171,0.0011331,0.004202354,0.00002118592,0.0006914235,0.0003266824,0.0001366633,0.00002675018,0.0003447275],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7539376,"threshold_uncertainty_score":0.7128041,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2792285932","doi":"10.1137/18m1177019","title":"Large-Scale and Global Maximization of the Distance to Instability","year":2018,"lang":"en","type":"preprint","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"École Polytechnique Fédérale de Lausanne; York University","keywords":"Subspace topology; Linear subspace; Instability; Maximization; Matrix (chemical analysis); Convergence (economics); Dimension (graph theory); Mathematical optimization; Rate of convergence; Mathematics; Scale (ratio); Computer science; Applied mathematics; Mathematical analysis; Physics; Key (lock); Combinatorics; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.008253515633085217,"gpt":0.2675889746154818,"spread":0.2593354589823965,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001609498,0.0001277768,0.0002597494,0.00009179032,0.0001371506,0.00007621689,0.0001772394,0.00008662675,0.00001005306],"category_scores_gemma":[0.000009541024,0.00009533593,0.0001373978,0.0005139275,0.00004994055,0.00002218906,0.0001478864,0.0002065023,9.159766e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005081269,"about_ca_system_score_gemma":0.00001483275,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008669202,"about_ca_topic_score_gemma":0.00008614407,"domain_scores_codex":[0.9992555,0.00003310465,0.0002834658,0.0001827037,0.000144543,0.0001007063],"domain_scores_gemma":[0.9992279,0.00001692922,0.0001399189,0.000412334,0.0001302636,0.00007265968],"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.0001059338,0.0006138555,0.226725,0.0005591969,0.004294317,0.00000281135,0.001428064,0.6818332,0.00217656,0.02870504,0.007770143,0.04578581],"study_design_scores_gemma":[0.0005760813,0.0001177746,0.3744801,0.0006312499,0.004645781,0.00003557136,0.0004295176,0.4059298,0.005436327,0.1447491,0.06171666,0.001252064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2396184,0.0005834282,0.7585596,0.0002078641,0.00004243636,0.0002398545,0.0001462816,0.00005067638,0.0005513874],"genre_scores_gemma":[0.9943199,0.0004967606,0.005002016,0.0000316738,0.00009428166,0.00002109549,0.000009002192,0.000008164483,0.00001714666],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7547014,"threshold_uncertainty_score":0.3887686,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4318700203","doi":"10.1137/22m1485759","title":"Smoothing Analysis of Two Robust Multigrid Methods for Elliptic Optimal Control Problems","year":2023,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":0,"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; Smoothing; Schur complement; Relaxation (psychology); Jacobian matrix and determinant; Mathematics; Applied mathematics; Conjugate gradient method; Optimal control; Mathematical optimization; Regularization (linguistics); Computer science; Partial differential equation; Mathematical analysis; Eigenvalues and eigenvectors","retraction":null,"screen_n_in":null,"score":{"opus":0.03460002450092436,"gpt":0.4013484676564062,"spread":0.3667484431554818,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001157051,0.0001676592,0.0006719628,0.001204873,0.0001828964,0.00006033916,0.0001788646,0.00005092787,0.00002017219],"category_scores_gemma":[0.0001396957,0.0001470925,0.0005091407,0.004409529,0.00004431632,0.00007531376,0.00001813036,0.0002044702,0.000003877974],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004276162,"about_ca_system_score_gemma":0.00001060728,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001235176,"about_ca_topic_score_gemma":9.340002e-7,"domain_scores_codex":[0.9985966,0.00009712017,0.0006888722,0.0002056509,0.0001936166,0.0002181544],"domain_scores_gemma":[0.9968275,0.002358313,0.0002774407,0.0002268374,0.0001849736,0.0001248651],"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.000004480432,0.0000302563,0.0001942473,0.00005516029,0.003792452,2.721498e-7,0.00006094184,0.9662272,0.001245744,0.005276846,0.00001246699,0.02309996],"study_design_scores_gemma":[0.0003147209,0.00002660148,0.0006031188,0.00001166485,0.005631139,0.000001968755,0.00005948673,0.9803634,0.0001788633,0.01164513,0.001020149,0.0001437559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003845484,0.0003755424,0.9951533,0.00009003843,0.00003155783,0.0003096407,0.00005039348,0.00009922325,0.00004479464],"genre_scores_gemma":[0.1136875,0.0002727453,0.8856647,0.00001931815,0.00009466261,0.0001695644,0.00002786718,0.00002728381,0.00003639578],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.109842,"threshold_uncertainty_score":0.5998259,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3027395381","doi":"10.1137/20m1364485","title":"A Rational Even-IRA Algorithm for the Solution of $T$-Even Polynomial Eigenvalue Problems","year":2021,"lang":"en","type":"preprint","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"York University","keywords":"Krylov subspace; Matrix polynomial; Eigenvalues and eigenvectors; Arnoldi iteration; Mathematics; Polynomial; Linearization; Generalized minimal residual method; Block (permutation group theory); Divide-and-conquer eigenvalue algorithm; Applied mathematics; Skew; Algorithm; Iterative method; Computer science; Combinatorics; Mathematical analysis; Nonlinear system","retraction":null,"screen_n_in":null,"score":{"opus":0.01656604732290797,"gpt":0.285140968863216,"spread":0.2685749215403081,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001429174,0.000256548,0.0005297162,0.0003895201,0.0007296844,0.0005431767,0.0009917113,0.0001728771,0.00004545787],"category_scores_gemma":[0.0000246894,0.0001890823,0.0007911691,0.0009099514,0.00009013318,0.0001621199,0.0003827902,0.0005557961,0.000003738941],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006486028,"about_ca_system_score_gemma":0.0003461671,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002480326,"about_ca_topic_score_gemma":0.00000909081,"domain_scores_codex":[0.9978071,0.0001899752,0.0007684323,0.000523527,0.0004616017,0.0002493469],"domain_scores_gemma":[0.9973733,0.0004183423,0.0009006967,0.0007366503,0.0004389331,0.0001320301],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003581177,0.0009225326,0.0001611832,0.0002658272,0.007033976,0.000005872803,0.0009877683,0.1565469,0.001311342,0.1113675,0.00182938,0.7195318],"study_design_scores_gemma":[0.0005551156,0.0001032957,0.0008219315,0.00008047606,0.001909208,0.00005689232,0.0001517175,0.9570028,0.0005295706,0.02695206,0.01141248,0.0004245131],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000614286,0.002641843,0.9937313,0.001902559,0.0001767744,0.0007066875,0.0001425681,0.000023981,0.00006005004],"genre_scores_gemma":[0.3880461,0.004975274,0.5980191,0.0003906318,0.003969251,0.001916736,0.0005057722,0.000066159,0.002111001],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8004558,"threshold_uncertainty_score":0.7710553,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4391141447","doi":"10.1137/22m1540624","title":"Constraint-Satisfying Krylov Solvers for Structure-Preserving Discretizations","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"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; European Research Consortium for Informatics and Mathematics","keywords":"Constraint (computer-aided design); Computer science; Generalized minimal residual method; Parallel computing; Computational science; Mathematics; Mathematical optimization; Algorithm; Iterative method; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.009056516811855151,"gpt":0.289155578164435,"spread":0.2800990613525799,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003822686,0.0001401158,0.0002076837,0.0004849605,0.0006710265,0.001029498,0.0004476255,0.00005159444,0.0001108809],"category_scores_gemma":[0.00002644452,0.0001124656,0.0002525378,0.001376759,0.00005705368,0.0003405088,0.00007252721,0.0002168103,0.000008233033],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002949712,"about_ca_system_score_gemma":0.00006216169,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000285519,"about_ca_topic_score_gemma":0.00000608508,"domain_scores_codex":[0.9988778,0.00004951843,0.0003255235,0.0003400858,0.000194403,0.0002126254],"domain_scores_gemma":[0.9989938,0.0003251577,0.0001097292,0.0003216686,0.00009361521,0.0001560386],"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.000002182241,0.00002048104,0.000206236,0.00003519339,0.0004732759,0.000003468155,0.0001538271,0.004034976,0.0005382143,0.9467145,0.0003039738,0.04751369],"study_design_scores_gemma":[0.0003351645,0.00008008267,0.0007555645,0.00006944732,0.001010004,0.0001045637,0.0002580416,0.6294876,0.0003574957,0.3133409,0.05375779,0.0004433252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001551919,0.000680148,0.9951617,0.001665488,0.00008900819,0.0002126353,0.00008459464,0.00008482618,0.0004696698],"genre_scores_gemma":[0.9148282,0.0002506265,0.08371238,0.0001241188,0.0004185449,0.00006016918,0.00003321573,0.00001473814,0.0005579904],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9132763,"threshold_uncertainty_score":0.9927476,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4406090494","doi":"10.1137/24m1630566","title":"Quotient Geometry of Bounded or Fixed-Rank Correlation Matrices","year":2025,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Quotient; Bounded function; Rank (graph theory); Algebraic geometry; Combinatorics; Geometry; Algebra over a field; Pure mathematics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.006066682395259513,"gpt":0.3082913045660522,"spread":0.3022246221707927,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001896627,0.0001269131,0.0003221752,0.0003674867,0.0003710973,0.00007173752,0.0001518663,0.00003531138,0.0004541813],"category_scores_gemma":[0.00001166342,0.00009277376,0.0002220166,0.001874347,0.00009320292,0.00007899542,0.00003605085,0.0001697393,0.00001411844],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001999939,"about_ca_system_score_gemma":0.00004104133,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001079437,"about_ca_topic_score_gemma":0.000001561006,"domain_scores_codex":[0.9990005,0.00002640614,0.0004918632,0.000185693,0.0001530417,0.000142442],"domain_scores_gemma":[0.9988899,0.0002841787,0.000347107,0.0002614162,0.0001334437,0.00008395179],"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.00002117351,0.0002217775,0.002742444,0.00002305849,0.0005203678,1.118653e-7,0.00002781753,0.003136485,0.000106861,0.9785683,0.0001602075,0.01447145],"study_design_scores_gemma":[0.0009617854,0.0001060666,0.004463165,0.00009421592,0.003022253,0.000003258087,0.001992888,0.009920401,0.0009447589,0.903296,0.07481539,0.0003798282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0223593,0.0002310513,0.9703455,0.0004159414,0.00002163172,0.000244123,0.00005430908,0.0000146051,0.006313519],"genre_scores_gemma":[0.9895579,0.0001433282,0.007474355,0.00003824271,0.000116491,0.00009078137,0.00003339154,0.000007951667,0.002537625],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9671986,"threshold_uncertainty_score":0.4972966,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4394761142","doi":"10.1137/22m1519523","title":"Analyzing Vector Orthogonalization Algorithms","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Orthogonalization; Lanczos resampling; Rounding; Algorithm; Hermitian matrix; Orthogonality; Mathematics; Conjugate gradient method; Lanczos algorithm; Krylov subspace; Matrix (chemical analysis); Round-off error; Sequence (biology); Stiefel manifold; Machine epsilon; Iterative method; Eigenvalues and eigenvectors; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.008949164999574367,"gpt":0.2848159887379113,"spread":0.2758668237383369,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006567531,0.0001464386,0.000220461,0.0007315191,0.0004283472,0.000982504,0.0003771935,0.00005161805,0.0001025369],"category_scores_gemma":[0.00001132337,0.0001160623,0.0002685038,0.003073458,0.0000317743,0.0003753404,0.00006077376,0.0002520288,0.00007998763],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000353499,"about_ca_system_score_gemma":0.00005184674,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000266359,"about_ca_topic_score_gemma":0.000001559123,"domain_scores_codex":[0.998742,0.00008660628,0.0003513782,0.0003719714,0.0002519955,0.0001960127],"domain_scores_gemma":[0.9991552,0.0001471083,0.0001110299,0.0003211705,0.00009154498,0.0001739773],"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.000002014772,0.00005125795,0.0002584638,0.00002177139,0.0005703077,0.00002085817,0.00008355988,0.002149596,0.0002016303,0.8485712,0.0002174369,0.1478519],"study_design_scores_gemma":[0.0002422497,0.0001064367,0.002627419,0.00006672487,0.001176655,0.0002178856,0.00005910035,0.7482098,0.000396007,0.08692167,0.1594331,0.0005429904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0009645424,0.002474272,0.9944291,0.001202531,0.00009425513,0.00009632017,0.000009973546,0.0001273633,0.0006016256],"genre_scores_gemma":[0.9406193,0.00217395,0.0527797,0.0002336188,0.001331128,0.00007652581,0.00003837713,0.0000289582,0.002718478],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9416494,"threshold_uncertainty_score":0.9474309,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}