{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Adrian S. Lewis","is_ca":true},{"name":"Hristo S. Sendov","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000947605,0.0009845054,0.0005379859,0.001621324,0.0005549669,0.001624925,0.0006803588,0.001410759,0.006295066],"category_scores_gemma":[0.004225913,0.0002896214,0.0005115431,0.0007420056,0.001770443,0.003359496,0.001182405,0.001593597,0.001848411],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000777539,"about_ca_system_score_gemma":0.0004852578,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006488421,"about_ca_topic_score_gemma":0.0004423977,"domain_scores_codex":[0.9993781,0.0001230221,0.00003181411,0.0001309812,0.0002231259,0.0001129013],"domain_scores_gemma":[0.9980183,0.0005927614,0.000205857,0.0002461479,0.0006656294,0.0002713714],"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.00006183396,0.00003036464,0.0007083761,0.00007106004,0.00001309701,0.0003887135,0.0002639531,0.01145243,0.01528821,0.9336768,0.003508626,0.03453657],"study_design_scores_gemma":[0.00001781822,0.00006912994,0.001079399,0.00004245468,0.00001016305,0.0006782418,0.0002095744,0.1824045,0.007574796,0.7975833,0.01027384,0.0000568087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.123481,0.0009330405,0.8360401,0.001107378,0.000298274,0.00005190917,0.0003578506,0.0005567973,0.03717357],"genre_scores_gemma":[0.8667603,0.001212605,0.09469093,0.0004514528,0.0003441129,0.0001360804,0.0004146569,0.0004868926,0.03550298],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006295066,"threshold_uncertainty_score":0.02105904,"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","authors":[{"name":"James V. Burke","is_ca":false},{"name":"Adrian S. Lewis","is_ca":true},{"name":"Michael L. Overton","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002148203,0.001912646,0.0009729183,0.001843997,0.0006188178,0.001742458,0.000936488,0.001761969,0.003797911],"category_scores_gemma":[0.006317785,0.0006517845,0.001294271,0.002018151,0.003104078,0.002295584,0.002856746,0.002819099,0.0007027843],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001397467,"about_ca_system_score_gemma":0.0008182801,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001766043,"about_ca_topic_score_gemma":0.001285274,"domain_scores_codex":[0.9988627,0.0005070631,0.00006810838,0.0001960888,0.0003200847,0.00004594275],"domain_scores_gemma":[0.996577,0.002350537,0.0003983685,0.0001795731,0.0003976232,0.00009693833],"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.0000416513,0.00004105385,0.0005089598,0.0002644085,0.00007100047,0.0001564878,0.0002208895,0.3039907,0.004011077,0.6370138,0.002760601,0.05091934],"study_design_scores_gemma":[0.000006804068,0.00003632806,0.0001805182,0.00004296176,0.00001090839,0.00007396082,0.00003293775,0.6932808,0.0007550813,0.2999819,0.005573746,0.00002403906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005609786,0.00500494,0.9762387,0.001034357,0.0001659045,0.00003061307,0.00004615062,0.0001404918,0.01172903],"genre_scores_gemma":[0.5219045,0.02030286,0.4186262,0.001114612,0.002102915,0.0006188475,0.0002918838,0.0008756644,0.03416251],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003797911,"threshold_uncertainty_score":0.01270533,"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","authors":[{"name":"Chun‐Hua Guo","is_ca":false},{"name":"Alan J. Laub","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007126311,0.000680507,0.0006814756,0.0005627337,0.0004818338,0.0004137963,0.0006844496,0.0008539342,0.002955696],"category_scores_gemma":[0.001337765,0.00035167,0.0006046353,0.0007594519,0.001108216,0.000875057,0.0009692785,0.001300324,0.001044562],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003513076,"about_ca_system_score_gemma":0.0005387125,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003131599,"about_ca_topic_score_gemma":0.003261228,"domain_scores_codex":[0.9996281,0.0001329254,0.00001357359,0.00003914614,0.0001693704,0.00001694651],"domain_scores_gemma":[0.9996624,0.000182585,0.00002868892,0.00002407569,0.00008684643,0.00001531199],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001504769,0.000112363,0.000700291,0.0007285306,0.00007486259,0.0003647996,0.000421761,0.4359582,0.01974008,0.252626,0.008745428,0.2803773],"study_design_scores_gemma":[0.00002295508,0.00008321112,0.0002103404,0.00003161725,0.00001253425,0.00009513,0.00001580096,0.9480091,0.002133756,0.02958123,0.01977408,0.00003032779],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003808091,0.0007048791,0.9910181,0.0001693543,0.0001126663,0.00006481526,0.00003129536,0.000134543,0.003956216],"genre_scores_gemma":[0.08733795,0.002245758,0.8960553,0.0002596875,0.0002501671,0.0003444463,0.0001354956,0.0001868635,0.01318444],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003131599,"threshold_uncertainty_score":0.009887815,"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","authors":[{"name":"Robert Bridson","is_ca":true},{"name":"Chen Greif","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007035067,0.000705038,0.001078412,0.0005978958,0.0004491131,0.0009240672,0.001744059,0.001370735,0.007382967],"category_scores_gemma":[0.001811196,0.0005908914,0.0006782389,0.0007016971,0.0006979151,0.001267325,0.001645596,0.001515192,0.003183894],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004628482,"about_ca_system_score_gemma":0.001547366,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001958551,"about_ca_topic_score_gemma":0.002571405,"domain_scores_codex":[0.9993598,0.000172021,0.000035408,0.0001105602,0.000266236,0.00005605194],"domain_scores_gemma":[0.9992982,0.0001755643,0.00004454419,0.0001545264,0.0002681109,0.00005894155],"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.0002159135,0.0001504298,0.0005985412,0.0001898706,0.00009411306,0.0002428747,0.0001153863,0.5225598,0.02076042,0.08305053,0.01269495,0.3593271],"study_design_scores_gemma":[0.00002895474,0.00002738354,0.00005594158,0.000006935868,0.000006287141,0.00004613339,0.000004732676,0.9841858,0.003063847,0.007982844,0.004580189,0.00001092128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001578866,0.00005014488,0.9966741,0.00006382449,0.00005309195,0.00003898942,0.00003130412,0.0003713835,0.001138413],"genre_scores_gemma":[0.03949752,0.0001020351,0.9540662,0.0001241749,0.00005669552,0.0001764046,0.0001604512,0.0001845713,0.005631927],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007382967,"threshold_uncertainty_score":0.02469844,"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","authors":[{"name":"Zhaosong Lu","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002949793,0.001460798,0.001641725,0.001290728,0.0007110134,0.00119093,0.002161132,0.002133931,0.003861245],"category_scores_gemma":[0.01022788,0.001044027,0.001838671,0.001405202,0.001289606,0.001604969,0.001846131,0.003165756,0.001519138],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001031993,"about_ca_system_score_gemma":0.002601135,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007288998,"about_ca_topic_score_gemma":0.009633038,"domain_scores_codex":[0.9985631,0.0006578999,0.00004855925,0.0002062362,0.000434059,0.00009022984],"domain_scores_gemma":[0.9952645,0.003488709,0.000272057,0.0003717009,0.0004966787,0.0001063515],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009238828,0.0001140588,0.0007947084,0.0003080417,0.0001370756,0.0001089482,0.0001504535,0.8018357,0.002466778,0.07626228,0.004175019,0.1135546],"study_design_scores_gemma":[0.00001159399,0.0000126726,0.0000609756,0.000008331223,0.000005717737,0.00002007554,0.000006555825,0.9868608,0.0003120252,0.01150101,0.001192248,0.000007990922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001246727,0.0002093269,0.9977217,0.00009341574,0.00002460676,0.00002808797,0.00003299604,0.0001871152,0.0004559835],"genre_scores_gemma":[0.06020716,0.0006684961,0.9338369,0.0002331382,0.0001594082,0.0004275769,0.0003656185,0.0003085012,0.003793358],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007288998,"threshold_uncertainty_score":0.01560014,"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","authors":[{"name":"James V. Burke","is_ca":false},{"name":"Adrian S. Lewis","is_ca":true},{"name":"Michael L. Overton","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006943435,0.000681871,0.0004150352,0.001676355,0.000726671,0.001422528,0.0008378653,0.0008186197,0.004510156],"category_scores_gemma":[0.008466361,0.0004154969,0.0004233991,0.0008487461,0.002044894,0.002569169,0.002066201,0.0009745906,0.0004711933],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007129445,"about_ca_system_score_gemma":0.0004239359,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007576203,"about_ca_topic_score_gemma":0.0005796615,"domain_scores_codex":[0.999252,0.0001509602,0.00003833928,0.0001408225,0.000325767,0.00009197342],"domain_scores_gemma":[0.994609,0.002733646,0.0008111527,0.0007285265,0.0007758908,0.0003418448],"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.0005087302,0.00009820963,0.006934611,0.0001741655,0.00007524746,0.0002801579,0.0006694838,0.2488644,0.02534288,0.6192157,0.001259722,0.09657682],"study_design_scores_gemma":[0.00002110273,0.0001387032,0.004355335,0.00003443344,0.00001662966,0.0002567695,0.0001381428,0.6116233,0.01339606,0.367798,0.002170936,0.00005068117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.467553,0.0002315662,0.5173445,0.0002945114,0.00002792583,0.00003814763,0.0001250824,0.0003467648,0.01403846],"genre_scores_gemma":[0.9475322,0.0001480788,0.0495512,0.00005359558,0.00001856639,0.00008394924,0.0001587608,0.00009361991,0.002360025],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004510156,"threshold_uncertainty_score":0.01508802,"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","authors":[{"name":"Rong-Qing Jia","is_ca":true},{"name":"Ding‐Xuan Zhou","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002244417,0.0007074451,0.0005485208,0.0009325009,0.0005232954,0.001139687,0.0007449946,0.0009966481,0.001519211],"category_scores_gemma":[0.009581954,0.0003788426,0.0007152369,0.0003515068,0.002156514,0.001256939,0.00222069,0.001156064,0.0002560508],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001554233,"about_ca_system_score_gemma":0.0009173204,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002973077,"about_ca_topic_score_gemma":0.001980542,"domain_scores_codex":[0.9989763,0.0003409807,0.00008345181,0.0001342322,0.0003549286,0.0001100961],"domain_scores_gemma":[0.9966012,0.001894853,0.0005314064,0.0003455192,0.0004353825,0.0001915617],"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.0003129836,0.00004843554,0.003811436,0.0001412819,0.00003547575,0.0001821753,0.0006473965,0.2582039,0.05696636,0.6391468,0.0005975625,0.03990621],"study_design_scores_gemma":[0.00001757528,0.00005683682,0.0002810372,0.00002150313,0.000006249323,0.00005150267,0.0000342538,0.9307511,0.008636144,0.05899453,0.001132534,0.00001677181],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2015697,0.000325457,0.7920185,0.0002211427,0.00006156044,0.00008111856,0.00004134546,0.0001310748,0.005550036],"genre_scores_gemma":[0.7327773,0.0003536308,0.2592975,0.00009070413,0.00003736183,0.0001637902,0.0001382266,0.0001385367,0.007002896],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002973077,"threshold_uncertainty_score":0.01186973,"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","authors":[{"name":"Lu‐Bin Cui","is_ca":false},{"name":"Wen Li","is_ca":false},{"name":"Michael K. Ng","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002883513,0.0007602489,0.0008619452,0.0021536,0.002199,0.001960429,0.0009322047,0.001103283,0.005465727],"category_scores_gemma":[0.006422455,0.0003775242,0.001028569,0.0009464081,0.003923489,0.00594468,0.002462213,0.002721925,0.001005067],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001389785,"about_ca_system_score_gemma":0.001072347,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009802646,"about_ca_topic_score_gemma":0.0008495998,"domain_scores_codex":[0.998207,0.0003605915,0.0001053945,0.0003216025,0.0006853607,0.000319974],"domain_scores_gemma":[0.9960564,0.001638429,0.0004196382,0.0003841181,0.0009602756,0.0005411883],"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.0000151205,0.000008559624,0.0001597264,0.00002307104,0.000005565149,0.00005886246,0.0000573219,0.001275414,0.0008077874,0.9953483,0.0004038092,0.001836539],"study_design_scores_gemma":[0.000005908837,0.00001695511,0.0001820249,0.00001248755,0.000003831841,0.00009478514,0.00003319886,0.01834307,0.0006674042,0.9794741,0.001152957,0.00001327854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2089217,0.001685381,0.7123494,0.002375053,0.0003694077,0.00008478433,0.0004930134,0.0002419537,0.07347941],"genre_scores_gemma":[0.9399772,0.001099094,0.04575387,0.0004953121,0.0003900067,0.0001820597,0.0004614745,0.0001143821,0.0115266],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005465727,"threshold_uncertainty_score":0.01828462,"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","authors":[{"name":"Xiao-Wen Chang","is_ca":true},{"name":"Christopher C. Paige","is_ca":true},{"name":"David Titley-Péloquin","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01499108,0.001503363,0.001549094,0.00166992,0.0009351234,0.002014062,0.002184481,0.002255147,0.002986275],"category_scores_gemma":[0.0686665,0.0007582093,0.00103738,0.001125854,0.002976218,0.002386433,0.002722976,0.003084913,0.001259777],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001030792,"about_ca_system_score_gemma":0.00136713,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008871568,"about_ca_topic_score_gemma":0.0006057679,"domain_scores_codex":[0.9900789,0.005805972,0.0005765776,0.000619014,0.002561358,0.0003581385],"domain_scores_gemma":[0.9521485,0.03572194,0.002999547,0.00162937,0.0066942,0.0008064768],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005121968,0.0000912581,0.003720484,0.0009626835,0.000162551,0.0006319525,0.0008427894,0.4414478,0.01971217,0.4357149,0.005229499,0.09097162],"study_design_scores_gemma":[0.00003148139,0.0001001104,0.0002737829,0.00009750577,0.00001598012,0.0001067253,0.00003898362,0.9114553,0.006311006,0.0781446,0.003384831,0.00003974507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003019304,0.0003051868,0.9949507,0.0002067831,0.00002944396,0.00004073801,0.000018489,0.0001264106,0.001302971],"genre_scores_gemma":[0.1801955,0.0006065183,0.8134109,0.0003908015,0.0001516481,0.0007063451,0.0002722646,0.0006398609,0.00362611],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01499108,"threshold_uncertainty_score":0.07928133,"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","authors":[{"name":"Junjun Pan","is_ca":false},{"name":"Michael K. Ng","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002737901,0.001394212,0.001225706,0.0008567469,0.0004172495,0.001155591,0.001070141,0.0009723688,0.001882744],"category_scores_gemma":[0.009920716,0.0004852109,0.0008424573,0.001641381,0.001789624,0.002362334,0.001392091,0.001701826,0.0009451431],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005325571,"about_ca_system_score_gemma":0.0008363445,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00219666,"about_ca_topic_score_gemma":0.001703378,"domain_scores_codex":[0.9982255,0.0009139301,0.00006455232,0.000277534,0.0004101362,0.000108334],"domain_scores_gemma":[0.9967977,0.001930105,0.0003091443,0.0002903721,0.0005926635,0.00007986123],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001494287,0.00009174037,0.001184577,0.0005142864,0.000121836,0.0002840937,0.0001851415,0.5537032,0.008793919,0.2551241,0.008803943,0.1710438],"study_design_scores_gemma":[0.000007144735,0.00002984888,0.0001050879,0.00001587546,0.000006811107,0.00004806963,0.00001588576,0.9521193,0.0009109551,0.04512249,0.001604805,0.0000137649],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002046901,0.0002098561,0.9968287,0.0001137777,0.00003082817,0.00001874458,0.0000375964,0.00004834582,0.0006652064],"genre_scores_gemma":[0.2302008,0.001961346,0.7622495,0.0003095506,0.0003876419,0.0003546887,0.0008230224,0.0001686936,0.003544799],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002737901,"threshold_uncertainty_score":0.01447952,"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","authors":[{"name":"Steven Elsworth","is_ca":true},{"name":"Stefan Güttel","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003696087,0.0004028533,0.0006839076,0.0004345862,0.0003679609,0.001006556,0.0008545317,0.0007349877,0.0116654],"category_scores_gemma":[0.001220199,0.0002996503,0.0004651434,0.0003519333,0.000569966,0.000987146,0.001007413,0.001029165,0.005382706],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004142261,"about_ca_system_score_gemma":0.0009144433,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001990513,"about_ca_topic_score_gemma":0.001593938,"domain_scores_codex":[0.9996637,0.00008417056,0.00001288956,0.00003820496,0.0001521193,0.00004896126],"domain_scores_gemma":[0.9996619,0.00008996684,0.00002830479,0.00007892025,0.0001137122,0.00002712695],"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.0001554231,0.00004900235,0.0005986692,0.0002721756,0.00003816697,0.0001525338,0.0002012968,0.2011389,0.02798262,0.5750474,0.01458182,0.1797819],"study_design_scores_gemma":[0.00002802523,0.00004554983,0.0001983773,0.00003410549,0.00001228053,0.000124825,0.00003420395,0.8911331,0.005346138,0.06658484,0.03643025,0.00002839271],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005209646,0.0003121786,0.9721296,0.0001514993,0.0001133776,0.00005332146,0.0001543125,0.0005740453,0.02130186],"genre_scores_gemma":[0.2657274,0.001285167,0.6789336,0.0002602043,0.0001390909,0.000302044,0.0005646667,0.001070834,0.05171689],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0116654,"threshold_uncertainty_score":0.03902465,"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","authors":[{"name":"Nicholas J. Higham","is_ca":false},{"name":"Xiaobo Liu","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001518053,0.001458332,0.001063688,0.001487453,0.001233246,0.001743423,0.002310467,0.001221721,0.0173974],"category_scores_gemma":[0.00593974,0.0005691153,0.000902043,0.00147167,0.0008698601,0.001907467,0.001411821,0.002060233,0.01062577],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001336835,"about_ca_system_score_gemma":0.002446796,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003390218,"about_ca_topic_score_gemma":0.006395856,"domain_scores_codex":[0.9989119,0.0001946884,0.00006467425,0.0001257587,0.000607758,0.00009530973],"domain_scores_gemma":[0.9981232,0.0005805505,0.0001183473,0.0003540284,0.0007467755,0.00007707337],"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.0004017847,0.0001682244,0.000969152,0.0004619187,0.0001054986,0.0002800802,0.0002976657,0.1528117,0.01933177,0.2142255,0.03279525,0.5781515],"study_design_scores_gemma":[0.000109821,0.0001041951,0.0002190958,0.00005149156,0.0000209748,0.0001864909,0.00004323512,0.9086466,0.02086592,0.04450515,0.02518592,0.00006119697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001855905,0.00009317226,0.992833,0.0000712534,0.00005065181,0.0000575603,0.00008754853,0.002384496,0.002566264],"genre_scores_gemma":[0.03749354,0.0001071884,0.9565713,0.00008899538,0.00004104113,0.0002349968,0.00032196,0.0007995618,0.004341431],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0173974,"threshold_uncertainty_score":0.05820012,"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","authors":[{"name":"Arno Berger","is_ca":true},{"name":"Theodore P. Hill","is_ca":true},{"name":"Bahar Kaynar","is_ca":false},{"name":"Ad Ridder","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002505587,0.0006578605,0.001546478,0.001253404,0.002153511,0.002803867,0.001419895,0.002572868,0.005730203],"category_scores_gemma":[0.01475859,0.0006255717,0.001132539,0.001054561,0.00430624,0.004256365,0.001398953,0.003227524,0.001583194],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001928597,"about_ca_system_score_gemma":0.001787399,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005925769,"about_ca_topic_score_gemma":0.005046561,"domain_scores_codex":[0.997844,0.0005591869,0.0001044576,0.0004921436,0.0005562681,0.0004439899],"domain_scores_gemma":[0.9864611,0.008945985,0.001185176,0.001346824,0.001648476,0.0004125237],"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.00004149752,0.00002231708,0.00129751,0.00002983904,0.00001973373,0.0002021767,0.0003458823,0.02806818,0.0007612985,0.9644812,0.00103827,0.003692151],"study_design_scores_gemma":[0.00003476701,0.00002326959,0.0005544862,0.00003568043,0.00001121614,0.0001672706,0.00007569563,0.2825963,0.0009317176,0.7129118,0.002611935,0.00004578265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1232205,0.0005018122,0.8484331,0.001765899,0.0001235531,0.0002265573,0.0004519638,0.0005390854,0.02473756],"genre_scores_gemma":[0.9157555,0.0006201338,0.06977621,0.0005658296,0.0001828189,0.0004515623,0.0003775289,0.0001109889,0.01215942],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005925769,"threshold_uncertainty_score":0.01916945,"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","authors":[{"name":"Grégoire Pichon","is_ca":false},{"name":"Mathieu Faverge","is_ca":false},{"name":"Pierre Ramet","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006920129,0.001047166,0.0008845048,0.0005844468,0.0006288523,0.0007554179,0.0009583507,0.0005837565,0.006480933],"category_scores_gemma":[0.00218571,0.0003923867,0.0005386755,0.0006593287,0.0006770123,0.0008102907,0.0007883756,0.001323017,0.002276561],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000712736,"about_ca_system_score_gemma":0.001460908,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005058858,"about_ca_topic_score_gemma":0.007902917,"domain_scores_codex":[0.999416,0.0001654015,0.00003181016,0.00005647448,0.0002234123,0.0001069835],"domain_scores_gemma":[0.9991135,0.0003651344,0.00008848513,0.0001475196,0.0002227896,0.00006252924],"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.0006348887,0.0003326569,0.001173163,0.000397763,0.00007225864,0.0003249988,0.0003519792,0.4855049,0.06411418,0.1215755,0.01935375,0.306164],"study_design_scores_gemma":[0.00004479264,0.00009165033,0.0001333409,0.00002331019,0.00001432764,0.00006428683,0.00003673172,0.9570467,0.01749552,0.0142302,0.0108024,0.00001675166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0206608,0.0004399114,0.9656839,0.0002079499,0.0001577429,0.00007495611,0.00009432255,0.002042681,0.01063782],"genre_scores_gemma":[0.2001561,0.0005180964,0.7843534,0.0002637923,0.0001053558,0.0002371333,0.0006000337,0.001828715,0.01193743],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006480933,"threshold_uncertainty_score":0.02168089,"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","authors":[{"name":"Hans De Sterck","is_ca":true},{"name":"Yunhui He","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001946161,0.0008402342,0.0005731685,0.001136007,0.0006456572,0.0008050815,0.001111252,0.0008702945,0.004493813],"category_scores_gemma":[0.01084023,0.0003211566,0.0008379068,0.0003562003,0.001962749,0.001450951,0.001620371,0.001660752,0.0007894153],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001232365,"about_ca_system_score_gemma":0.001162342,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003541518,"about_ca_topic_score_gemma":0.002248165,"domain_scores_codex":[0.9995486,0.0001574239,0.00001762873,0.00005373104,0.0001448399,0.00007771437],"domain_scores_gemma":[0.996803,0.001517264,0.0003979818,0.0002617714,0.0007461028,0.0002737967],"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.0002123811,0.0001007771,0.00427096,0.0003687792,0.0001022529,0.0003528717,0.0004144529,0.2682447,0.01107908,0.6827036,0.00366605,0.02848409],"study_design_scores_gemma":[0.0000120896,0.0000558229,0.0004635825,0.00004032885,0.000009531646,0.00005492386,0.00003164458,0.9458578,0.001547559,0.05055949,0.001351689,0.00001547042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1693616,0.001944325,0.8013602,0.0009192813,0.0002435472,0.0001297613,0.0000835243,0.0006254795,0.0253324],"genre_scores_gemma":[0.9116095,0.0007949981,0.07238403,0.000327345,0.0001323158,0.0002082289,0.0001525242,0.000290237,0.01410067],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004493813,"threshold_uncertainty_score":0.01503325,"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","authors":[{"name":"Wai‐Ki Ching","is_ca":false},{"name":"Michael K. Ng","is_ca":true},{"name":"You‐Wei Wen","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005838138,0.0006724487,0.0006277005,0.0002350825,0.000369295,0.0005446079,0.0004889484,0.001031318,0.003125676],"category_scores_gemma":[0.002206607,0.0002985257,0.0003547541,0.0004118565,0.0009669284,0.0007904017,0.000661888,0.001102092,0.0006457262],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003458198,"about_ca_system_score_gemma":0.001103561,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003741842,"about_ca_topic_score_gemma":0.004241494,"domain_scores_codex":[0.9996241,0.000153596,0.00001325211,0.0000447966,0.0001263387,0.00003791793],"domain_scores_gemma":[0.999138,0.0005457168,0.00006888159,0.00007078498,0.0001369294,0.00003965554],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001740815,0.00008241965,0.0004595048,0.0002181188,0.00004141594,0.0002596014,0.0001615028,0.8079608,0.02333002,0.1075134,0.002626469,0.05717275],"study_design_scores_gemma":[0.000009611335,0.00002262017,0.00004145338,0.000003371693,0.000002994873,0.00001613821,0.00001009087,0.9907941,0.001859755,0.006220474,0.001015141,0.00000414545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01004042,0.0001277155,0.9879653,0.0001032659,0.00003555935,0.00003204087,0.00002436665,0.00008232878,0.001589041],"genre_scores_gemma":[0.322817,0.0006192655,0.6662315,0.0001474232,0.00009860581,0.0002377372,0.0001424997,0.0001175493,0.009588508],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003741842,"threshold_uncertainty_score":0.01045638,"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","authors":[{"name":"Carlos Beltrán","is_ca":false},{"name":"Jean‐Pierre Dedieu","is_ca":false},{"name":"Gregorio Malajovich","is_ca":false},{"name":"M. Shub","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001585475,0.0009641631,0.0008882302,0.001410236,0.001109528,0.0026715,0.001000444,0.0009608975,0.01189788],"category_scores_gemma":[0.01049788,0.0003953454,0.0009036461,0.0007296705,0.002489751,0.003312533,0.001414188,0.002408921,0.001565591],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002685863,"about_ca_system_score_gemma":0.001539091,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003673919,"about_ca_topic_score_gemma":0.0019848,"domain_scores_codex":[0.9986653,0.0002660931,0.00006898605,0.0003116271,0.0004671973,0.0002209015],"domain_scores_gemma":[0.994076,0.003089767,0.0005883885,0.0003371109,0.00134772,0.0005610113],"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.0001461246,0.00003732887,0.00164705,0.0001559613,0.00002036749,0.0001834574,0.0001586481,0.02053317,0.004621625,0.9498452,0.009842237,0.01280885],"study_design_scores_gemma":[0.00003521967,0.0001337658,0.002493163,0.00006770264,0.00002085403,0.0003397469,0.000135464,0.3480811,0.005674682,0.6298941,0.01304438,0.00007988519],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2226707,0.001989934,0.5767245,0.004466496,0.0004221839,0.0003966002,0.002978249,0.0005053217,0.1898461],"genre_scores_gemma":[0.912222,0.001201465,0.05358962,0.0006903914,0.0004131057,0.000541934,0.002968305,0.000495065,0.02787813],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01189788,"threshold_uncertainty_score":0.03980243,"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","authors":[{"name":"Yueh‐Cheng Kuo","is_ca":false},{"name":"Shih-Feng Shieh","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006503462,0.0006556563,0.0005184846,0.001447076,0.001247349,0.00106067,0.0006079841,0.001104705,0.003094462],"category_scores_gemma":[0.005437965,0.0003672505,0.0006850482,0.0006406435,0.002181484,0.00157393,0.002397834,0.00128136,0.0004894651],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008189849,"about_ca_system_score_gemma":0.0005701201,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005004723,"about_ca_topic_score_gemma":0.0002025805,"domain_scores_codex":[0.9996905,0.00008517459,0.00001750793,0.00006884033,0.0001012697,0.00003664799],"domain_scores_gemma":[0.9989579,0.0003580506,0.0001945877,0.0001292683,0.0001915336,0.0001686903],"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.00007989501,0.0000470898,0.001500955,0.0001777971,0.00001517436,0.0002299534,0.0005480737,0.04795787,0.01185118,0.9051963,0.0006890005,0.03170674],"study_design_scores_gemma":[0.00004570228,0.0004013247,0.001157783,0.00008780233,0.00001343855,0.0007741922,0.0002706886,0.5135351,0.009793879,0.4592996,0.01456837,0.0000521246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4179383,0.001170141,0.5549664,0.0007908976,0.00008214622,0.000161945,0.0001142168,0.0003014244,0.02447451],"genre_scores_gemma":[0.8653609,0.0008297728,0.1260474,0.00006983746,0.00007089315,0.000133708,0.0001176815,0.0001545282,0.007215206],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003094462,"threshold_uncertainty_score":0.01035202,"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","authors":[{"name":"Alexis Montoison","is_ca":true},{"name":"Dominique Orban","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007565478,0.001022021,0.000852606,0.0004157056,0.0003257441,0.0005924327,0.001544236,0.001149774,0.00573104],"category_scores_gemma":[0.002703709,0.0005434686,0.0007221193,0.0005003485,0.0006384724,0.0009712332,0.001758793,0.00202118,0.002547252],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002257487,"about_ca_system_score_gemma":0.001061179,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001722536,"about_ca_topic_score_gemma":0.002261102,"domain_scores_codex":[0.9993771,0.0002246669,0.0000243704,0.00007363583,0.0002603943,0.0000398279],"domain_scores_gemma":[0.9992422,0.0003447661,0.00008101235,0.0001136487,0.000178044,0.00004033966],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001909696,0.00008589552,0.0005182337,0.0006109535,0.000147687,0.0003272161,0.0003397412,0.661333,0.03871744,0.03789809,0.01672972,0.2431011],"study_design_scores_gemma":[0.00003341328,0.00005512534,0.00007329071,0.00002218391,0.000009565773,0.00009355136,0.00001559786,0.9777741,0.005297787,0.005337327,0.01127074,0.00001720747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001070129,0.00007689535,0.9972432,0.00006369458,0.00003103574,0.0000228679,0.00004357812,0.0008009665,0.0006475123],"genre_scores_gemma":[0.03454547,0.0001693057,0.9610434,0.0001135211,0.0000431007,0.0001599973,0.0002674444,0.000785484,0.002872296],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00573104,"threshold_uncertainty_score":0.01917225,"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","authors":[{"name":"Stanley C. Eisenstat","is_ca":false},{"name":"Serge Gratton","is_ca":false},{"name":"David Titley-Péloquin","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008389208,0.002358997,0.001257558,0.001593418,0.0009247098,0.001841271,0.001462242,0.001795321,0.008262251],"category_scores_gemma":[0.03452754,0.0006093046,0.0009634275,0.0008607527,0.002995786,0.003706152,0.004859158,0.004148209,0.002543294],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001331038,"about_ca_system_score_gemma":0.002037845,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002058784,"about_ca_topic_score_gemma":0.001968384,"domain_scores_codex":[0.9964855,0.001207077,0.0002493532,0.000359083,0.001457539,0.0002415044],"domain_scores_gemma":[0.9817758,0.01323407,0.0008267111,0.00138374,0.002446996,0.0003327432],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004276378,0.00009196004,0.0009496594,0.0008082176,0.0000917435,0.0003025472,0.0003870928,0.4858958,0.01503449,0.400358,0.005429613,0.09022308],"study_design_scores_gemma":[0.00001660748,0.00007805824,0.0001713938,0.0000779199,0.00001689605,0.00008644347,0.00003720661,0.8879693,0.005622118,0.1035869,0.002303187,0.00003392699],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005275692,0.0004969978,0.9891627,0.0004147055,0.0002373092,0.00004682362,0.00005741942,0.0001963668,0.004111994],"genre_scores_gemma":[0.4535058,0.002250807,0.5289289,0.0008394929,0.0004284812,0.0005024105,0.0005085095,0.0008760055,0.0121595],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008389208,"threshold_uncertainty_score":0.0443669,"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","authors":[{"name":"Alexis Montoison","is_ca":true},{"name":"Dominique Orban","is_ca":true},{"name":"Michael A. Saunders","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008036856,0.001317689,0.0007539101,0.0009177091,0.0008309674,0.001521721,0.002246082,0.001900462,0.04273115],"category_scores_gemma":[0.003618827,0.000672705,0.0008641108,0.0009755006,0.0007458918,0.001398483,0.002553816,0.002177058,0.02083356],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005001394,"about_ca_system_score_gemma":0.002246408,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004133607,"about_ca_topic_score_gemma":0.01018951,"domain_scores_codex":[0.9993579,0.0001479967,0.00003948149,0.00009144474,0.0002770545,0.00008619382],"domain_scores_gemma":[0.9988636,0.0003580456,0.00006995544,0.0002008172,0.0004051335,0.0001026115],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0005157607,0.0003753791,0.001193978,0.0007202561,0.0002037119,0.0007644854,0.0003041156,0.147471,0.02237179,0.09924126,0.2748951,0.4519432],"study_design_scores_gemma":[0.0001443908,0.00005128203,0.000138661,0.00004679633,0.00001708406,0.0001622784,0.00003930756,0.9217563,0.01250066,0.01943471,0.04567165,0.00003685592],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003699362,0.00008339674,0.9608746,0.0003500654,0.000331074,0.0001246753,0.0009513136,0.01494647,0.01863912],"genre_scores_gemma":[0.07015283,0.0001099233,0.8864147,0.0004530367,0.0001389438,0.0003131813,0.002071118,0.01005664,0.0302896],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.04273115,"threshold_uncertainty_score":0.1429499,"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","authors":[{"name":"Jane Breen","is_ca":false},{"name":"Steve Kirkland","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005261654,0.0007914957,0.000749993,0.001976378,0.001280888,0.001762652,0.001749392,0.001645674,0.01001598],"category_scores_gemma":[0.05083714,0.0004208373,0.0008277028,0.0009628367,0.005046545,0.006352587,0.002144254,0.003905285,0.0008784274],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002715499,"about_ca_system_score_gemma":0.001867089,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001084061,"about_ca_topic_score_gemma":0.0008324086,"domain_scores_codex":[0.9978341,0.0005291494,0.0001024566,0.0005923006,0.00068485,0.0002572367],"domain_scores_gemma":[0.9646984,0.02606641,0.002802812,0.002965921,0.002000288,0.001466168],"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.0001423289,0.00004440208,0.001325663,0.0001120678,0.00002287728,0.0001314904,0.0002072699,0.05021383,0.008818816,0.9277449,0.001948966,0.00928748],"study_design_scores_gemma":[0.00003540152,0.00008832906,0.001047465,0.00006462926,0.00001462309,0.0001353739,0.00006817252,0.3134331,0.007054289,0.6761196,0.001851514,0.00008745915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2206357,0.001076592,0.7417256,0.002348444,0.0003177243,0.0002238188,0.0006630825,0.0008010734,0.03220813],"genre_scores_gemma":[0.9171785,0.0005089653,0.07660123,0.0004413365,0.0002335417,0.0003606342,0.0002684016,0.0002733185,0.004133954],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01001598,"threshold_uncertainty_score":0.03350681,"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","authors":[{"name":"Alexis Montoison","is_ca":true},{"name":"Dominique Orban","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001345259,0.0009612202,0.001003981,0.0005094919,0.0004913583,0.0007425511,0.001771425,0.001129184,0.005881339],"category_scores_gemma":[0.00303045,0.0006226173,0.0006698814,0.0005010933,0.000933252,0.0009716873,0.002266571,0.001764147,0.002596798],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004547041,"about_ca_system_score_gemma":0.001500607,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002673072,"about_ca_topic_score_gemma":0.003117444,"domain_scores_codex":[0.9992954,0.0002439765,0.00002967407,0.00005431768,0.0003141078,0.00006253488],"domain_scores_gemma":[0.9990134,0.0003929877,0.0001222431,0.000117237,0.000288901,0.00006522612],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002379323,0.0001328092,0.0008580402,0.0007018448,0.0001011756,0.0002162454,0.0003257168,0.7396883,0.02161292,0.06132599,0.01436502,0.1604339],"study_design_scores_gemma":[0.00002585009,0.0000316954,0.00004740723,0.00001276343,0.000003330526,0.00001733804,0.00001000692,0.9908619,0.001737507,0.003696139,0.003546482,0.000009530236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001504664,0.00007419787,0.9962483,0.00008548368,0.0000351145,0.00003154363,0.00003348668,0.0008940067,0.001093141],"genre_scores_gemma":[0.07581807,0.0001191137,0.9181412,0.0002334219,0.00005069431,0.0003276909,0.0002735714,0.00109869,0.003937609],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005881339,"threshold_uncertainty_score":0.01967502,"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","authors":[{"name":"Ben S. Southworth","is_ca":false},{"name":"Abdullah A. Sivas","is_ca":true},{"name":"Sander Rhebergen","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002038458,0.001072438,0.0007199775,0.0008719828,0.0006067008,0.0007193431,0.0006458723,0.0009680455,0.003944395],"category_scores_gemma":[0.006719634,0.000361381,0.0006182421,0.0008101592,0.00255461,0.001435166,0.00168451,0.002515859,0.001165553],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007789124,"about_ca_system_score_gemma":0.001586969,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005804315,"about_ca_topic_score_gemma":0.005477168,"domain_scores_codex":[0.9988199,0.0005802728,0.00003623534,0.00008705183,0.0003993271,0.00007723553],"domain_scores_gemma":[0.9979318,0.001323104,0.0001420769,0.0002164512,0.0003084008,0.00007822329],"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.0001497162,0.00005990652,0.0004067149,0.0002492171,0.00003146266,0.0001693048,0.000344926,0.2972095,0.009390889,0.6248607,0.003814724,0.06331301],"study_design_scores_gemma":[0.00001512498,0.00005119295,0.0001460144,0.00003686049,0.00000626454,0.00002829366,0.00002674412,0.8901048,0.002188351,0.101104,0.006277893,0.00001453469],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01177125,0.001170143,0.9720839,0.0004151655,0.0001346428,0.00006980787,0.00006423923,0.0002038886,0.01408707],"genre_scores_gemma":[0.2576455,0.003442364,0.7180573,0.0003974556,0.0004230282,0.0004257666,0.0002767648,0.0005155971,0.01881616],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005804315,"threshold_uncertainty_score":0.01319534,"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","authors":[{"name":"Steven Diaz","is_ca":true},{"name":"Adam Lutoborski","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001707146,0.001143848,0.0006178695,0.003453612,0.0008227387,0.002908018,0.0007567515,0.001059491,0.0081118],"category_scores_gemma":[0.009903832,0.0004327238,0.0006693425,0.001360054,0.003391732,0.004665406,0.002164086,0.002270228,0.002074433],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008678143,"about_ca_system_score_gemma":0.0009215947,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001133752,"about_ca_topic_score_gemma":0.000887429,"domain_scores_codex":[0.9985995,0.0003176255,0.00007895519,0.0002025198,0.0005833497,0.0002181736],"domain_scores_gemma":[0.9951137,0.0015675,0.0008234072,0.0007569836,0.001171456,0.000566988],"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.0000385566,0.00002615075,0.0005150615,0.00006385941,0.000009893845,0.0001122052,0.0001924142,0.00726078,0.002948453,0.9697771,0.002081847,0.0169736],"study_design_scores_gemma":[0.000007872599,0.00005160429,0.0006201483,0.00003838945,0.000007397908,0.0002154116,0.0001126078,0.05352182,0.001969902,0.9351946,0.00822247,0.00003791854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1514228,0.004112349,0.7792045,0.002038859,0.0008788813,0.0001009419,0.001030749,0.0008515255,0.06035934],"genre_scores_gemma":[0.7908545,0.00400864,0.1671257,0.0006084593,0.001502463,0.0001629007,0.001104182,0.0007747354,0.03385843],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0081118,"threshold_uncertainty_score":0.02713668,"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","authors":[{"name":"Jie Huang","is_ca":false},{"name":"Ronald D. Haynes","is_ca":true},{"name":"Ting‐Zhu Huang","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002146045,0.0008617974,0.0004086611,0.0008338817,0.0005934259,0.001246519,0.0009292884,0.0007923953,0.002923894],"category_scores_gemma":[0.01220921,0.0003791503,0.0004782572,0.0003708242,0.002404504,0.002276777,0.001649402,0.001822654,0.000614836],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007120625,"about_ca_system_score_gemma":0.0007545933,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007757583,"about_ca_topic_score_gemma":0.000717832,"domain_scores_codex":[0.9980867,0.0007242081,0.0000940171,0.0003110268,0.000581836,0.0002022416],"domain_scores_gemma":[0.9938736,0.002936093,0.0008973599,0.0006989176,0.001223609,0.0003703914],"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.0002895538,0.0001090273,0.001920472,0.0002498144,0.00004105705,0.000554183,0.0003821394,0.1223226,0.108467,0.7334053,0.003416499,0.02884232],"study_design_scores_gemma":[0.00001534726,0.0001348216,0.0007535772,0.00003381931,0.00000764075,0.0003086974,0.0001035128,0.7118042,0.03034049,0.2534009,0.00304892,0.00004806836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1436448,0.0003802338,0.8265852,0.000788437,0.0001193293,0.0000757859,0.0002331449,0.0003377823,0.02783543],"genre_scores_gemma":[0.8729674,0.0004999501,0.1186644,0.0004445257,0.00008638934,0.0001995979,0.0002272512,0.0001980629,0.006712513],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002923894,"threshold_uncertainty_score":0.01134956,"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","authors":[{"name":"Xiaofeng Ou","is_ca":false},{"name":"Michelle Michelle","is_ca":false},{"name":"Jianlin Xia","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007643969,0.0005922297,0.0006102319,0.0006128522,0.0004892302,0.001102396,0.001358188,0.001045924,0.01044395],"category_scores_gemma":[0.002452579,0.0003181706,0.0006034508,0.0008131833,0.000488769,0.001107292,0.001390423,0.001087771,0.004710558],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003315877,"about_ca_system_score_gemma":0.001035973,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001549375,"about_ca_topic_score_gemma":0.001920162,"domain_scores_codex":[0.9994722,0.0001513368,0.00001819271,0.00004584683,0.000278579,0.00003388557],"domain_scores_gemma":[0.9990503,0.000245402,0.00004386342,0.0002089416,0.0003813005,0.00007015051],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002575506,0.0001363929,0.0005919673,0.0002745135,0.0001016699,0.0002773966,0.0001900572,0.241039,0.02382474,0.4233564,0.02486372,0.2850866],"study_design_scores_gemma":[0.00002471984,0.00002637186,0.0001268976,0.00001406269,0.00000683501,0.00008236253,0.00001161558,0.9422915,0.001867944,0.04045349,0.0150699,0.00002422235],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002896071,0.0002109188,0.9909759,0.0001530565,0.0003180226,0.00003738682,0.0001459798,0.0002996626,0.004962966],"genre_scores_gemma":[0.1121883,0.0007482713,0.8587704,0.0003554632,0.0005495005,0.0002727184,0.000635966,0.001000492,0.02547889],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01044395,"threshold_uncertainty_score":0.03493851,"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)","authors":[{"name":"Tim Mitchell","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001420735,0.001159789,0.001225431,0.001528985,0.0006552347,0.001475836,0.001701451,0.0008452224,0.004053412],"category_scores_gemma":[0.006657421,0.0005160184,0.001011457,0.0008890489,0.001668949,0.002184156,0.002159847,0.002483479,0.00106834],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00110527,"about_ca_system_score_gemma":0.001942253,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002624012,"about_ca_topic_score_gemma":0.003232226,"domain_scores_codex":[0.9990003,0.000166048,0.00005291712,0.0001410087,0.0005020819,0.0001377272],"domain_scores_gemma":[0.9970247,0.001262191,0.0003988733,0.0005016669,0.0006711969,0.0001413265],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003203865,0.00007941571,0.002166213,0.0002567684,0.00006862849,0.0001535394,0.00026149,0.7493175,0.01734377,0.09095663,0.00168589,0.1373899],"study_design_scores_gemma":[0.00001625318,0.00005197066,0.0001932738,0.00001627525,0.000005046465,0.00002634383,0.00002331333,0.97539,0.007985148,0.01516821,0.001103084,0.00002113915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01466241,0.00009460164,0.982451,0.00004991484,0.00002408844,0.00003713185,0.00004232131,0.0009324354,0.001706116],"genre_scores_gemma":[0.4370279,0.0001930728,0.5593011,0.00006491012,0.00003493956,0.0001760769,0.0003086155,0.0006563378,0.002236996],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004053412,"threshold_uncertainty_score":0.01356,"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","authors":[{"name":"Paola Ferrari","is_ca":false},{"name":"Isabella Furci","is_ca":false},{"name":"Sean Hon","is_ca":true},{"name":"M. Mursaleen","is_ca":false},{"name":"Stefano Serra‐Capizzano","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009173231,0.0005638277,0.0004176857,0.000678807,0.0003695443,0.0007288536,0.0006259492,0.0007510948,0.003292768],"category_scores_gemma":[0.003187983,0.0002569572,0.0003467316,0.0004701813,0.001578048,0.001079722,0.0007772868,0.0007130376,0.0004910424],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005441798,"about_ca_system_score_gemma":0.0004979479,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001207586,"about_ca_topic_score_gemma":0.001041985,"domain_scores_codex":[0.9996413,0.0001230151,0.00001768948,0.00006334399,0.00008222447,0.00007247763],"domain_scores_gemma":[0.9976482,0.0009855798,0.0004809337,0.0002686786,0.0003729551,0.0002436691],"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.0002480187,0.00009603811,0.002353183,0.0001309792,0.00003433517,0.001034819,0.0004478953,0.2635186,0.02255195,0.6897684,0.002428011,0.01738773],"study_design_scores_gemma":[0.00001316249,0.00004140771,0.000726813,0.00001207033,0.000004249266,0.0001503815,0.00006763252,0.8812545,0.002686602,0.1142502,0.000769161,0.00002381901],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.328453,0.0004090187,0.6622965,0.0003762104,0.00007888589,0.00005329965,0.0001478878,0.0002440719,0.007941064],"genre_scores_gemma":[0.9492881,0.0003328492,0.044609,0.00007756867,0.00009526344,0.00009823981,0.0001942053,0.00008527217,0.005219525],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003292768,"threshold_uncertainty_score":0.01101542,"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","authors":[{"name":"Emre Mengi","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00140018,0.000709068,0.0005712574,0.0003890961,0.000320528,0.0009437779,0.0005852046,0.0008506747,0.001551659],"category_scores_gemma":[0.008055131,0.000286359,0.0003984901,0.0002715968,0.001105279,0.001184684,0.001775674,0.00112771,0.0002978883],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006159695,"about_ca_system_score_gemma":0.0006964742,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006554452,"about_ca_topic_score_gemma":0.0006523681,"domain_scores_codex":[0.9995043,0.0001879666,0.00002172632,0.0001233083,0.0001163753,0.00004626941],"domain_scores_gemma":[0.9970807,0.001843424,0.0003469866,0.0001574586,0.0003856593,0.0001856871],"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.0001185304,0.00003619009,0.0008890365,0.000132081,0.00003563808,0.0001244483,0.0001320082,0.8878974,0.01943589,0.06880616,0.001244221,0.02114844],"study_design_scores_gemma":[0.000003913207,0.00003709736,0.0002091527,0.000008719528,0.000003146126,0.00003081069,0.00002103655,0.9820347,0.003210753,0.0140765,0.0003552137,0.000009111149],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05478126,0.0001661785,0.9398754,0.0003794791,0.00002071246,0.00003010012,0.00004492906,0.00008496403,0.004617021],"genre_scores_gemma":[0.8699923,0.0002522349,0.1245013,0.00009273975,0.00005058085,0.0001329964,0.0001152803,0.0001115212,0.004750902],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001551659,"threshold_uncertainty_score":0.007404983,"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","authors":[{"name":"Yunhui He","is_ca":true},{"name":"Jun Liu","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001909815,0.0007904978,0.0008569955,0.0009478664,0.000462299,0.0008719428,0.0008837049,0.001357213,0.001242434],"category_scores_gemma":[0.003893173,0.000347892,0.0011222,0.0003785625,0.001275501,0.001033534,0.001199399,0.001146155,0.0001891962],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00066779,"about_ca_system_score_gemma":0.0009113555,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001980183,"about_ca_topic_score_gemma":0.001050645,"domain_scores_codex":[0.9994318,0.0001921218,0.00003207973,0.00008632795,0.0002102437,0.00004738206],"domain_scores_gemma":[0.9987485,0.0006128675,0.0001827207,0.0001642588,0.0002218108,0.0000697518],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001252165,0.00005481594,0.0008118073,0.0001879437,0.00006302889,0.00006611282,0.0001799886,0.8946568,0.009432522,0.05779357,0.0004279711,0.0362002],"study_design_scores_gemma":[0.000005190863,0.00002163363,0.00008354874,0.000005864129,0.000004322495,0.000007591888,0.000006788575,0.9965224,0.0008393176,0.00205952,0.0004380264,0.000005762994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02804192,0.0004445832,0.9685365,0.0002021647,0.00006771805,0.00004096862,0.00001948486,0.0001270545,0.002519569],"genre_scores_gemma":[0.6635395,0.0004390195,0.3319222,0.0001357983,0.00007168335,0.000171489,0.0001131653,0.0001893322,0.00341779],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001980183,"threshold_uncertainty_score":0.01010025,"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","authors":[{"name":"Peter Benner","is_ca":false},{"name":"Heike Faßbender","is_ca":false},{"name":"Philip Saltenberger","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005124764,0.0007402745,0.000790146,0.0006319688,0.0004078028,0.0006943084,0.001059432,0.0005872381,0.008852621],"category_scores_gemma":[0.001597643,0.0003568881,0.0006599989,0.0004905026,0.0006244197,0.0008751162,0.001401296,0.00132759,0.004229464],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003373495,"about_ca_system_score_gemma":0.001043615,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00153895,"about_ca_topic_score_gemma":0.002465744,"domain_scores_codex":[0.9996234,0.00008960274,0.00001928632,0.00006569608,0.0001356911,0.00006618268],"domain_scores_gemma":[0.9995906,0.0001605267,0.00003574456,0.0000898805,0.00009081198,0.00003253313],"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.0003153786,0.000188212,0.0009574553,0.0004589465,0.00007708855,0.0002762598,0.0003203558,0.2929879,0.02129932,0.1290113,0.01089473,0.543213],"study_design_scores_gemma":[0.00003873093,0.00004436654,0.00008302376,0.0000126196,0.000006883828,0.00006628677,0.0000374407,0.9681752,0.002895527,0.02301675,0.005607703,0.0000153891],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003618625,0.00007399566,0.9935485,0.00004373541,0.00002316384,0.00002775224,0.00003004019,0.0008607997,0.001773374],"genre_scores_gemma":[0.06683179,0.0001269517,0.9294865,0.00006815095,0.00003128557,0.0001150795,0.0002293718,0.0005674057,0.002543467],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008852621,"threshold_uncertainty_score":0.02961498,"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","authors":[{"name":"James Jackaman","is_ca":false},{"name":"Scott MacLachlan","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001133152,0.0006841753,0.0005561538,0.0002803548,0.0003688464,0.0007048488,0.001309819,0.0007923643,0.004522806],"category_scores_gemma":[0.003935135,0.0002828343,0.0005504639,0.0005298768,0.0009439195,0.0009467017,0.00226215,0.001648291,0.001419565],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004087593,"about_ca_system_score_gemma":0.001272268,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001075451,"about_ca_topic_score_gemma":0.002038747,"domain_scores_codex":[0.9992352,0.0002426232,0.0000438461,0.00006248385,0.000366613,0.00004929731],"domain_scores_gemma":[0.9991079,0.0003723836,0.0001246882,0.0002150744,0.0001332427,0.0000466251],"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.0001612214,0.0001080998,0.001395402,0.000484513,0.00008184817,0.0002110986,0.0003490488,0.402274,0.0237609,0.4159316,0.007257112,0.1479852],"study_design_scores_gemma":[0.00003873615,0.00004242361,0.00008296925,0.00002937631,0.000006485763,0.00006074984,0.00002828287,0.9271758,0.004577592,0.05786809,0.01007885,0.00001065277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006389264,0.0001093582,0.9892117,0.000127072,0.00003924745,0.00006836356,0.00007066326,0.0002580317,0.003726337],"genre_scores_gemma":[0.1800503,0.0002439365,0.8118042,0.0002212418,0.00005288085,0.00031825,0.0003949422,0.0003679838,0.006546262],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004522806,"threshold_uncertainty_score":0.01513028,"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","authors":[{"name":"Hengchao Chen","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001345357,0.00132697,0.001124742,0.002239339,0.001185549,0.003575603,0.00212028,0.001270204,0.009554904],"category_scores_gemma":[0.00729315,0.0006227784,0.0007106693,0.0009552517,0.003529248,0.005499674,0.003220706,0.002365469,0.001535213],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001378931,"about_ca_system_score_gemma":0.000891929,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001506356,"about_ca_topic_score_gemma":0.0006899431,"domain_scores_codex":[0.998268,0.0005336659,0.00006634517,0.0003769395,0.0004538723,0.0003010896],"domain_scores_gemma":[0.9948587,0.001788635,0.0008607997,0.0005375788,0.0008743717,0.001079868],"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.00003597956,0.00000840875,0.0001111952,0.00001632786,0.00000449271,0.00005982156,0.00006169367,0.0009359992,0.0004203864,0.9961352,0.0007828315,0.001427622],"study_design_scores_gemma":[0.00001441175,0.00002169704,0.0002133276,0.000007494649,0.000005378928,0.0001385865,0.00003980297,0.01280835,0.0004376354,0.9849265,0.001371947,0.00001484464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.4793037,0.001892136,0.4057004,0.003294268,0.0003585892,0.0001338648,0.001363187,0.0005934112,0.1073604],"genre_scores_gemma":[0.95422,0.0008855851,0.01993576,0.0005491294,0.0004724449,0.00008966587,0.0007341212,0.0002459866,0.02286739],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.009554904,"threshold_uncertainty_score":0.0319643,"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","authors":[{"name":"Christopher C. Paige","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003223126,0.0007987037,0.0005537687,0.001244719,0.0006806351,0.001891969,0.0009140161,0.0007830514,0.004559484],"category_scores_gemma":[0.01348704,0.0004248457,0.0005757054,0.001486727,0.001418221,0.002399326,0.002027485,0.00150431,0.00142441],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007724907,"about_ca_system_score_gemma":0.001365614,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001536021,"about_ca_topic_score_gemma":0.0008684311,"domain_scores_codex":[0.9972494,0.0007725434,0.0001410312,0.0003190321,0.001307684,0.0002103359],"domain_scores_gemma":[0.9954792,0.001993154,0.00044457,0.0006992623,0.001308128,0.00007569074],"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.0001290812,0.00007704926,0.002697635,0.0002651006,0.00006440501,0.0000587158,0.0002659822,0.1797577,0.004602143,0.4625292,0.004375303,0.3451779],"study_design_scores_gemma":[0.0000267793,0.0001075658,0.000448196,0.00006358522,0.00001695434,0.00008102204,0.00006987307,0.7979636,0.006667431,0.1810844,0.01344717,0.00002340727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01115461,0.0005890045,0.9824893,0.0001649597,0.00006337295,0.00008878615,0.00004326229,0.0002161937,0.005190497],"genre_scores_gemma":[0.3061643,0.002152603,0.6757243,0.0003356982,0.000241705,0.0005817448,0.0007356491,0.0005613526,0.01350263],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004559484,"threshold_uncertainty_score":0.01704568,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}