{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":1077,"total_is_capped":false,"direct_labels_cover":1,"predictions_cover":1077,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"0c47454b68fe","filters":{"topic":"Matrix Theory and Algorithms"}},"results":[{"id":"W4229650096","doi":"10.1007/978-1-4419-9467-7","title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces","year":2011,"lang":"en","type":"book","venue":"CMS books in mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2897,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Hilbert space; Constructive; Mathematics; Monotone polygon; Convex analysis; Regular polygon; Exposition (narrative); Pure mathematics; Subderivative; Operator (biology); Point (geometry); Convex optimization; Algebra over a field; Computer science; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01510729710586562,"gpt":0.2345508160276396,"spread":0.2194435189217739,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001499658,0.0004118103,0.0009925087,0.000803129,0.00005428849,0.0001864843,0.00109463,0.0003315335,0.000117099],"category_scores_gemma":[0.0000673572,0.0003631424,0.0001482605,0.000334575,0.0002062098,0.000213866,0.000495904,0.0004845905,0.00005618649],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009067189,"about_ca_system_score_gemma":0.0001686825,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009634542,"about_ca_topic_score_gemma":0.00003590025,"domain_scores_codex":[0.9980115,0.0001488853,0.0006607305,0.0005779977,0.000262001,0.0003389435],"domain_scores_gemma":[0.9980718,0.0004556441,0.0002899921,0.001025866,0.00004711403,0.0001095163],"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.000004965517,0.00007891094,0.00005524245,0.0002269649,0.0001684662,0.00007869903,0.005221857,0.000008722718,0.000004979681,0.9914315,0.0002819315,0.002437725],"study_design_scores_gemma":[0.0003122315,0.00003817323,0.00003079683,0.0003357996,0.0001518503,0.00001896056,0.00009593497,0.01520181,0.0001789818,0.9785282,0.004568752,0.0005385209],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.001472175,0.002202261,0.2595741,0.00009527133,0.0003054634,0.0009497157,0.00002149253,0.0001689228,0.7352106],"genre_scores_gemma":[0.003308964,0.0003230655,0.08722856,0.0002844614,0.0001078435,0.00009196576,0.00001421487,0.00008092736,0.90856],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.1733494,"threshold_uncertainty_score":0.999882,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1575990399","doi":"10.1002/9780470141731.ch4","title":"Discrete‐Variable Representations and their Utilization","year":2000,"lang":"en","type":"other","venue":"Advances in chemical physics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":623,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Variable (mathematics); Discrete variable; Mathematics; Computer science; Environmental science; Applied mathematics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01205778862336569,"gpt":0.2828537447927245,"spread":0.2707959561693588,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003299722,0.0001523946,0.0001798294,0.00003300719,0.0000223053,0.00003700945,0.0003457329,0.00008617804,0.0000758388],"category_scores_gemma":[0.00001056188,0.000130344,0.00002592813,0.0002922706,0.00008181185,0.0003129894,0.0001072242,0.0001431578,0.000009310407],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008846485,"about_ca_system_score_gemma":0.00001535547,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007139156,"about_ca_topic_score_gemma":0.000001497753,"domain_scores_codex":[0.9992604,0.00002688955,0.0001232259,0.000358198,0.00008276707,0.0001484655],"domain_scores_gemma":[0.9994355,0.00008991357,0.00007226941,0.0003585855,0.000005687165,0.00003798107],"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.000008973588,0.0001544535,0.00003644054,0.0001958197,0.00002410728,0.000004630739,0.0003674908,0.0003565715,0.0007985937,0.5074077,0.01496441,0.4756808],"study_design_scores_gemma":[0.0001991735,0.000007814313,0.000001092912,0.0001484863,0.000003812276,0.000002251076,0.00001080935,0.00889349,0.003749937,0.5168353,0.4698823,0.0002655671],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.000005953312,0.003062045,0.3889095,0.00003042146,0.0001370786,0.0001223581,0.00002730961,0.0001396742,0.6075657],"genre_scores_gemma":[0.02710117,0.0357217,0.5278484,0.001296401,0.005220571,0.0003687438,0.0009685632,0.001093061,0.4003814],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.4754152,"threshold_uncertainty_score":0.5315274,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2168496234","doi":"10.1088/0305-4470/36/47/008","title":"Asymptotic iteration method for eigenvalue problems","year":2003,"lang":"en","type":"article","venue":"Journal of Physics A Mathematical and General","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":559,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Prince Edward Island; Concordia University","funders":"","keywords":"Eigenvalues and eigenvectors; Mathematics; Homogeneous; Applied mathematics; Order (exchange); Type (biology); Differential equation; Homogeneous differential equation; Mathematical analysis; Ordinary differential equation; Physics; Combinatorics; Differential algebraic equation; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.0201832993813354,"gpt":0.2807246459431958,"spread":0.2605413465618604,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008378318,0.00008602031,0.0002008264,0.00002810331,0.00007048021,0.000116343,0.0001541929,0.00002824859,0.000007581676],"category_scores_gemma":[0.00006637443,0.00005954751,0.0001031865,0.00008942438,0.00001646966,0.0002820528,0.00002202912,0.00007777684,0.000002688878],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008092281,"about_ca_system_score_gemma":0.00003339702,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.117182e-7,"about_ca_topic_score_gemma":2.726358e-8,"domain_scores_codex":[0.9992371,0.00008858409,0.0002913365,0.0001002578,0.0001528934,0.0001297978],"domain_scores_gemma":[0.9993777,0.0001613966,0.0001628378,0.0001067955,0.0001087614,0.00008250154],"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.000002369073,0.00008165462,0.000002136349,0.00006211056,0.00002000463,0.000001389046,0.0003172812,0.000402452,0.002161078,0.9816058,0.00007167832,0.01527203],"study_design_scores_gemma":[0.0002927599,0.0001421156,0.00000345052,0.00002417006,0.00001542178,0.0001020399,0.000005884916,0.1875257,0.007256529,0.8039441,0.0006196931,0.00006817286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008900077,0.00008241833,0.9902342,0.0002098003,0.000120147,0.0001028307,8.831826e-7,0.000006807079,0.000342825],"genre_scores_gemma":[0.03138895,0.000006008819,0.9678878,0.000128218,0.000264852,0.000005449392,2.588928e-7,0.00000615205,0.0003123582],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1871233,"threshold_uncertainty_score":0.2428277,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2138844572","doi":"10.1109/tac.2005.852558","title":"Gradient based iterative algorithms for solving a class of matrix equations","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":497,"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":"Iterative method; Sylvester matrix; Matrix (chemical analysis); Mathematics; Algorithm; Convergence (economics); Rate of convergence; Matrix-free methods; Matrix splitting; Convergent matrix; Mathematical optimization; Applied mathematics; Local convergence; Computer science; Sparse matrix; State-transition matrix; Symmetric matrix; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01600660647456744,"gpt":0.2689512016773292,"spread":0.2529445952027617,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004985145,0.0001996098,0.0003292884,0.0002782435,0.00026568,0.00009038937,0.0004316737,0.00007005017,0.0001146914],"category_scores_gemma":[0.000028324,0.0001834939,0.0002537943,0.0003367196,0.00005490965,0.0003617307,0.00000137915,0.0001086859,0.00003427598],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008722179,"about_ca_system_score_gemma":0.0001233877,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005255331,"about_ca_topic_score_gemma":0.00001254588,"domain_scores_codex":[0.9984812,0.0001053146,0.0005184205,0.0003145563,0.0002765841,0.0003038946],"domain_scores_gemma":[0.997688,0.001392524,0.0001925991,0.0004742065,0.00015089,0.0001017785],"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.00007280122,0.001300607,0.000001060528,0.0001692738,0.0002705819,0.000004170677,0.002397968,0.2919021,0.005367031,0.04484842,0.0001561519,0.6535099],"study_design_scores_gemma":[0.002385236,0.0002594252,0.000006291434,0.0000626293,0.00006260855,0.000003967612,0.0000295335,0.981966,0.01339529,0.001342477,0.0003039755,0.0001825803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001054756,0.00003021209,0.9951734,0.001992032,0.0004144044,0.0008734322,0.00009674218,0.000267713,0.00009733752],"genre_scores_gemma":[0.8454934,0.000001027653,0.1535838,0.0002863035,0.00004919372,0.0003108063,0.000001446285,0.00001307,0.000260949],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8444387,"threshold_uncertainty_score":0.7482666,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2049871086","doi":"10.1016/j.sysconle.2004.06.008","title":"Iterative least-squares solutions of coupled Sylvester matrix equations","year":2004,"lang":"en","type":"article","venue":"Systems & Control Letters","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":417,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Sylvester matrix; Sylvester equation; Iterative method; Mathematics; Sylvester's law of inertia; Matrix-free methods; Least-squares function approximation; Applied mathematics; Matrix (chemical analysis); Block (permutation group theory); Gauss–Seidel method; Augmented matrix; Mathematical optimization; Algorithm; State-transition matrix; Sparse matrix; Symmetric matrix; Mathematical analysis; Eigenvalues and eigenvectors; Polynomial matrix; Polynomial","retraction":null,"screen_n_in":null,"score":{"opus":0.01244607554982687,"gpt":0.2367437615219746,"spread":0.2242976859721477,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005280923,0.0001865297,0.0003539595,0.0001747995,0.0001765492,0.0001809707,0.0005684202,0.0000587385,0.00001638128],"category_scores_gemma":[0.00004098859,0.0001655148,0.0001473438,0.0003020697,0.00008454864,0.0005675262,0.00006477701,0.0001339874,0.0001313653],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008272709,"about_ca_system_score_gemma":0.00007665479,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001870769,"about_ca_topic_score_gemma":0.000007882477,"domain_scores_codex":[0.9982592,0.0002247821,0.0004814274,0.0003321338,0.000333749,0.0003686896],"domain_scores_gemma":[0.9987153,0.0002605799,0.0002499958,0.0005517734,0.0001264994,0.00009583488],"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.00002164169,0.00008398901,0.00009536785,0.00008567923,0.0001389449,0.0000214734,0.001450791,0.06177771,0.06765155,0.8683269,0.000152175,0.0001937868],"study_design_scores_gemma":[0.01738415,0.0007334577,0.001341359,0.0010664,0.0002089446,0.0001775499,0.0009109036,0.9543133,0.001803059,0.01723962,0.002996673,0.001824553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02538016,0.0004101339,0.967697,0.004682868,0.0008142081,0.0006406924,0.000028294,0.0001382335,0.0002084005],"genre_scores_gemma":[0.9970529,0.00000106941,0.001949904,0.0005681972,0.0001590384,0.00008392209,0.000004543164,0.00001129389,0.0001691263],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9716728,"threshold_uncertainty_score":0.6749499,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2056167539","doi":"10.2514/1.34810","title":"Parallel Newton-Krylov Solver for the Euler equations Discretized Using Simultaneous Approximation Terms","year":2008,"lang":"en","type":"article","venue":"AIAA Journal","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":147,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Discretization; Solver; Backward Euler method; Euler's formula; Applied mathematics; Euler equations; Mathematics; Semi-implicit Euler method; Euler method; Newton's method; Mathematical analysis; Computer science; Physics; Mathematical optimization; Nonlinear system","retraction":null,"screen_n_in":null,"score":{"opus":0.04111804146867975,"gpt":0.2770636855551502,"spread":0.2359456440864704,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004802076,0.000121591,0.0001285246,0.00006174025,0.001188674,0.0002309466,0.0006320024,0.00004723961,0.00004894612],"category_scores_gemma":[0.000241324,0.00007696622,0.0001407416,0.0001718074,0.00007446037,0.0005532208,0.00007831413,0.0002092893,0.00001889607],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003775588,"about_ca_system_score_gemma":0.00008536889,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004524491,"about_ca_topic_score_gemma":8.126717e-7,"domain_scores_codex":[0.9989204,0.00008530873,0.000286337,0.0001669017,0.0002645841,0.0002764284],"domain_scores_gemma":[0.9983015,0.001018435,0.0001935005,0.0002846428,0.0001122594,0.00008962917],"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.0002651577,0.0005108594,0.000331059,0.00004186787,0.000379543,0.0002732426,0.01205352,0.4523177,0.005303008,0.3790619,0.005408677,0.1440534],"study_design_scores_gemma":[0.0006881419,0.00004728449,0.00006147418,0.00001290835,0.0000184697,0.0006337938,0.00003530257,0.9680206,0.0001187607,0.02740548,0.002827044,0.0001307104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00549172,0.0001045296,0.9912768,0.002106638,0.0005986582,0.0002205627,0.000002759714,0.00003994588,0.0001584002],"genre_scores_gemma":[0.7417521,0.00006452081,0.2558198,0.0003779108,0.0008563761,0.0000167943,0.00000320847,0.00001775506,0.001091443],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7362604,"threshold_uncertainty_score":0.9142443,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1584631835","doi":"10.37236/1832","title":"Pólya's Permanent Problem","year":2004,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":137,"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":"Invertible matrix; Mathematics; Sign (mathematics); Square (algebra); Combinatorics; Square matrix; Matrix (chemical analysis); Zero (linguistics); Polynomial; Discrete mathematics; Pure mathematics; Symmetric matrix; Mathematical analysis; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.00503819198431989,"gpt":0.214211948657631,"spread":0.2091737566733111,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001364748,0.0001145638,0.0001685342,0.00007753466,0.0001580608,0.00008485527,0.00156335,0.0000373643,0.000005360067],"category_scores_gemma":[0.00002227129,0.00007173193,0.000120615,0.0004230776,0.00004019852,0.0003253554,0.0001117518,0.000604378,0.00002580996],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002752974,"about_ca_system_score_gemma":0.0005389503,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002955081,"about_ca_topic_score_gemma":7.086937e-7,"domain_scores_codex":[0.9986268,0.00009797694,0.0003124817,0.00009977634,0.0004074489,0.0004555421],"domain_scores_gemma":[0.999087,0.00007034626,0.0002877733,0.0003253043,0.0001541932,0.00007534793],"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.000007749599,0.00009546911,0.000004217856,0.000004266468,0.00002794195,0.00001685846,0.0002998177,0.000415031,0.00009903941,0.9975734,0.0001101778,0.001346033],"study_design_scores_gemma":[0.0007297694,0.0005034969,0.00002658248,0.00001749619,0.00001417612,0.0007023697,0.000026509,0.000136563,0.001840071,0.9875685,0.008341116,0.00009336321],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0632178,0.005827976,0.9142156,0.009803955,0.001199718,0.0002002981,3.205295e-7,0.00006139703,0.005472922],"genre_scores_gemma":[0.9986728,0.0003350894,0.0003979048,0.0001472031,0.0001093415,0.000001359007,1.022513e-7,0.000007081557,0.0003291244],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.935455,"threshold_uncertainty_score":0.2925143,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1977424948","doi":"10.1093/imanum/drm051","title":"Linearization of matrix polynomials expressed in polynomial bases","year":2008,"lang":"en","type":"article","venue":"IMA Journal of Numerical Analysis","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":116,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Polynomial matrix; Monomial; Difference polynomials; Polynomial; Matrix polynomial; Degree (music); Linearization; Matrix (chemical analysis); Pure mathematics; Discrete orthogonal polynomials; Class (philosophy); Algebra over a field; Classical orthogonal polynomials; Symmetric polynomial; Orthogonal polynomials; Mathematical analysis; Nonlinear system","retraction":null,"screen_n_in":null,"score":{"opus":0.0138328876120868,"gpt":0.264506298291564,"spread":0.2506734106794772,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004770689,0.000109273,0.0005760023,0.0007140008,0.00004996586,0.00002938188,0.0006055215,0.00004946774,0.000107203],"category_scores_gemma":[0.000187787,0.00008769731,0.0004014492,0.002182866,0.0000594554,0.0004426287,0.00007750406,0.0001462604,0.000005176964],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002990481,"about_ca_system_score_gemma":0.00009565219,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009346112,"about_ca_topic_score_gemma":0.000001081103,"domain_scores_codex":[0.9982693,0.000221655,0.000822471,0.0001544611,0.0003637123,0.0001683824],"domain_scores_gemma":[0.9986237,0.0002466927,0.0006175244,0.0002358554,0.0001668198,0.0001093606],"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.001979647,0.007089584,0.2397375,0.0001728614,0.006938466,0.002700045,0.008808701,0.406937,0.1775448,0.007580369,0.008272523,0.1322386],"study_design_scores_gemma":[0.004263925,0.001001301,0.05991078,0.00009834561,0.001099161,0.0004851417,0.0002332107,0.8353092,0.09058386,0.002124872,0.003980664,0.000909505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.250484,0.0002464642,0.7484784,0.0005636992,0.00009671059,0.00002974693,0.00000496942,0.000009047497,0.00008704004],"genre_scores_gemma":[0.9619733,0.00007447945,0.03765883,0.00007532969,0.0001356856,5.937851e-7,0.000001148505,0.000004392114,0.00007622397],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7114893,"threshold_uncertainty_score":0.3576193,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1558501364","doi":"10.21314/jcf.2004.116","title":"Analysis of the stability of the linear boundary condition for the Black–Scholes equation","year":2004,"lang":"en","type":"article","venue":"The Journal of Computational Finance","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":116,"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":"Social Sciences and Humanities Research Council of Canada; Natural Sciences and Engineering Research Council of Canada","keywords":"Boundary value problem; Mathematics; Discretization; Stability (learning theory); Applied mathematics; Derivative (finance); Boundary (topology); Black–Scholes model; Mixed boundary condition; Finite difference method; Mathematical analysis; Computer science; Finance; Economics; Econometrics","retraction":null,"screen_n_in":null,"score":{"opus":0.02105074449814089,"gpt":0.2745563713496884,"spread":0.2535056268515475,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001992155,0.00007389529,0.0001743713,0.00004966827,0.0003108721,0.00002689777,0.001112855,0.0000242245,0.000005356885],"category_scores_gemma":[0.0002037994,0.00003183223,0.0002877663,0.0007843233,0.0003531725,0.0002305445,0.00009515488,0.0001598014,6.08848e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003855009,"about_ca_system_score_gemma":0.0002778754,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007394421,"about_ca_topic_score_gemma":0.000004712847,"domain_scores_codex":[0.9986336,0.0002441264,0.0004810601,0.00007661262,0.0004793859,0.00008520665],"domain_scores_gemma":[0.9968343,0.00132522,0.0009476711,0.0003307645,0.00055045,0.00001163191],"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.00003649728,0.00004999932,0.0001467189,0.000009885775,0.0001137531,9.004914e-8,0.0009949548,0.9198368,0.0001356123,0.07724462,0.00002497027,0.001406106],"study_design_scores_gemma":[0.0005445634,0.0001016569,0.1002467,0.00006495598,0.0002957839,0.00001153821,0.000102556,0.5435656,0.005623672,0.349078,0.0002991138,0.00006589276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4117477,0.0001519846,0.5848562,0.002913733,0.0001647162,0.0001297491,0.00002044992,0.000002061886,0.00001341379],"genre_scores_gemma":[0.9940797,0.0000162312,0.005680191,0.0001333446,0.00007116468,0.000001687412,0.000001321044,0.000002675451,0.0000137027],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.582332,"threshold_uncertainty_score":0.2391008,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2096220424","doi":"10.1007/s11228-004-7197-7","title":"Nonsmooth Analysis of Singular Values. Part I: Theory","year":2005,"lang":"en","type":"article","venue":"Set-Valued Analysis","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":109,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University; University of Waterloo","funders":"","keywords":"Subderivative; Mathematics; Simple (philosophy); Limiting; TRACE (psycholinguistics); Singular value; Mathematical analysis; Singular solution; Work (physics); Applied mathematics; Matrix (chemical analysis); Pure mathematics; Calculus (dental); Eigenvalues and eigenvectors; Regular polygon; Geometry; Philosophy; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01194793296660928,"gpt":0.2594108906264844,"spread":0.2474629576598751,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002499003,0.0002809208,0.0009525121,0.001871815,0.0002001071,0.0001248567,0.001358879,0.0001123209,0.0009541748],"category_scores_gemma":[0.000123186,0.0002452323,0.001350749,0.01083778,0.0001578463,0.0004275902,0.0002510131,0.0001679065,0.00007826833],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005809985,"about_ca_system_score_gemma":0.00006742855,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004808078,"about_ca_topic_score_gemma":0.00003265322,"domain_scores_codex":[0.9968219,0.0006324454,0.0007016324,0.0007201604,0.0006746548,0.0004492144],"domain_scores_gemma":[0.9972589,0.0002813606,0.0003754828,0.001708233,0.0001924895,0.0001835397],"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.00005930585,0.0006803185,0.004473675,0.00004073429,0.05812826,0.00007060115,0.004701909,0.2483548,0.0004200498,0.5458328,0.0007991766,0.1364384],"study_design_scores_gemma":[0.0002898062,0.00004670507,0.00183511,0.000009684766,0.01612743,0.000002379525,0.0001284673,0.9621564,0.002110392,0.01371099,0.003151777,0.0004308867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05617754,0.0007443528,0.9383847,0.0003382607,0.0001303906,0.0001130476,0.00004538376,0.0002076525,0.003858727],"genre_scores_gemma":[0.9446645,0.00003793106,0.05211852,0.0004012717,0.0001668517,0.000009525668,0.00006030535,0.00001612223,0.002525006],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8884869,"threshold_uncertainty_score":1,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2075924802","doi":"10.1016/s0024-3795(02)00345-2","title":"Upper and lower bounds for ranks of matrix expressions using generalized inverses","year":2002,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":108,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Schur complement; Inverse; Matrix (chemical analysis); Complement (music); Combinatorics; Generalized inverse; Moore–Penrose pseudoinverse; Rank (graph theory); Upper and lower bounds; Expression (computer science); Pure mathematics; Mathematical analysis; Geometry; Eigenvalues and eigenvectors","retraction":null,"screen_n_in":null,"score":{"opus":0.02723798894730929,"gpt":0.2822941735064546,"spread":0.2550561845591453,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009092621,0.00008641165,0.0001275413,0.00005785376,0.0002266428,0.000046364,0.0001826072,0.00005164442,0.00005156912],"category_scores_gemma":[0.00001653136,0.00007474665,0.00004068676,0.0001647637,0.00005417553,0.0001909848,0.0001277864,0.00004682569,0.000005100267],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003490683,"about_ca_system_score_gemma":0.000009498359,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002865581,"about_ca_topic_score_gemma":2.485413e-7,"domain_scores_codex":[0.9993935,0.00002037886,0.0001696081,0.0002202018,0.00007002775,0.0001262944],"domain_scores_gemma":[0.9994627,0.0001016072,0.000066439,0.0002361375,0.00005794355,0.00007515058],"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.000009256351,0.0001457042,0.00004428039,0.00008653832,0.00002881222,4.333791e-7,0.0006418558,0.00005982526,0.02839127,0.9564577,0.0006055411,0.01352883],"study_design_scores_gemma":[0.001120517,0.00007139938,0.00004645615,0.00003332231,0.00004836682,0.00002109244,0.00005109892,0.8587249,0.01360488,0.04464542,0.08133519,0.0002973814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1687235,0.00284958,0.8264238,0.0005970213,0.00009675032,0.0006738748,0.00005605055,0.00008054292,0.0004988597],"genre_scores_gemma":[0.7064714,0.0006492627,0.2898962,0.0003292602,0.0002724247,0.0002131104,0.000009669924,0.00002148705,0.002137115],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9118122,"threshold_uncertainty_score":0.304808,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2068874164","doi":"10.1007/s10543-006-0091-y","title":"An Arnoldi-type algorithm for computing page rank","year":2006,"lang":"en","type":"article","venue":"BIT Numerical Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":108,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"PageRank; Computation; Convergence (economics); Algorithm; Rank (graph theory); Matrix (chemical analysis); Computer science; Arnoldi iteration; Type (biology); Mathematics; Generalized minimal residual method; Mathematical optimization; Iterative method; Theoretical computer science; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.01507716441216068,"gpt":0.2655212796423967,"spread":0.2504441152302361,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004783767,0.0002067942,0.0003188028,0.00006830085,0.0002053836,0.0002070361,0.0008429874,0.000083142,0.00002346157],"category_scores_gemma":[0.00005375494,0.000177471,0.0001126368,0.0004418699,0.00004517272,0.0002496857,0.0001183598,0.0001171095,0.0000850614],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002385313,"about_ca_system_score_gemma":0.00003143238,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008338767,"about_ca_topic_score_gemma":2.089412e-7,"domain_scores_codex":[0.9984846,0.0000594946,0.0004136703,0.0003661958,0.0002619326,0.0004140677],"domain_scores_gemma":[0.9986145,0.0003977142,0.0001650603,0.0005989192,0.0001060211,0.0001177141],"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.000005959771,0.001087413,0.00002064775,0.0001502812,0.0000297298,0.00002351458,0.0005626075,0.0005243282,0.001519858,0.6416856,0.00169709,0.3526929],"study_design_scores_gemma":[0.0003106579,0.0001640079,0.00002694056,0.000020065,0.00001075216,0.00002823542,0.00002794748,0.8524691,0.0009596049,0.141644,0.004093096,0.0002456155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001942985,0.00006957263,0.9958491,0.0001470983,0.0003364607,0.0002906387,0.000006978064,0.0003821373,0.0009749964],"genre_scores_gemma":[0.05800691,0.000002108284,0.9411253,0.0001618886,0.0003683897,0.00001008976,0.00001000406,0.00002484873,0.0002904621],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8519447,"threshold_uncertainty_score":0.7237055,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2057980100","doi":"10.1177/109434200101500106","title":"Parallel Implementation and Practical Use of Sparse Approximate Inverse Preconditioners with a Priori Sparsity Patterns","year":2001,"lang":"en","type":"article","venue":"The International Journal of High Performance Computing Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":107,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Lawrence Livermore National Laboratory; University of Waterloo; Microsoft; U.S. Department of Energy","keywords":"Inverse; Sparse matrix; Computation; Computer science; Minification; Matrix (chemical analysis); Norm (philosophy); Algorithm; Numbering; A priori and a posteriori; Mathematical optimization; Code (set theory); Parallel computing; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03075754452208893,"gpt":0.2976504321479393,"spread":0.2668928876258504,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004876882,0.00009322752,0.0001287404,0.0001141798,0.0001484014,0.0001237667,0.0004746529,0.00002165847,0.00001297323],"category_scores_gemma":[0.00001116777,0.00006561981,0.00003301504,0.0001572961,0.00008535865,0.000809568,0.0001625036,0.0001703508,0.000002662454],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003991795,"about_ca_system_score_gemma":0.00008044783,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003859011,"about_ca_topic_score_gemma":0.000009410358,"domain_scores_codex":[0.9989467,0.00005257258,0.0003807762,0.0001334703,0.0003652035,0.0001212633],"domain_scores_gemma":[0.9985538,0.0001958955,0.0006321345,0.000199756,0.0003646961,0.00005371061],"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.0009214086,0.001273941,0.1854016,0.0001599672,0.001244204,0.0001159787,0.007074826,0.08934039,0.001244647,0.3995731,0.00181526,0.3118347],"study_design_scores_gemma":[0.005543462,0.001021146,0.265097,0.0004404903,0.0002310744,0.009079608,0.001465816,0.6795664,0.006895291,0.01578177,0.01408714,0.0007908121],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.526292,0.000005451791,0.4721849,0.001317783,0.0000605428,0.0001100371,0.00000437812,0.00001077625,0.00001417826],"genre_scores_gemma":[0.9033016,0.0001229956,0.09625329,0.0001673754,0.0001229659,0.00000660424,0.000006087572,0.000004646716,0.00001443862],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5902261,"threshold_uncertainty_score":0.2675898,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2162471115","doi":"10.4153/cjm-2001-020-6","title":"Hyperbolic Polynomials and Convex Analysis","year":2001,"lang":"en","type":"article","venue":"Canadian Journal of Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":105,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Okanagan University College","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo; National Science Foundation","keywords":"Mathematics; Univariate; Regular polygon; Polynomial; Convex function; Homogeneous polynomial; Pure mathematics; Function (biology); Homogeneous; Mathematical analysis; Combinatorics; Matrix polynomial; Multivariate statistics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01446111446918862,"gpt":0.2233632997121663,"spread":0.2089021852429777,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005845217,0.00007808649,0.0002730183,0.0004122286,0.00008522983,0.0001451617,0.0004375862,0.00003722801,0.0000805771],"category_scores_gemma":[0.00008070822,0.00006487569,0.00009460643,0.0004848643,0.00005207547,0.0002019232,0.00001762258,0.00009332988,0.00001141876],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002682339,"about_ca_system_score_gemma":0.0002489489,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001760464,"about_ca_topic_score_gemma":0.0009128675,"domain_scores_codex":[0.9992927,0.00003606786,0.0003016553,0.00007527239,0.000109936,0.0001843518],"domain_scores_gemma":[0.9989317,0.0001064742,0.0001939283,0.0002140489,0.00008607279,0.0004677913],"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.000007693391,0.0001613226,0.01840857,0.0001386058,0.002189745,0.002825617,0.01617655,0.0005879025,0.0003905026,0.8630095,0.005219653,0.09088439],"study_design_scores_gemma":[0.003677227,0.0007986504,0.01784048,0.0004464106,0.002699184,0.02665979,0.004252754,0.2209717,0.003014324,0.5712308,0.1460453,0.002363323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5801415,0.001226184,0.4125232,0.001861594,0.0002980946,0.0000703382,0.000004796717,0.00001354638,0.003860648],"genre_scores_gemma":[0.9517301,0.00005208846,0.04753333,0.000240226,0.00009126461,3.705842e-7,1.836777e-7,0.000005655647,0.0003467899],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3715885,"threshold_uncertainty_score":0.2645554,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1482736558","doi":"10.1090/s0002-9939-05-07752-x","title":"The Lax conjecture is true","year":2005,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":105,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; University of Minnesota","keywords":"Conjecture; Lax pair; Counterexample; Class (philosophy); Generalization","retraction":null,"screen_n_in":null,"score":{"opus":0.006701122251497698,"gpt":0.2346975051072242,"spread":0.2279963828557265,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006380195,0.0001459081,0.0002446781,0.000007667318,0.0003486329,0.000147703,0.001859859,0.00003429739,0.00002311701],"category_scores_gemma":[0.0001296335,0.00007129782,0.0003468572,0.0004973458,0.0006731587,0.0001956724,0.00047548,0.0002289877,0.00003427402],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003270758,"about_ca_system_score_gemma":0.00002529665,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002189133,"about_ca_topic_score_gemma":8.955602e-8,"domain_scores_codex":[0.9988053,0.00001132012,0.000269381,0.0002240802,0.0003872495,0.000302666],"domain_scores_gemma":[0.998913,0.0002842133,0.0003390542,0.0002927581,0.00009919734,0.00007173855],"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.000005409944,0.00008197367,0.00008396534,0.00006539072,0.00006887685,5.805909e-8,0.004519777,0.000002734452,0.001448592,0.9452274,0.02123994,0.02725586],"study_design_scores_gemma":[0.0003324127,0.0001318122,0.0004027044,0.00007711564,0.0000457688,0.00004667457,0.00186584,0.06249961,0.03709857,0.8571616,0.03996323,0.0003746272],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6544621,0.0005057441,0.09848411,0.1905413,0.0003298682,0.001383222,0.00001608968,0.0006824366,0.05359515],"genre_scores_gemma":[0.8530264,0.00007415503,0.1401374,0.004322408,0.0002592716,0.00003089439,7.122794e-8,0.00002086135,0.002128433],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1985644,"threshold_uncertainty_score":0.3456112,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2079678340","doi":"10.1093/imrn/rnm086","title":"Operator-valued Semicircular Elements: Solving A Quadratic Matrix Equation with Positivity Constraints","year":2007,"lang":"en","type":"article","venue":"International Mathematics Research Notices","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":104,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Queen (butterfly); Mathematics; Operator (biology)","retraction":null,"screen_n_in":null,"score":{"opus":0.06121214032924077,"gpt":0.3893041851664276,"spread":0.3280920448371868,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00727646,0.0001767545,0.0001948483,0.0004271345,0.0002939794,0.0007399213,0.001387441,0.00006813907,0.000181155],"category_scores_gemma":[0.0007795907,0.0001450777,0.00005606733,0.0004814594,0.0002406941,0.001038639,0.000338798,0.0003575643,0.0001814852],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001985214,"about_ca_system_score_gemma":0.0001669472,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002424714,"about_ca_topic_score_gemma":0.00001987665,"domain_scores_codex":[0.9964448,0.0002196716,0.0005166522,0.0004099208,0.001874367,0.0005345538],"domain_scores_gemma":[0.9971325,0.001256246,0.0001978205,0.0004572385,0.0007992918,0.0001568947],"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.00003317713,0.0004806947,0.0004131867,0.000150641,0.0001822538,0.0001924229,0.002668869,0.0003966701,0.008946283,0.9798146,0.00006366315,0.006657525],"study_design_scores_gemma":[0.001147749,0.0002713956,0.0003853932,0.0005600827,0.00001979668,0.0001258609,0.001770423,0.8969936,0.02062406,0.07730495,0.000329097,0.0004675834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1178003,0.00004510463,0.8717145,0.0005405999,0.0002048111,0.0004109397,0.000008463094,0.00009856676,0.009176708],"genre_scores_gemma":[0.788003,0.000004095889,0.2114829,0.00005655182,0.0001156092,0.00001900523,0.000007725728,0.00001416308,0.0002969565],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9025096,"threshold_uncertainty_score":0.7135078,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2008280507","doi":"10.1063/1.481492","title":"A new iterative method for calculating energy levels and wave functions","year":2000,"lang":"en","type":"article","venue":"The Journal of Chemical Physics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":96,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Lanczos resampling; Precondition; Iterative method; Lanczos algorithm; Wave function; Mathematics; Applied mathematics; Hamiltonian (control theory); Energy (signal processing); Mathematical analysis; Algorithm; Mathematical optimization; Computer science; Eigenvalues and eigenvectors; Physics; Statistics; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.0271123794645822,"gpt":0.2796081261269244,"spread":0.2524957466623421,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002952184,0.00007041502,0.000130855,0.000009748732,0.00007181348,0.00004383414,0.0002015355,0.00002266631,0.00002079763],"category_scores_gemma":[0.00002103618,0.00004372142,0.00007378402,0.0001105623,0.00002231608,0.0002317008,0.00003624259,0.0001169688,8.054063e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001120458,"about_ca_system_score_gemma":0.00003704269,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000324392,"about_ca_topic_score_gemma":5.515528e-8,"domain_scores_codex":[0.9994797,0.00006597021,0.0001713639,0.00006746335,0.0001111756,0.0001042942],"domain_scores_gemma":[0.9991594,0.0004880903,0.0001064591,0.0001104415,0.00006458531,0.0000710013],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006226133,0.00003445659,4.726667e-7,0.000006811664,0.00006708741,0.000001892154,0.001829535,0.0006835652,0.07418291,0.08149774,0.001613196,0.8400201],"study_design_scores_gemma":[0.0006060993,0.0001084593,0.000004578608,0.00002864555,0.00005045429,0.0001747261,0.00002936288,0.1806521,0.2198005,0.5937557,0.004663566,0.0001258725],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00764587,0.00007633356,0.9912347,0.0005484151,0.00004143685,0.00002630879,0.000001997146,0.000007223173,0.0004177239],"genre_scores_gemma":[0.4434442,0.000008441342,0.5530353,0.0006401591,0.001398396,0.000001509232,6.156844e-7,0.00001075577,0.001460657],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8398942,"threshold_uncertainty_score":0.1782908,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2139454542","doi":"10.1016/s0024-3795(99)00281-5","title":"Principal pivot transforms: properties and applications","year":2000,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":92,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Principal (computer security); Mathematics; Principal component analysis; Transformation (genetics); Matrix (chemical analysis); Transformation matrix; Algebra over a field; Algorithm; Mathematical optimization; Applied mathematics; Computer science; Pure mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.01592799521258953,"gpt":0.2277478120045485,"spread":0.211819816791959,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001109295,0.0001173569,0.000110498,0.00004223533,0.000348416,0.00009657164,0.0003017111,0.00005138413,0.00006261586],"category_scores_gemma":[0.000002506355,0.00009533903,0.00002611555,0.000249219,0.00007233529,0.0002988153,0.00004774353,0.00009954729,0.0001094837],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005147251,"about_ca_system_score_gemma":0.00002455001,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003479943,"about_ca_topic_score_gemma":0.00000145914,"domain_scores_codex":[0.9991983,0.0000181907,0.0001791106,0.0003321326,0.00009717062,0.0001751089],"domain_scores_gemma":[0.9994782,0.00003174063,0.00002650799,0.0003047199,0.00003578374,0.000123112],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000003544656,0.00007174402,0.00001098007,0.00003952593,0.00001047014,2.692068e-7,0.0004050601,0.00001303425,0.000670981,0.6834564,0.00002162358,0.3152963],"study_design_scores_gemma":[0.0005979176,0.00009281321,0.0005435706,0.00002325287,0.00003288425,0.00007548217,0.00009378063,0.05502445,0.006381342,0.05334755,0.8832697,0.000517322],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07965682,0.004859668,0.8898246,0.003544805,0.00003314915,0.002644765,0.00004530028,0.0006477658,0.0187431],"genre_scores_gemma":[0.975705,0.001699493,0.01452765,0.0006432307,0.0003769737,0.001837143,0.0000162589,0.00002174642,0.005172469],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8960482,"threshold_uncertainty_score":0.3887812,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2118811613","doi":"10.1137/s089547980036838x","title":"Twice Differentiable Spectral Functions","year":2001,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":90,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Differentiable function; Hessian matrix; Eigenvalues and eigenvectors; Pure mathematics; Symmetric matrix; Function (biology); Mathematical analysis; Matrix (chemical analysis); Applied mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.007979552960835083,"gpt":0.2555741821285429,"spread":0.2475946291677078,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003072697,0.000130475,0.000213427,0.0004138462,0.0006573855,0.0004248416,0.0004184104,0.00004083329,0.0002986526],"category_scores_gemma":[0.000006575659,0.0001043218,0.00023297,0.001802877,0.00003421228,0.0002525265,0.00005792219,0.0002446789,0.000132353],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002471105,"about_ca_system_score_gemma":0.00002293997,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005772965,"about_ca_topic_score_gemma":0.000004766564,"domain_scores_codex":[0.9989212,0.00006465918,0.0002801889,0.0002810516,0.0002193926,0.0002334831],"domain_scores_gemma":[0.9990737,0.00008343186,0.0001513463,0.0004105936,0.00007438856,0.0002065678],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002389501,0.0005601052,0.005420151,0.00001070668,0.001120663,0.00002733695,0.000115759,0.003420671,0.0009052522,0.9247822,0.001877932,0.0617353],"study_design_scores_gemma":[0.00134983,0.0004322136,0.03595209,0.00002832256,0.002210159,0.0008565624,0.0003209082,0.1297569,0.0005431959,0.1943224,0.6331168,0.001110599],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01743168,0.0002916279,0.9764917,0.001185831,0.00004677095,0.000090357,0.000005180834,0.00006477467,0.004392113],"genre_scores_gemma":[0.9748088,0.0007760816,0.01251805,0.000249758,0.0006194842,0.00004314862,0.00001145733,0.00001073266,0.01096254],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9639736,"threshold_uncertainty_score":0.5056144,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2147228817","doi":"10.1016/s0024-3795(02)00260-4","title":"Two numerical methods for optimizing matrix stability","year":2002,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":89,"is_retracted":false,"has_abstract":false,"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; Matrix (chemical analysis); Function (biology); Matrix function; Exponential stability; Dynamical systems theory; Mathematical analysis; Pure mathematics; Combinatorics; Applied mathematics; Symmetric matrix; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.03626934322608164,"gpt":0.3461622929148682,"spread":0.3098929496887866,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003830029,0.0001041214,0.0001421221,0.00003706822,0.0002623716,0.00007633236,0.0003623796,0.00004070465,0.0000833922],"category_scores_gemma":[0.0000468894,0.00009399047,0.00005955986,0.0002856175,0.00002877114,0.0002081815,0.0001205374,0.00009081882,0.00004766495],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000948505,"about_ca_system_score_gemma":0.000009051505,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001409238,"about_ca_topic_score_gemma":9.80347e-8,"domain_scores_codex":[0.9991127,0.0000721779,0.0001981112,0.0003554873,0.00006499444,0.0001964948],"domain_scores_gemma":[0.9989894,0.0003914929,0.00005602966,0.0003812993,0.00006695175,0.0001148346],"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.000001905819,0.00008640184,0.000004893953,0.00002362889,0.000009812998,1.319602e-7,0.0002274665,0.00003899218,0.001128792,0.8512519,0.00008090478,0.1471452],"study_design_scores_gemma":[0.0002758345,0.00003615862,0.000008420038,0.000002627566,0.00001205782,0.00000859075,0.00002161529,0.8935222,0.006145175,0.03715441,0.06265279,0.0001601315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000406878,0.0009867639,0.9958251,0.001144616,0.00004975395,0.0005036628,0.00001068598,0.0001510495,0.0009214825],"genre_scores_gemma":[0.03240717,0.00006096622,0.9664787,0.0001813429,0.0001608738,0.0003275431,0.000004172113,0.000009302315,0.00036991],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8934832,"threshold_uncertainty_score":0.383282,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2008925030","doi":"10.1090/s0002-9947-03-03136-2","title":"Accelerating the convergence of the method of alternating projections","year":2003,"lang":"en","type":"article","venue":"Transactions of the American Mathematical Society","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":87,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Okanagan University College; University of Guelph","funders":"","keywords":"Linear subspace; Mathematics; Intersection (aeronautics); Hilbert space; Class (philosophy); Convergence (economics); Algorithm; Computer science; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02514081581970424,"gpt":0.2974430734405094,"spread":0.2723022576208051,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009695666,0.0000990604,0.0002400224,0.00001127521,0.0003283378,0.00001582528,0.001134109,0.0000214858,0.00005258758],"category_scores_gemma":[0.0001354356,0.00004801796,0.0004725912,0.0009143192,0.0006158622,0.0001011039,0.00004937821,0.0002195125,0.00000102742],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001654332,"about_ca_system_score_gemma":0.00007710735,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006311377,"about_ca_topic_score_gemma":0.000001454223,"domain_scores_codex":[0.998624,0.0003682893,0.0003999901,0.0001427497,0.000314858,0.0001501253],"domain_scores_gemma":[0.9978674,0.0008129763,0.0004894576,0.0007122476,0.0000941609,0.00002375551],"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.000007817272,0.0007438374,0.0003620988,0.0004357644,0.0004876967,1.264661e-7,0.02241533,0.01099347,0.04317351,0.8976107,0.000123978,0.02364564],"study_design_scores_gemma":[0.0003743462,0.0001471693,0.0007804219,0.0002001931,0.0002110398,0.00007002119,0.007951422,0.3779417,0.4365187,0.1753185,0.0001973036,0.0002891342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03447329,0.00001153071,0.9634002,0.0006517845,0.0001123589,0.0002383401,0.000005395924,0.00001898128,0.001088157],"genre_scores_gemma":[0.7112783,0.000007070617,0.2884639,0.00007280411,0.000007417905,0.00001504366,2.04786e-8,0.000005278442,0.0001502726],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7222922,"threshold_uncertainty_score":0.2525342,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2472073381","doi":"10.4153/cmb-2016-045-7","title":"Characterizations and Representations of Core and Dual Core Inverses","year":2016,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Core (optical fiber); Dual (grammatical number); Element (criminal law); Inverse; Pure mathematics; Commutative property; Algebra over a field; Order (exchange); Ring (chemistry); Geometry; Linguistics; Computer science; Law","retraction":null,"screen_n_in":null,"score":{"opus":0.02388299182852942,"gpt":0.2423627912624901,"spread":0.2184797994339607,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001290988,0.00006665323,0.0001134103,0.00007816734,0.0000803315,0.00003168145,0.0001260495,0.0000357249,0.001052805],"category_scores_gemma":[0.0002762254,0.00004817316,0.00001600544,0.00009030093,0.0001744904,0.00006262612,0.00006053505,0.00003230463,0.0001816246],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000109059,"about_ca_system_score_gemma":0.00005927245,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009111407,"about_ca_topic_score_gemma":0.00007016467,"domain_scores_codex":[0.9994531,0.00002045479,0.0001513089,0.0001604762,0.00007193185,0.0001426754],"domain_scores_gemma":[0.9991683,0.0002677638,0.00004277831,0.0002148417,0.00003896679,0.0002673129],"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":[8.735934e-7,0.000009283363,0.000247623,0.00002951517,0.000006405005,0.00001394727,0.0003261052,7.723818e-8,0.0008089193,0.9940814,0.001670583,0.002805233],"study_design_scores_gemma":[0.001216777,0.0001627898,0.01150852,0.0004683569,0.00004443861,0.0004325816,0.000362718,0.004629633,0.001997754,0.9212929,0.05724208,0.0006414407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7756489,0.0001598941,0.1605617,0.04758605,0.0002061321,0.0006454159,0.0002406982,0.0001346222,0.01481664],"genre_scores_gemma":[0.9821913,0.00002828072,0.01404637,0.000489888,0.00003664348,0.0000145976,0.00000324391,0.000008913137,0.003180761],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2065424,"threshold_uncertainty_score":0.9998603,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2092896986","doi":"10.1006/acha.2001.0363","title":"Convergence of Vector Subdivision Schemes in Sobolev Spaces","year":2002,"lang":"en","type":"article","venue":"Applied and Computational Harmonic Analysis","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":80,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Sobolev space; Subdivision; Sequence (biology); Convergence (economics); Norm (philosophy); Solution set; Combinatorics; Discrete mathematics; Mathematical analysis; Pure mathematics; Applied mathematics; Set (abstract data type)","retraction":null,"screen_n_in":null,"score":{"opus":0.01275456890589918,"gpt":0.2242901295698791,"spread":0.21153556066398,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000158719,0.00009843361,0.0002305654,0.0002583386,0.00005974288,0.00004173699,0.0002619399,0.00003300275,0.0001336457],"category_scores_gemma":[0.000005858569,0.00009161275,0.00007478183,0.001190754,0.00006367027,0.0001216686,0.00009616325,0.00006845353,0.00001956486],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001045958,"about_ca_system_score_gemma":0.00001226864,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001344281,"about_ca_topic_score_gemma":0.000001860864,"domain_scores_codex":[0.9990802,0.00003142946,0.0002396578,0.0002844966,0.0002308159,0.0001334306],"domain_scores_gemma":[0.9995021,0.0001544679,0.0001020332,0.0001501907,0.00004068284,0.00005054872],"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.000007830256,0.000130624,0.002478179,0.00002391042,0.0002205741,0.000006290179,0.0006388475,0.01764494,0.0003375389,0.9554005,0.00004177163,0.02306894],"study_design_scores_gemma":[0.0002783371,0.00001466242,0.01174666,0.000005662547,0.00005151843,0.000001560048,0.00004811731,0.9561742,0.0007379521,0.0307132,0.0001014814,0.0001266302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2844429,0.0006435827,0.71387,0.0003276756,0.00002765884,0.00007029998,0.000003729467,0.00003350537,0.0005806929],"genre_scores_gemma":[0.983672,0.0000645254,0.01612935,0.00005853112,0.00001111539,0.000005971148,0.000005425977,0.00000265581,0.00005042289],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9385293,"threshold_uncertainty_score":0.3735859,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2139136228","doi":"10.1016/s0024-3795(00)00026-4","title":"Spectrally arbitrary patterns","year":2000,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":79,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Sign (mathematics); Combinatorics; Monic polynomial; Conjecture; Tridiagonal matrix; Matrix (chemical analysis); Order (exchange); Nilpotent; Polynomial; Mathematical analysis; Physics; Eigenvalues and eigenvectors","retraction":null,"screen_n_in":null,"score":{"opus":0.007600462144641165,"gpt":0.2275437875955632,"spread":0.219943325450922,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007281041,0.00008614961,0.0000793535,0.00003113431,0.0001503979,0.00006621575,0.0003594754,0.00003550465,0.0004142133],"category_scores_gemma":[0.0000019152,0.00007816133,0.00003125465,0.0001824119,0.00001683836,0.0002178826,0.00004336654,0.00009461886,0.0004448032],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003528685,"about_ca_system_score_gemma":0.00001566284,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002740205,"about_ca_topic_score_gemma":7.554143e-7,"domain_scores_codex":[0.9993608,0.00001803136,0.0001274509,0.0002577985,0.00008265379,0.0001532937],"domain_scores_gemma":[0.9995407,0.00003767529,0.00002214242,0.0003050102,0.00001664749,0.00007775283],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000001698177,0.00006577856,0.00005570446,0.00001274895,0.000008775448,0.000002570959,0.000144123,0.000006751534,0.0002411835,0.8653987,0.0001574003,0.1339045],"study_design_scores_gemma":[0.0008118056,0.0001569893,0.007685127,0.00003346649,0.00003067354,0.0001507537,0.00003342671,0.1039578,0.01233478,0.2690857,0.6048189,0.0009006622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2172361,0.001069864,0.7323734,0.004644252,0.00008572285,0.0007875498,0.00005003859,0.0006689521,0.04308422],"genre_scores_gemma":[0.9438719,0.0009205285,0.04206654,0.002968967,0.0007172464,0.0002172469,0.00003045033,0.000023821,0.009183285],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7266359,"threshold_uncertainty_score":0.5717194,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2076733016","doi":"10.1002/cjs.5550350410","title":"Nonlinear functional models for functional responses in reproducing kernel hilbert spaces","year":2007,"lang":"en","type":"article","venue":"Canadian Journal of Statistics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Reproducing kernel Hilbert space; Hilbert space; Kernel (algebra); Smoothing; Estimator; Nonlinear system; Applied mathematics; Kernel regression; Computer science; Extension (predicate logic); Kernel method; Mathematics; Representer theorem; Kernel smoother; Nonlinear regression; Nonparametric regression; Algorithm; Artificial intelligence; Regression analysis; Machine learning; Kernel embedding of distributions; Support vector machine; Statistics; Discrete mathematics; Pure mathematics; Radial basis function kernel","retraction":null,"screen_n_in":null,"score":{"opus":0.03725385583395897,"gpt":0.2508526050452271,"spread":0.2135987492112681,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001956573,0.0000958584,0.000150719,0.0004168779,0.0001413444,0.0001007661,0.0002525944,0.00004716908,0.00003592457],"category_scores_gemma":[0.0006720173,0.0000936232,0.00004634107,0.0002268201,0.00005844497,0.0003444299,0.00001367032,0.0001905677,0.000003550474],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001515194,"about_ca_system_score_gemma":0.001419129,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005335347,"about_ca_topic_score_gemma":0.006310643,"domain_scores_codex":[0.9988459,0.00004203919,0.0004122005,0.0001912966,0.0002033158,0.0003052228],"domain_scores_gemma":[0.9982645,0.0006530813,0.0001889754,0.0001823871,0.0003698345,0.0003412338],"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.0005137454,0.00007834407,0.003096053,0.0000528999,0.00008445625,0.001015872,0.001606332,0.03681028,0.0001769801,0.8874505,0.0242371,0.04487748],"study_design_scores_gemma":[0.002731109,0.0007061586,0.03120483,0.0001877621,0.00004744154,0.001536511,0.0005678651,0.3999687,0.001020823,0.506687,0.05460605,0.0007356348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01147984,0.0002061904,0.9861522,0.0006416238,0.001102765,0.00007060744,0.000126527,0.000005262449,0.0002149895],"genre_scores_gemma":[0.3307996,0.00001170364,0.6662937,0.000424555,0.0009154048,0.000002002458,0.00001326987,0.00001687528,0.001522929],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3807634,"threshold_uncertainty_score":0.3817843,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2102278702","doi":"10.1109/tit.2014.2298436","title":"The Entropy Power Inequality for Quantum Systems","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":74,"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":"Inequality; Quantum relative entropy; Statistical physics; Quantum; Mathematics; Physics; Quantum discord; Quantum mechanics; Mathematical analysis; Quantum entanglement","retraction":null,"screen_n_in":null,"score":{"opus":0.00955767166377284,"gpt":0.2327939831752894,"spread":0.2232363115115166,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002384484,0.0001221311,0.0001139243,0.0000936513,0.0006973927,0.0003510437,0.0005525195,0.00006144651,0.00001523199],"category_scores_gemma":[0.00004091271,0.00008353017,0.0001111281,0.0001711131,0.00005872738,0.001245716,0.000002255595,0.0001374533,0.0002085209],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003525307,"about_ca_system_score_gemma":0.00003167965,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003087046,"about_ca_topic_score_gemma":3.783353e-7,"domain_scores_codex":[0.9987613,0.0002901747,0.0003949214,0.0001108509,0.0002183862,0.0002243671],"domain_scores_gemma":[0.9979913,0.00111664,0.0001577985,0.0005367796,0.000131874,0.00006563277],"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.00005508895,0.00001931673,1.019971e-7,0.00001810276,0.0000150921,2.883702e-8,0.0006059551,0.004412471,0.00001523519,0.9575779,0.0001623402,0.03711838],"study_design_scores_gemma":[0.0009000208,0.0003035964,0.00001077199,0.0000271354,0.00001468985,0.00001124153,0.0006059375,0.6320478,0.004039621,0.2532774,0.1084699,0.0002918852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0005006432,0.00001176052,0.9941564,0.0003913543,0.00256364,0.0003674861,0.00002269427,0.0002021348,0.001783867],"genre_scores_gemma":[0.9978676,0.000009011945,0.001120385,0.0004343468,0.0000446866,0.0001601678,0.000002376433,0.000005514687,0.0003558787],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.997367,"threshold_uncertainty_score":0.5363851,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2149623001","doi":"10.1016/s0024-3795(01)00472-4","title":"Efficient matrix preconditioners for black box linear algebra","year":2002,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Preconditioner; Linear algebra; Algebra over a field; Mathematics; Toeplitz matrix; Numerical linear algebra; Computation; Matrix (chemical analysis); Algebraic number; Linear system; Pure mathematics; Algorithm; Mathematical analysis; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01530175664444624,"gpt":0.2593083641973076,"spread":0.2440066075528613,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001990825,0.0001799727,0.0001784242,0.0001032119,0.0003725432,0.00009718349,0.0004881645,0.00009230428,0.0001565859],"category_scores_gemma":[0.00003316544,0.0001692958,0.00009418314,0.000393448,0.00007502366,0.000149214,0.0001168075,0.0001244463,0.000529501],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001736276,"about_ca_system_score_gemma":0.00001904594,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001136061,"about_ca_topic_score_gemma":4.421206e-7,"domain_scores_codex":[0.9987096,0.00003161483,0.0002980198,0.0004975208,0.0001547822,0.0003085095],"domain_scores_gemma":[0.9989372,0.0001889166,0.0001071208,0.0004803792,0.000108278,0.0001780798],"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.000003989669,0.0002207031,0.000003682964,0.00007647119,0.00002986082,7.886853e-7,0.0005292682,0.001332918,0.0005476301,0.9820994,0.002472028,0.01268324],"study_design_scores_gemma":[0.0004825804,0.00007180192,0.00002454574,0.0000116458,0.0000240127,0.00001316165,0.00003502513,0.8923299,0.002659435,0.01667349,0.08739807,0.0002763028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01668694,0.0009499303,0.9753602,0.002991538,0.0001359743,0.001387656,0.0001167217,0.000346069,0.002025024],"genre_scores_gemma":[0.7799645,0.0004546975,0.1993519,0.001598969,0.001636865,0.001720206,0.0001419529,0.00008535376,0.01504557],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9654259,"threshold_uncertainty_score":0.6903682,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1989189227","doi":"10.1007/s100120200015","title":"The Maximal and Minimal Ranks of Some Expressions of Generalized Inverses of Matrices","year":2002,"lang":"en","type":"article","venue":"Southeast Asian Bulletin of Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Combinatorics; Rank (graph theory); Commutative property; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01595025831413325,"gpt":0.2181711489532553,"spread":0.202220890639122,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005524678,0.0001406509,0.0004113538,0.00008825165,0.00007427382,0.0000168975,0.0007090554,0.00006628568,0.0001816131],"category_scores_gemma":[0.0001457378,0.00009526845,0.0001282657,0.000147625,0.0003495035,0.00004400974,0.0002461754,0.00008074909,0.000008672818],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002611093,"about_ca_system_score_gemma":0.00001463613,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006517467,"about_ca_topic_score_gemma":2.421625e-7,"domain_scores_codex":[0.9985539,0.0001164201,0.0006673923,0.0001542414,0.0003328629,0.0001751691],"domain_scores_gemma":[0.9982865,0.0003713485,0.000667088,0.0005200731,0.00009609673,0.00005887432],"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.00008498863,0.001073448,0.0001880631,0.002382319,0.0001927613,0.000006470709,0.03083649,0.00003744883,0.009282448,0.941516,0.002466868,0.01193269],"study_design_scores_gemma":[0.01307078,0.002463582,0.000922347,0.005110018,0.0007376457,0.0003167803,0.08352126,0.1045629,0.2338171,0.5313994,0.02169151,0.002386636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9113472,0.007511471,0.04738354,0.006527857,0.0005197479,0.001342311,0.0003326046,0.0001395034,0.02489573],"genre_scores_gemma":[0.8434343,0.000139986,0.1558243,0.00001173164,0.00003502892,0.000006952815,4.715114e-7,0.00001430167,0.0005329486],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4101167,"threshold_uncertainty_score":0.3884935,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2106833662","doi":"10.1137/s1064827599353865","title":"Residual Replacement Strategies for Krylov Subspace Iterative Methods for the Convergence of True Residuals","year":2000,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; McKnight Foundation","keywords":"Residual; Krylov subspace; Mathematics; Generalized minimal residual method; Subspace topology; Convergence (economics); Method of mean weighted residuals; Applied mathematics; Computation; Mathematical optimization; Iterative method; Algorithm; Finite element method; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.03886730709429653,"gpt":0.3721906244394505,"spread":0.333323317345154,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.01137565,0.0002049652,0.0003109916,0.0001736327,0.001492288,0.001339528,0.001421915,0.00005122721,0.0001093372],"category_scores_gemma":[0.0003014887,0.0001391057,0.0002161776,0.0006164938,0.0002383672,0.0004947927,0.0001225852,0.0002577509,0.000007679019],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004431829,"about_ca_system_score_gemma":0.0003108921,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002008267,"about_ca_topic_score_gemma":0.000001458388,"domain_scores_codex":[0.9972076,0.0005548925,0.0007234143,0.0005550231,0.0004707669,0.0004883427],"domain_scores_gemma":[0.9948448,0.003380402,0.0005071042,0.0006684547,0.0004829571,0.0001162688],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005679975,0.0002296583,0.00003042666,0.0001114148,0.0001938558,0.000007720773,0.01580085,0.03838886,0.005470497,0.3796498,0.01279884,0.5467501],"study_design_scores_gemma":[0.002103071,0.001456302,0.0002431294,0.0003476554,0.00005741687,0.0001517821,0.002972359,0.7613063,0.04063052,0.1146372,0.07553747,0.0005568432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0376736,0.0004116692,0.9571561,0.00123438,0.002343352,0.0005958209,0.00001351462,0.00003916748,0.0005324468],"genre_scores_gemma":[0.3415494,0.00002525591,0.6521518,0.0002297794,0.0006138051,0.00001860003,0.00000364327,0.0000219093,0.005385797],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7229174,"threshold_uncertainty_score":0.9998077,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2015224767","doi":"10.1137/s0895479802402818","title":"Optimization and Pseudospectra, with Applications to Robust Stability","year":2003,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Lipschitz continuity; Mathematical analysis; Matrix (chemical analysis); Condition number; Applied mathematics; Complex plane","retraction":null,"screen_n_in":null,"score":{"opus":0.01048618722052016,"gpt":0.2502751010984845,"spread":0.2397889138779643,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005699379,0.0001447774,0.0002223885,0.000325798,0.0005704287,0.0003652015,0.0002561371,0.00003985632,0.00007645282],"category_scores_gemma":[0.00001223299,0.0001126296,0.00007363052,0.002047468,0.00005023622,0.0002051707,0.00003428031,0.0001692944,0.00001069219],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003087609,"about_ca_system_score_gemma":0.0000412873,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000253326,"about_ca_topic_score_gemma":0.000004970977,"domain_scores_codex":[0.9988272,0.00009233312,0.0002794947,0.0003986604,0.0002147163,0.0001876568],"domain_scores_gemma":[0.9988646,0.0001015734,0.0001488567,0.0004594159,0.0001398691,0.0002857153],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009447264,0.0002169055,0.002161225,0.0000144344,0.0002521956,0.000001928927,0.0001220401,0.1652638,0.0001416089,0.8206841,0.00004663872,0.01108565],"study_design_scores_gemma":[0.003878322,0.001416188,0.01674433,0.00009061617,0.004044829,0.001018582,0.001582059,0.6106639,0.005504232,0.2108817,0.1404712,0.003704023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002468778,0.0002109083,0.9952355,0.0006974926,0.000008187165,0.0003483434,0.000007151511,0.00004720667,0.0009764178],"genre_scores_gemma":[0.4616334,0.0003788822,0.5370938,0.000246386,0.0001063653,0.000255074,0.000006862601,0.00001330509,0.0002658854],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6098024,"threshold_uncertainty_score":0.4592903,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2067314231","doi":"10.1007/s10589-013-9635-7","title":"The generalized trust region subproblem","year":2014,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Trust region; Bounded function; Parameterized complexity; Quadratic equation; Eigenvalues and eigenvectors; Constraint (computer-aided design); Combinatorics; Applied mathematics; Mathematical optimization; Mathematical analysis; Computer science; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.009774008977502658,"gpt":0.2310685406414498,"spread":0.2212945316639472,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002160661,0.00007711205,0.00006493195,0.00003837816,0.0007037568,0.0002362655,0.0003012962,0.00002791493,0.000005278581],"category_scores_gemma":[0.00001716311,0.00005894055,0.00002583043,0.0002784483,0.00007159749,0.0001646265,0.00006925828,0.00005019542,0.00001481791],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009648343,"about_ca_system_score_gemma":0.00002336544,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.854808e-7,"about_ca_topic_score_gemma":3.004226e-7,"domain_scores_codex":[0.9993157,0.00007284654,0.0001744927,0.000211247,0.0001198055,0.0001059003],"domain_scores_gemma":[0.9992659,0.0002399829,0.00008703781,0.0002269033,0.0001172785,0.00006287664],"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":[7.111299e-7,0.000008151707,0.00001285784,0.000001489899,0.000002283523,3.76642e-8,0.00001661145,0.3700061,8.724363e-7,0.6097662,0.0001976103,0.019987],"study_design_scores_gemma":[0.0001755832,0.000008175892,0.0001061336,0.000001733841,0.000002448275,0.00001004434,0.000004490319,0.817763,0.000006406142,0.1398675,0.04198705,0.00006742018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00005592054,0.00008959951,0.9937012,0.003515409,0.0000457496,0.0002122246,9.767217e-7,0.0001180491,0.002260932],"genre_scores_gemma":[0.1773278,0.0002005235,0.8185669,0.001575556,0.0002923164,0.000376208,0.0000801346,0.00001739251,0.001563246],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4698988,"threshold_uncertainty_score":0.54128,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2080022619","doi":"10.1016/s0024-3795(01)00297-x","title":"Rank equalities for idempotent and involutary matrices","year":2001,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Idempotent matrix; Idempotence; Rank (graph theory); Hermitian matrix; Scalar (mathematics); Combinatorics; Algebra over a field; Commutator; Pure mathematics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.02096573759637562,"gpt":0.2691860662872015,"spread":0.2482203286908259,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000191681,0.00008623548,0.0001031884,0.00005252024,0.0002443535,0.0000766902,0.0002111395,0.00003905766,0.000008247281],"category_scores_gemma":[0.00001465887,0.00007553452,0.00002689315,0.0001701142,0.00003336009,0.0002424131,0.00009960661,0.00004792212,0.00001453247],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003696932,"about_ca_system_score_gemma":0.00001389992,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005620478,"about_ca_topic_score_gemma":0.000001245142,"domain_scores_codex":[0.9993678,0.00002059847,0.0001537072,0.0002417507,0.00006942845,0.0001467058],"domain_scores_gemma":[0.9994424,0.0001948713,0.00004632311,0.0001904312,0.00004434707,0.00008163813],"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.000004737621,0.00002770247,0.00004539666,0.00004347551,0.00001058121,4.794671e-7,0.0002990579,0.000005683812,0.0001938809,0.9561238,0.0001863674,0.04305887],"study_design_scores_gemma":[0.0007096517,0.0001060206,0.0004862385,0.00001920877,0.0000324074,0.00005955107,0.0002115183,0.1389925,0.0009851892,0.4620647,0.3959575,0.0003754711],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02560627,0.004732298,0.965649,0.002772596,0.00004663665,0.0005398032,0.00002471968,0.0001317366,0.00049693],"genre_scores_gemma":[0.7749577,0.007104928,0.2065709,0.002861894,0.001247907,0.001367904,0.00006029242,0.00004161333,0.005786909],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7590781,"threshold_uncertainty_score":0.3080208,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1170355282","doi":"10.1016/j.jcp.2015.08.016","title":"A scalable parallel black oil simulator on distributed memory parallel computers","year":2015,"lang":"en","type":"article","venue":"Journal of Computational Physics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":60,"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; Western Canada Research Grid; CMG Reservoir Simulation Foundation; University of Calgary","keywords":"Computer science; Scalability; Multigrid method; Parallel computing; Workstation; Discretization; Preconditioner; Grid; Computational science; Simulation; Black box; Iterative method; Algorithm; Partial differential equation","retraction":null,"screen_n_in":null,"score":{"opus":0.02421734290105837,"gpt":0.2633747208807521,"spread":0.2391573779796937,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005109167,0.0002058445,0.000355376,0.0000890126,0.00009775309,0.0001830783,0.000831509,0.0000535919,0.000005028838],"category_scores_gemma":[0.00005954076,0.0001775462,0.0002023391,0.0003935125,0.00009358711,0.0007075268,0.0001320571,0.0003020336,0.0001036173],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001076884,"about_ca_system_score_gemma":0.0002909712,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001441765,"about_ca_topic_score_gemma":6.505256e-8,"domain_scores_codex":[0.9979195,0.0001638869,0.0005331495,0.0002150168,0.0009126802,0.0002557564],"domain_scores_gemma":[0.99776,0.0004732211,0.0005270786,0.0002420737,0.0006741656,0.0003234896],"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.00007781293,0.0002573225,0.00001752965,0.00001166606,0.00006200319,0.00004556014,0.0002836967,0.9058531,0.000004196846,0.07795047,0.007151384,0.008285243],"study_design_scores_gemma":[0.00166611,0.0002691975,0.0001950797,0.00005057402,0.00001179302,0.00003727105,0.00003025334,0.7293565,0.00004078183,0.2666303,0.001532969,0.0001792355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02310132,0.00005050916,0.9742089,0.001195859,0.0006940499,0.00004890294,0.00001134566,0.00004798229,0.0006411204],"genre_scores_gemma":[0.8202606,0.000005239003,0.1776643,0.0009487307,0.0009054268,0.000001366558,0.00001918018,0.00001671501,0.0001784513],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7971593,"threshold_uncertainty_score":0.7240123,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1986793884","doi":"10.1080/03081087.2013.865732","title":"Principal powers of matrices with positive definite real part","year":2014,"lang":"en","type":"article","venue":"Linear and Multilinear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Positive-definite matrix; Principal (computer security); Numerical range; Context (archaeology); Norm (philosophy); Operator (biology); Complex matrix; Matrix norm; Matrix (chemical analysis); Algebra over a field; Pure mathematics; Combinatorics; Eigenvalues and eigenvectors; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.007976550912779514,"gpt":0.2322730185195941,"spread":0.2242964676068146,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003609798,0.0001579961,0.0002294344,0.00007909468,0.00008844086,0.00004277582,0.0003041175,0.00006342795,0.0000134363],"category_scores_gemma":[0.00003968707,0.0001177075,0.00005070381,0.0002135094,0.0001197556,0.0002151103,0.0001421671,0.0001216757,0.00002157762],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005060076,"about_ca_system_score_gemma":0.00003114861,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005123617,"about_ca_topic_score_gemma":0.000006619951,"domain_scores_codex":[0.9989197,0.00009071639,0.0002287882,0.0003304904,0.0001998231,0.0002304729],"domain_scores_gemma":[0.9991208,0.0002035295,0.0001178134,0.0003412404,0.00009159894,0.0001249834],"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.0007093132,0.000721172,0.01081935,0.0003943398,0.0003104381,0.00008517937,0.007224236,0.0006996776,0.002578537,0.7819951,0.0002068059,0.1942558],"study_design_scores_gemma":[0.005958868,0.00282906,0.02063439,0.0003457264,0.0001477051,0.0001748299,0.0003486297,0.8806797,0.05208956,0.006224479,0.02905152,0.001515531],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8352943,0.0001804368,0.1547279,0.0002366151,0.0002606286,0.0002912316,0.00003094014,0.0002043602,0.008773557],"genre_scores_gemma":[0.9079531,0.0001070432,0.09116203,0.0001577443,0.0001860649,0.000005574904,0.00001033152,0.00001602952,0.0004020662],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.87998,"threshold_uncertainty_score":0.4799973,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2039538606","doi":"10.1016/j.laa.2005.03.035","title":"Canonical forms for symmetric/skew-symmetric real matrix pairs under strict equivalence and congruence","year":2005,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Skew-symmetric matrix; Hamiltonian matrix; Symmetric matrix; Linear subspace; Canonical form; Pure mathematics; Congruence (geometry); Combinatorics; Skew; Mathematical proof; Hermitian matrix; Algebra over a field; Square matrix; Eigenvalues and eigenvectors; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01754409141837518,"gpt":0.2878598051876947,"spread":0.2703157137693195,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004551767,0.0001876773,0.0002135017,0.0002299278,0.0003784385,0.0001520441,0.0005381018,0.0001106457,0.00001284219],"category_scores_gemma":[0.00009161385,0.0001617762,0.0000626234,0.001152595,0.00008067231,0.000481283,0.0002238984,0.0001534625,0.0000335776],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003474506,"about_ca_system_score_gemma":0.00009176372,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001794831,"about_ca_topic_score_gemma":0.000007550271,"domain_scores_codex":[0.9985005,0.00003797941,0.0003291135,0.0005582119,0.0002008064,0.000373424],"domain_scores_gemma":[0.9983565,0.0007460863,0.0001160103,0.0004141816,0.000124674,0.0002425036],"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.000006042415,0.00005860012,0.00006319908,0.00003332819,0.00001314718,3.895591e-7,0.00005085825,0.00002093791,0.0001548203,0.9467188,0.0001097548,0.05277013],"study_design_scores_gemma":[0.003070658,0.0006709002,0.006637843,0.00005677406,0.0001493435,0.0001495711,0.0002084545,0.6044908,0.00615538,0.2584917,0.1183712,0.001547377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04608469,0.002875953,0.9441533,0.002914358,0.00007876801,0.001256672,0.00009146672,0.0002532169,0.002291577],"genre_scores_gemma":[0.9278139,0.00147761,0.06862281,0.0004055771,0.0003140343,0.0003411225,0.00001775026,0.00001910628,0.0009880511],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8817292,"threshold_uncertainty_score":0.6597041,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1986048785","doi":"10.1134/s0081543811080098","title":"The Peano-Baker series","year":2011,"lang":"en","type":"article","venue":"Proceedings of the Steklov Institute of Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":59,"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":"Peano axioms; Series (stratigraphy); Simple (philosophy); Ode; Folklore; Convergence (economics); Calculus (dental); Mathematics; Algebra over a field; Computer science; Applied mathematics; Pure mathematics; Algorithm; Epistemology; Literature; Art; Philosophy","retraction":null,"screen_n_in":null,"score":{"opus":0.02236058055056811,"gpt":0.2119588416311635,"spread":0.1895982610805954,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007276621,0.0001444219,0.0002142928,0.00003919781,0.000238041,0.00005942117,0.00230687,0.00004791236,0.000007383192],"category_scores_gemma":[0.0002226804,0.00007635432,0.0001365568,0.0003267191,0.0004502307,0.0007184906,0.0006175508,0.0001222498,0.000009124712],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001065478,"about_ca_system_score_gemma":0.00003783823,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004151096,"about_ca_topic_score_gemma":0.000001470303,"domain_scores_codex":[0.9988599,0.000006105756,0.0004290289,0.0001520023,0.0003489719,0.0002039307],"domain_scores_gemma":[0.9987878,0.00004765066,0.0004937437,0.0003857197,0.000244983,0.00004006454],"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.000006456167,0.00006571524,0.0000871127,0.0002344194,0.00003300046,2.85988e-7,0.00388241,0.000001166935,0.000850193,0.9926315,0.0003533346,0.001854387],"study_design_scores_gemma":[0.0003954264,0.0002103271,0.0003560336,0.000427122,0.00006606136,0.0001103325,0.002172045,0.002114814,0.2895687,0.6869248,0.01732633,0.0003280522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5277218,0.000582928,0.05409194,0.00265155,0.004009791,0.001705335,0.00001498952,0.0003917869,0.4088299],"genre_scores_gemma":[0.6642322,0.00008343381,0.3304426,0.00004965127,0.00009714445,0.00002390638,1.452114e-7,0.00002295538,0.005047992],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4037819,"threshold_uncertainty_score":0.4286778,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2050724454","doi":"10.1090/s0025-5718-00-01262-x","title":"Tensor product Gauss-Lobatto points are Fekete points for the cube","year":2000,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Tensor product; Mathematics; Simplex; Tensor (intrinsic definition); Quadrature (astronomy); Pure mathematics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.02062821264115689,"gpt":0.2670022820283079,"spread":0.246374069387151,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007667263,0.0001390509,0.0002189086,0.00005678636,0.0001546831,0.0001080554,0.0006201664,0.00003268246,0.00004759129],"category_scores_gemma":[0.0001323871,0.00009849901,0.00009869943,0.0002345289,0.00005455954,0.0002632644,0.00006191352,0.00006963213,0.00008503778],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001499408,"about_ca_system_score_gemma":0.00002458671,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000202749,"about_ca_topic_score_gemma":6.121141e-7,"domain_scores_codex":[0.998849,0.0000579489,0.0003781478,0.0002409959,0.0002808263,0.0001931335],"domain_scores_gemma":[0.9985047,0.0005685406,0.000252911,0.0004572827,0.0001764671,0.00004009657],"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.00009174332,0.001016449,0.00007651027,0.001481093,0.0002321242,0.000008262577,0.009285466,0.0238086,0.000480389,0.365423,0.009069896,0.5890265],"study_design_scores_gemma":[0.0004444952,0.00007666767,0.0004517847,0.0001025121,0.00002580368,0.00002234044,0.0000929567,0.6344751,0.003016946,0.3598916,0.001230048,0.0001697129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03453549,0.000100959,0.9604598,0.002942457,0.0002040467,0.0007136326,0.00001078105,0.0001091541,0.0009236931],"genre_scores_gemma":[0.4838411,0.00001646427,0.5146637,0.0002701737,0.0001550262,0.00005192915,0.0000062639,0.00002314021,0.0009722079],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6106665,"threshold_uncertainty_score":0.4016673,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1965418516","doi":"10.1063/1.4821348","title":"Solving the Schroedinger equation using Smolyak interpolants","year":2013,"lang":"en","type":"article","venue":"The Journal of Chemical Physics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Collocation (remote sensing); Eigenvalues and eigenvectors; Schrödinger equation; Applied mathematics; Mathematics; Collocation method; Grid; Matrix (chemical analysis); Wave function; Sparse grid; Mathematical analysis; Computer science; Differential equation; Physics; Ordinary differential equation; Geometry; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.03093347946275224,"gpt":0.2565574113274161,"spread":0.2256239318646639,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005641837,0.00007464184,0.0001054345,0.00001325361,0.00008959358,0.0001157949,0.0009257385,0.0000228713,0.0000153022],"category_scores_gemma":[0.00006320271,0.00003636347,0.00007458082,0.0001492978,0.00006933251,0.0005985005,0.000179204,0.0002848894,0.00002025236],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000288988,"about_ca_system_score_gemma":0.00003122856,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006081537,"about_ca_topic_score_gemma":1.341452e-8,"domain_scores_codex":[0.9992489,0.0000816422,0.000220688,0.00005436831,0.000252274,0.0001420991],"domain_scores_gemma":[0.9990429,0.0003034936,0.0002645478,0.0002133961,0.0001333158,0.00004229065],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001585306,0.00007014981,0.00002228427,0.00001162717,0.00005875899,0.000002171426,0.002364256,0.0005442895,0.9248568,0.02273569,0.001132449,0.04818563],"study_design_scores_gemma":[0.0002093595,0.00003329066,0.00002070576,0.00008319155,0.00002917039,0.0001053096,0.0000863214,0.4180027,0.3132611,0.2679729,0.00008597986,0.0001099987],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4721201,0.0000838997,0.5264481,0.0008325164,0.0002547182,0.00005091892,1.539798e-7,0.000009945564,0.0001996598],"genre_scores_gemma":[0.9941645,0.000005545257,0.004872781,0.0002909824,0.0006493526,3.926998e-7,7.355531e-8,0.000004895413,0.0000115125],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6115958,"threshold_uncertainty_score":0.1720268,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2131628385","doi":"10.1016/j.jedc.2010.10.006","title":"Second-order approximation of dynamic models without the use of tensors","year":2010,"lang":"en","type":"article","venue":"Journal of Economic Dynamics and Control","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Hessian matrix; Fortran; Code (set theory); Representation (politics); Order (exchange); MATLAB; Computer science; Matrix representation; Applied mathematics; USable; Matrix (chemical analysis); Key (lock); Source code; Algorithm; Algebra over a field; Theoretical computer science; Programming language; Mathematical optimization; Mathematics; Pure mathematics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01006795405941648,"gpt":0.2144271534804262,"spread":0.2043591994210097,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006383941,0.00008997062,0.0002957637,0.0000921493,0.00004180906,0.00006799617,0.0003905871,0.00005313966,0.00001095067],"category_scores_gemma":[0.00002665226,0.0000607351,0.00009530714,0.00004287432,0.00008925578,0.0006324091,0.0000421639,0.0002006344,5.402668e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001880876,"about_ca_system_score_gemma":0.00007905436,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007544553,"about_ca_topic_score_gemma":0.00005310753,"domain_scores_codex":[0.999157,0.00004847134,0.0005202299,0.00009907837,0.00007174868,0.0001034595],"domain_scores_gemma":[0.9986018,0.000193341,0.0007753606,0.0002484412,0.0001326342,0.00004840605],"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.0001841103,0.0001330578,0.001137217,0.00006281748,0.0003179919,0.000003559084,0.0008355716,0.07385349,0.004428083,0.8454477,0.00003294264,0.07356345],"study_design_scores_gemma":[0.0007671873,0.00007409183,0.0004988382,0.00001047442,0.00002221499,0.00006202095,0.00002696248,0.9654673,0.00004161268,0.03289146,0.00007529177,0.00006259725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5594416,0.00003316436,0.4397489,0.0003299096,0.0002575837,0.00008081481,0.0000156115,0.000002731339,0.00008964646],"genre_scores_gemma":[0.9854698,0.0000262417,0.0142493,0.00006342614,0.0000522909,0.000001192381,4.388532e-7,0.000005600129,0.000131742],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8916138,"threshold_uncertainty_score":0.2476705,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2810171908","doi":"10.1070/rm9892","title":"Integral norm discretization and related problems","year":2019,"lang":"en","type":"article","venue":"Russian Mathematical Surveys","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Generalitat de Catalunya; Natural Sciences and Engineering Research Council of Canada; Ministerio de Ciencia e Innovación; Ministry of Education and Science of the Russian Federation; Centres de Recerca de Catalunya","keywords":"Mathematics; Discretization; Norm (philosophy); Applied mathematics; Algebra over a field; Mathematical economics; Calculus (dental); Pure mathematics; Mathematical analysis; Law; Political science; Medicine","retraction":null,"screen_n_in":null,"score":{"opus":0.00750721445071233,"gpt":0.2164403390702487,"spread":0.2089331246195363,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001670087,0.0001331129,0.0002031021,0.0000545477,0.00006212612,0.0001573223,0.0003460685,0.00007949911,0.0004540889],"category_scores_gemma":[0.00007374882,0.00009454146,0.00004555211,0.0002838006,0.00005356928,0.0003608648,0.0001653934,0.0001459023,0.0008740599],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001482848,"about_ca_system_score_gemma":0.00001585425,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003687699,"about_ca_topic_score_gemma":9.59876e-7,"domain_scores_codex":[0.9986961,0.00032777,0.0002677901,0.0002905896,0.0001917516,0.0002259902],"domain_scores_gemma":[0.999219,0.0002054831,0.00006969473,0.0003724884,0.00001614688,0.0001171985],"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":[5.90471e-7,0.00004163902,0.0006427494,0.00007304446,0.00000915324,0.000002301734,0.0003810578,0.000006569395,0.00005335015,0.9908311,0.00001000128,0.007948495],"study_design_scores_gemma":[0.0003105761,0.00007817967,0.0105682,0.0001033011,0.000005043304,0.00004526061,0.00002103227,0.1397254,0.0001331106,0.8486249,0.000153518,0.0002314397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03262745,0.00004301531,0.8995311,0.0009319496,0.0001873458,0.0003657968,0.000002882927,0.0002290554,0.06608146],"genre_scores_gemma":[0.9805166,0.00000539747,0.01601982,0.00003165323,0.0000164637,0.000008000105,0.000006379676,0.00001179892,0.003383861],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9478891,"threshold_uncertainty_score":0.9999039,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1612003494","doi":"10.48550/arxiv.1105.1185","title":"Iterative Methods for Computing Eigenvalues and Eigenvectors","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":56,"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":"Power iteration; Rayleigh quotient iteration; Eigenvalues and eigenvectors; Inverse iteration; Iterative method; Mathematics; Matrix-free methods; Applied mathematics; Linear algebra; Eigenvalues and eigenvectors of the second derivative; Modal matrix; Polynomial; Eigenvalue perturbation; Eigenvalue algorithm; Matrix (chemical analysis); Algorithm; Symmetric matrix; Diagonalizable matrix; Mathematical analysis; Sparse matrix; Square matrix; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.109061577959315,"gpt":0.255256600326131,"spread":0.146195022366816,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008315321,0.0003153167,0.0003851927,0.0002017888,0.0002843332,0.0001441624,0.001157467,0.0002167542,0.000015565],"category_scores_gemma":[0.00005440654,0.0003372426,0.0001915926,0.0002536552,0.0001357894,0.0002853017,0.001860535,0.0003380184,0.000008548279],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005811869,"about_ca_system_score_gemma":0.00008664316,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003994825,"about_ca_topic_score_gemma":0.000002523485,"domain_scores_codex":[0.9979597,0.0004140616,0.0001908455,0.001068224,0.00003668218,0.0003304638],"domain_scores_gemma":[0.9983219,0.0004452228,0.0002410789,0.0006995626,0.0001357903,0.0001564291],"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.00002681316,0.00004894192,0.0002563044,0.0001393094,0.0001497376,0.00003589237,0.002288148,0.004662723,0.00006118503,0.972622,0.00004364525,0.01966532],"study_design_scores_gemma":[0.0002586141,0.00006935852,0.0001624809,0.00005687615,0.0000551984,0.00000456607,0.00007289293,0.5765606,0.001618244,0.4203781,0.0003730627,0.0003900491],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0453744,0.0002333823,0.9517533,0.00001871271,0.0006963026,0.0004043257,0.00001151924,0.0001963947,0.001311717],"genre_scores_gemma":[0.7049131,0.00007683985,0.2941855,0.00006648609,0.0001084077,0.000001150567,0.000007255269,0.00001683402,0.0006244423],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6595387,"threshold_uncertainty_score":0.999908,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1969123878","doi":"10.1007/s11228-004-7198-6","title":"Nonsmooth Analysis of Singular Values. Part II: Applications","year":2005,"lang":"en","type":"article","venue":"Set-Valued Analysis","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University; University of Waterloo","funders":"","keywords":"Mathematics; Subderivative; Lipschitz continuity; Pure mathematics; Absolute continuity; Singular value; Invariant (physics); Sign (mathematics); Mathematical analysis; Applied mathematics; Regular polygon; Convex optimization; Geometry; Eigenvalues and eigenvectors","retraction":null,"screen_n_in":null,"score":{"opus":0.01190930068803187,"gpt":0.2656462332177362,"spread":0.2537369325297043,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001003228,0.0002236649,0.0007365842,0.001544777,0.0003502768,0.000091469,0.001209448,0.00009151881,0.0004614511],"category_scores_gemma":[0.00003721371,0.0002073898,0.0009958758,0.01242864,0.000116682,0.0003276921,0.0002775113,0.0001322784,0.0000600223],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005484691,"about_ca_system_score_gemma":0.00006156209,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006325237,"about_ca_topic_score_gemma":0.00004554738,"domain_scores_codex":[0.9976043,0.0002008515,0.0006318301,0.0006604949,0.0005481516,0.0003543606],"domain_scores_gemma":[0.997509,0.0001141767,0.0003400321,0.001667553,0.0002038311,0.0001654291],"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.00002180847,0.001347999,0.005891657,0.00005139085,0.05031775,0.000020873,0.00419355,0.409573,0.0006029886,0.3395509,0.001315258,0.1871129],"study_design_scores_gemma":[0.0001961221,0.00003474394,0.001265536,0.000004825533,0.0114975,0.00000142262,0.00005920626,0.9669383,0.001323369,0.003724206,0.01462483,0.0003299157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02767007,0.0004509653,0.9685569,0.0005148888,0.00004670711,0.0001678379,0.00005574221,0.0001779541,0.002358869],"genre_scores_gemma":[0.8980683,0.0000343365,0.09898623,0.0002987366,0.0001802772,0.00005047919,0.0001174676,0.00001359213,0.002250561],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8703982,"threshold_uncertainty_score":0.8457111,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2169257454","doi":"10.13001/1081-3810.1300","title":"On the minimum rank of not necessarily symmetric matrices: A preliminary study","year":2009,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Digraph; Rank (graph theory); Zero (linguistics); Graph; Cover (algebra); Simple graph; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.010352681736522,"gpt":0.2487291321015651,"spread":0.238376450365043,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002653026,0.0001874811,0.0003760405,0.0004041253,0.0001369755,0.00006712272,0.00175737,0.00005657688,0.00002896331],"category_scores_gemma":[0.0002563855,0.0001163766,0.0002166898,0.001320531,0.00003359238,0.0003244606,0.00008055922,0.0007055778,0.00001843335],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006633291,"about_ca_system_score_gemma":0.0003340558,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002680037,"about_ca_topic_score_gemma":4.313323e-7,"domain_scores_codex":[0.9975665,0.0003642682,0.0006890356,0.0002100106,0.0006927821,0.000477363],"domain_scores_gemma":[0.9977286,0.0008174726,0.0006772495,0.0005005506,0.000193726,0.00008237748],"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.001027863,0.002529361,0.00007216207,0.00002329318,0.0003278427,0.0001396961,0.002126494,0.0005639308,0.0007058668,0.9375606,0.0009924645,0.05393047],"study_design_scores_gemma":[0.01276087,0.1215987,0.008503792,0.0004888721,0.0006691655,0.001839529,0.001927375,0.07491245,0.03835746,0.7333214,0.004006313,0.001614118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9237232,0.003323916,0.06690916,0.004197154,0.0003490821,0.0004419587,0.000001475415,0.00003980091,0.001014281],"genre_scores_gemma":[0.9980533,0.0001166821,0.0009339358,0.0004929693,0.0002258728,0.0000015368,1.797918e-7,0.000008993197,0.000166527],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2042392,"threshold_uncertainty_score":0.4745698,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1968250174","doi":"10.1137/040620047","title":"A Multipreconditioned Conjugate Gradient Algorithm","year":2006,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjugate gradient method; Preconditioner; Mathematics; Derivation of the conjugate gradient method; Conjugate residual method; Algorithm; Positive-definite matrix; Generalization; Matrix (chemical analysis); Nonlinear conjugate gradient method; Applied mathematics; Biconjugate gradient method; Linear system; Block (permutation group theory); Cholesky decomposition; Gradient method; Conjugate; Domain decomposition methods; Relation (database); Coefficient matrix; Gradient descent; Computer science; Iterative method; Combinatorics; Mathematical analysis; Eigenvalues and eigenvectors; Finite element method; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.005290628705126683,"gpt":0.2455948881573417,"spread":0.240304259452215,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000419709,0.0001470552,0.0002470867,0.0004485634,0.0005822123,0.0003833156,0.0003790319,0.00004586129,0.00007775429],"category_scores_gemma":[0.000004423522,0.0001211626,0.0002435546,0.001167454,0.00005068277,0.0002429827,0.00005094738,0.0001948487,0.00007469094],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002945117,"about_ca_system_score_gemma":0.00002187939,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002067908,"about_ca_topic_score_gemma":0.00000611439,"domain_scores_codex":[0.998769,0.00008294563,0.0003860715,0.0003123841,0.000227709,0.0002219218],"domain_scores_gemma":[0.9990438,0.000101576,0.0002413363,0.0003540169,0.0001036897,0.0001555814],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005210492,0.000473801,0.0003316345,0.000007967594,0.0004579575,0.00002177127,0.00005867282,0.003935085,0.0003247855,0.8631027,0.0006388948,0.1306415],"study_design_scores_gemma":[0.001695929,0.0002803443,0.009227598,0.00002525827,0.001034143,0.0003774857,0.0001034728,0.4200037,0.001802121,0.4193366,0.1451926,0.0009207429],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003140372,0.0003096943,0.9943689,0.000834387,0.00004692952,0.0001414731,0.00002553791,0.00006568181,0.001067024],"genre_scores_gemma":[0.8165972,0.0003718216,0.1784594,0.0004021448,0.0009424608,0.0001451855,0.00006646567,0.00001972554,0.002995601],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8159094,"threshold_uncertainty_score":0.4940869,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963458156","doi":"10.1016/j.laa.2012.11.016","title":"Fischer type determinantal inequalities for accretive–dissipative matrices","year":2012,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Dissipative system; Type (biology); Matrix (chemical analysis); Pure mathematics; Combinatorics; Mathematical analysis; Algebra over a field; Physics; Chemistry; Thermodynamics","retraction":null,"screen_n_in":null,"score":{"opus":0.02759485612494702,"gpt":0.3009326329486045,"spread":0.2733377768236575,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001804777,0.00009644755,0.0001034732,0.00004343332,0.0002016304,0.00005072821,0.0002442286,0.00004731455,0.00002677498],"category_scores_gemma":[0.00003122337,0.0000802494,0.00003185977,0.0002000567,0.0000292653,0.0004570674,0.0001021868,0.00005631559,0.00006238079],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000590918,"about_ca_system_score_gemma":0.00001798297,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001635538,"about_ca_topic_score_gemma":2.992777e-7,"domain_scores_codex":[0.99939,0.00002825779,0.0001368979,0.0001743921,0.00006897045,0.0002014651],"domain_scores_gemma":[0.9993798,0.0002061936,0.00006435122,0.0001828315,0.00007137914,0.00009540199],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000006845203,0.0000626879,0.0002242382,0.00004117901,0.000013363,1.07955e-7,0.001396904,6.341684e-7,0.0005150695,0.9784855,0.0001981108,0.01905535],"study_design_scores_gemma":[0.001384449,0.0005064942,0.006180359,0.00006783185,0.0001295114,0.00005660525,0.001476186,0.07277466,0.06541739,0.1200203,0.7304484,0.00153783],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.127544,0.00347189,0.8639867,0.000701842,0.0002371988,0.001061867,0.00009231509,0.0002101471,0.002694057],"genre_scores_gemma":[0.9588217,0.0001263613,0.0380656,0.0002129557,0.0005236958,0.0003564291,0.00002254784,0.00001294312,0.00185773],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8584652,"threshold_uncertainty_score":0.3272475,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2050959344","doi":"10.1007/s10444-011-9173-8","title":"A preconditioning technique for a class of PDE-constrained optimization problems","year":2011,"lang":"en","type":"article","venue":"Advances in Computational Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Preconditioner; Schur complement; Mathematics; Hessian matrix; Saddle point; Applied mathematics; Diagonal; Constraint (computer-aided design); Mathematical optimization; Multigrid method; Saddle; Constrained optimization; Optimization problem; Mathematical analysis; Iterative method; Eigenvalues and eigenvectors; Partial differential equation; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.02152883924757309,"gpt":0.2696847643049171,"spread":0.248155925057344,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000375468,0.00009210245,0.000161182,0.0001308846,0.00004577292,0.00001604697,0.0003045944,0.0000388695,0.00001868277],"category_scores_gemma":[0.00008481996,0.00009052498,0.00004360112,0.0002547692,0.00006234298,0.0005881363,0.00004452866,0.00005307516,0.000001336017],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001826566,"about_ca_system_score_gemma":0.00004792303,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.733747e-7,"about_ca_topic_score_gemma":8.028093e-7,"domain_scores_codex":[0.999156,0.00002719671,0.0003978211,0.0001689567,0.0001285432,0.0001214947],"domain_scores_gemma":[0.9990174,0.0004325472,0.0002530472,0.0001372893,0.0001362726,0.00002347108],"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.00000252692,0.0001013463,0.00001188071,0.0001786999,0.000004290112,3.444422e-7,0.0007584911,0.4706985,0.00001926019,0.5267884,0.000001680538,0.001434639],"study_design_scores_gemma":[0.0001640104,0.00004792157,0.000007954762,0.00009090163,0.000001942875,0.000009932954,0.00002841175,0.4967811,0.0007525157,0.5020419,0.00001365369,0.00005969365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000207575,0.00007717428,0.9963642,0.0000288496,0.00007152425,0.0005853336,0.00001061411,0.00005002509,0.002604682],"genre_scores_gemma":[0.1392041,0.000008167401,0.860548,0.00001727884,0.00001056949,0.0001844478,0.00000950958,0.000006429104,0.00001158913],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1389965,"threshold_uncertainty_score":0.3691501,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2085378537","doi":"10.1137/060661673","title":"A Preconditioner for Linear Systems Arising From Interior Point Optimization Methods","year":2007,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Preconditioner; Interior point method; Mathematics; Saddle point; Linear system; Applied mathematics; Eigenvalues and eigenvectors; Mathematical optimization; Matrix (chemical analysis); Iterated function; Condition number; Quadratic programming; Algorithm; Mathematical analysis; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.03157416437652139,"gpt":0.346956663709278,"spread":0.3153824993327566,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0107278,0.0001715216,0.0002521182,0.0004185877,0.001023332,0.00192854,0.0007800976,0.00007005836,0.00003289561],"category_scores_gemma":[0.0003166979,0.0001480784,0.0001686036,0.0005660658,0.0000648505,0.0006116258,0.0001755421,0.0003187554,0.00002089516],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001180021,"about_ca_system_score_gemma":0.00007949211,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002630906,"about_ca_topic_score_gemma":4.575685e-7,"domain_scores_codex":[0.9976252,0.0003025075,0.0007378832,0.0005135512,0.0003772707,0.0004436407],"domain_scores_gemma":[0.9974772,0.001025602,0.0005417365,0.0003954697,0.0003555835,0.0002044178],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007071536,0.0001503743,0.00003003606,0.00005364986,0.00009935597,0.00005338939,0.003921534,0.6136011,0.007519483,0.02335756,0.001316302,0.3498265],"study_design_scores_gemma":[0.0004101945,0.00008631442,0.00002913111,0.0002448923,0.000009627395,0.0001282311,0.0002264396,0.9860902,0.004574026,0.003997607,0.004013138,0.0001901409],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01227916,0.0001374578,0.9758739,0.000161979,0.01082436,0.0002403304,0.000006422286,0.0001075891,0.0003688438],"genre_scores_gemma":[0.143723,0.000001019725,0.8548165,0.0001055225,0.001003275,0.000001199987,0.000008931697,0.00001462411,0.0003259889],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3724892,"threshold_uncertainty_score":0.9991075,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2130417105","doi":"10.1007/pl00021726","title":"Optimal Stability and Eigenvalue Multiplicity","year":2001,"lang":"en","type":"article","venue":"Foundations of Computational Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"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; National Science Foundation","keywords":"Mathematics; Multiplicity (mathematics); Eigenvalues and eigenvectors; Stability (learning theory); Numerical analysis; Applied mathematics; Mathematical analysis; Physics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03108360772005937,"gpt":0.2848674620295977,"spread":0.2537838543095383,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003884665,0.00009148068,0.0001457252,0.00007740314,0.0001472981,0.00007221001,0.0002957015,0.00002978776,0.00006985653],"category_scores_gemma":[0.0001301629,0.00008865244,0.00004217991,0.0002524859,0.0001097083,0.0003412728,0.0001376704,0.00005890676,0.00002140695],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001706966,"about_ca_system_score_gemma":0.00006086554,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003764406,"about_ca_topic_score_gemma":9.426057e-7,"domain_scores_codex":[0.999117,0.00004272128,0.0003195975,0.0001726284,0.0002386364,0.000109482],"domain_scores_gemma":[0.998762,0.0005834919,0.000138605,0.0002579303,0.000202611,0.00005539064],"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.000003332408,0.0002791557,0.0002950922,0.00005955716,0.00002135538,0.000001265733,0.001291943,0.02309459,0.00007808313,0.9707465,0.00002261833,0.004106469],"study_design_scores_gemma":[0.0001690212,0.00002798632,0.001340222,0.00001091141,0.000005240016,0.00002856343,0.00006373841,0.6247653,0.0002289358,0.373117,0.000162433,0.00008063144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2920172,0.00001412946,0.7066382,0.0002095013,0.0000435701,0.0001098075,0.000005622962,0.00004830787,0.0009137112],"genre_scores_gemma":[0.5116799,0.000002993429,0.4882453,0.00001654778,0.00001372792,0.000004882092,0.000005843066,0.00000298427,0.00002782934],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6016707,"threshold_uncertainty_score":0.3615142,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2091356782","doi":"10.1090/s0025-5718-05-01748-5","title":"Algorithms for hyperbolic quadratic eigenvalue problems","year":2005,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary; University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Positive-definite matrix; Eigenvalues and eigenvectors; Mathematics; Hermitian matrix; Quadratic equation; Lambda; Matrix (chemical analysis); Pure mathematics; Mathematical analysis; Applied mathematics; Combinatorics; Geometry; Quantum mechanics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.03144884872393362,"gpt":0.2860411006219882,"spread":0.2545922518980546,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005610693,0.0001289197,0.0002365262,0.0001100179,0.00008345843,0.0000767728,0.0004290847,0.00004831364,0.000006603248],"category_scores_gemma":[0.00005701628,0.0001179648,0.00009178305,0.0002167006,0.00003276939,0.0003677329,0.00006371021,0.00005099655,0.00003525514],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000225242,"about_ca_system_score_gemma":0.00003942409,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001667826,"about_ca_topic_score_gemma":8.747042e-7,"domain_scores_codex":[0.9988902,0.00003437181,0.000453348,0.0001967986,0.0002400967,0.0001852282],"domain_scores_gemma":[0.9989641,0.0003078572,0.000251561,0.0002701526,0.0001550787,0.00005119859],"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.000003667524,0.0005562009,0.000004150697,0.0007017743,0.0000473484,6.278532e-7,0.006974253,0.06736103,0.001621763,0.6828353,0.0003852646,0.2395086],"study_design_scores_gemma":[0.0002764967,0.00008034603,0.000009687962,0.00004012856,0.000009591875,0.000008260365,0.00003438066,0.7576169,0.004058016,0.2373231,0.0004349951,0.0001081049],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01100398,0.00009461096,0.9870099,0.0003871502,0.00012698,0.0004940351,0.000003841608,0.000117191,0.0007623402],"genre_scores_gemma":[0.2774735,0.000003418077,0.7222024,0.00004584862,0.00008992627,0.00003574906,0.000005180352,0.0000111463,0.0001328404],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6902559,"threshold_uncertainty_score":0.4810464,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4235922633","doi":"10.1090/conm/638/12810","title":"A survey on preservers of spectra and local spectra","year":2015,"lang":"en","type":"other","venue":"Contemporary mathematics - American Mathematical Society","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Mathematics; Spectral line; Physics; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.03720240955803057,"gpt":0.2756778422009775,"spread":0.2384754326429469,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001851924,0.0006856653,0.001720667,0.0001400432,0.00006363293,0.0001124279,0.001441774,0.0002792393,0.0003126262],"category_scores_gemma":[0.0003117127,0.0005611831,0.0003614814,0.0006957966,0.00120149,0.0001426279,0.0005293671,0.0005181703,0.0001424559],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007430552,"about_ca_system_score_gemma":0.000326807,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001457498,"about_ca_topic_score_gemma":0.000009689525,"domain_scores_codex":[0.9965913,0.0003047024,0.0008776742,0.0007793251,0.0009523361,0.0004946928],"domain_scores_gemma":[0.9957517,0.00110564,0.001060538,0.001548819,0.0001097712,0.0004235714],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001702909,0.0009297307,0.00001819381,0.00171757,0.0004943276,0.00002715235,0.002717079,0.000002461783,0.000009711386,0.2061447,0.786743,0.00117901],"study_design_scores_gemma":[0.004493234,0.003738578,0.0002038034,0.005814108,0.0003396714,0.0001192227,0.005392545,0.1545431,0.0005681908,0.7059968,0.1132283,0.005562368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00008464896,0.0008111172,0.5011854,0.0001967977,0.0001265754,0.0008925453,0.0003017402,0.0004822902,0.495919],"genre_scores_gemma":[0.02208011,0.0004094772,0.6600677,0.0006765487,0.0005062827,0.0001113206,0.0001798908,0.001317322,0.3146514],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6735147,"threshold_uncertainty_score":0.999684,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}