{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Heinz H. Bauschke","is_ca":true},{"name":"Patrick L. Combettes","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000290271,0.0009608078,0.0008873385,0.001179123,0.0005321453,0.002327117,0.0006468003,0.000649359,0.02086128],"category_scores_gemma":[0.0009412428,0.0004216432,0.0004735484,0.002323345,0.001186579,0.002491916,0.0005703154,0.002414828,0.00658515],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009496292,"about_ca_system_score_gemma":0.0009202452,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009093791,"about_ca_topic_score_gemma":0.001669159,"domain_scores_codex":[0.9997731,0.00003224942,0.000007855226,0.00002699386,0.0001467644,0.00001311962],"domain_scores_gemma":[0.9997038,0.0001634698,0.00001453281,0.00002444152,0.00007359902,0.00001999682],"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.00001212204,0.00002338174,0.00005533531,0.0003030077,0.00001623594,0.00003831408,0.0001126327,0.002092479,0.001196318,0.7755485,0.1410512,0.07955053],"study_design_scores_gemma":[0.000009883696,0.00001780517,0.0004288372,0.0001279136,0.00001113281,0.0001429919,0.00005317729,0.005520209,0.0004605007,0.7138953,0.2793145,0.00001786822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.004310711,0.09032111,0.1536031,0.005481555,0.003126028,0.0000549137,0.0007170722,0.0005146125,0.7418709],"genre_scores_gemma":[0.07618041,0.08849159,0.1006457,0.002406008,0.007388455,0.0003415681,0.001332488,0.0008293468,0.7223845],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.02086128,"threshold_uncertainty_score":0.06978798,"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","authors":[{"name":"John C. Light","is_ca":false},{"name":"Tucker Carrington","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001308769,0.0005096928,0.0005506476,0.001258787,0.0004987243,0.003448006,0.001148328,0.0006718836,0.008423354],"category_scores_gemma":[0.006025152,0.000341871,0.0005480489,0.002182907,0.002117279,0.004318805,0.001779349,0.001828892,0.001600947],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006222243,"about_ca_system_score_gemma":0.0004375623,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008026766,"about_ca_topic_score_gemma":0.0004402723,"domain_scores_codex":[0.9988764,0.000510607,0.00006773783,0.0001681305,0.0002970552,0.00008004387],"domain_scores_gemma":[0.9980443,0.001013071,0.000122971,0.0005177567,0.0002406334,0.00006124274],"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.000006574266,0.000005092787,0.00004020357,0.00002170374,0.000002638444,0.000008615303,0.00005561272,0.001349495,0.0002184889,0.9699005,0.0008328737,0.02755798],"study_design_scores_gemma":[0.000006832819,0.0000169397,0.0001033783,0.00004052744,0.000005859287,0.00006924411,0.00005521296,0.04703328,0.0007262377,0.9360532,0.01587136,0.00001790681],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01556525,0.004093105,0.9217408,0.001223891,0.000624075,0.00003390254,0.0001690613,0.0003317008,0.05621829],"genre_scores_gemma":[0.5023555,0.009370156,0.4466786,0.0007470522,0.001317488,0.0001998665,0.0004821284,0.0005286598,0.03832055],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008423354,"threshold_uncertainty_score":0.02817893,"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","authors":[{"name":"Hakan Çiftçi","is_ca":false},{"name":"Richard L. Hall","is_ca":true},{"name":"Nasser Saad","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001251627,0.0005515784,0.0008258916,0.0009151833,0.0005773156,0.0007935676,0.001028492,0.0009417102,0.004928681],"category_scores_gemma":[0.003999482,0.0002845481,0.0007080265,0.0005948084,0.001020682,0.0009407028,0.001599149,0.001686309,0.001602148],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005654085,"about_ca_system_score_gemma":0.00117095,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00137399,"about_ca_topic_score_gemma":0.001591299,"domain_scores_codex":[0.9992927,0.0003466654,0.00002909139,0.00004342445,0.0002436963,0.00004440567],"domain_scores_gemma":[0.9987923,0.0005820213,0.00005393462,0.0001114882,0.0003786391,0.00008155558],"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.0001505605,0.0001645149,0.0008926044,0.0003061077,0.00006833221,0.0001852331,0.0002862909,0.2649226,0.01265926,0.5312358,0.007829916,0.1812989],"study_design_scores_gemma":[0.0000134427,0.00003518028,0.00008686494,0.0000185344,0.000004787095,0.00006115782,0.00001336352,0.9424222,0.0008344337,0.05272923,0.0037688,0.00001216276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003923533,0.0001760273,0.9895537,0.0001190368,0.0000816519,0.00003322834,0.00002180334,0.0002546468,0.005836261],"genre_scores_gemma":[0.2368731,0.0005904233,0.7384218,0.0002834236,0.0002274343,0.0007476348,0.0002298244,0.0006276428,0.02199872],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004928681,"threshold_uncertainty_score":0.01648808,"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","authors":[{"name":"Feng Ding","is_ca":false},{"name":"Tongwen Chen","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001063481,0.001029129,0.0007297165,0.0006818125,0.0004161609,0.0006556342,0.001067549,0.001162966,0.002071427],"category_scores_gemma":[0.003168904,0.0004054765,0.0006205613,0.000786593,0.000787964,0.001054884,0.0007945055,0.001506928,0.0008409262],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005574152,"about_ca_system_score_gemma":0.001066849,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002606215,"about_ca_topic_score_gemma":0.002667072,"domain_scores_codex":[0.9995958,0.0001264172,0.00002178994,0.00006539604,0.000160339,0.00003022243],"domain_scores_gemma":[0.999331,0.0003810306,0.00005637959,0.00005032533,0.0001644152,0.00001697645],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004332271,0.0000681692,0.0005814975,0.0003074384,0.00007546701,0.0001115027,0.0002245791,0.6305235,0.006163719,0.2074197,0.002758972,0.1517221],"study_design_scores_gemma":[0.000009530819,0.00001559859,0.0000472307,0.000009757879,0.00000421992,0.0000245017,0.000008940696,0.976334,0.0008581502,0.02067485,0.002007111,0.0000061224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001300959,0.0001461631,0.9970981,0.00004807591,0.0000168846,0.00002624643,0.000008741958,0.00009117812,0.001263672],"genre_scores_gemma":[0.08796046,0.0006076714,0.9069616,0.00008535273,0.00006978801,0.0003382951,0.00008295407,0.0001039941,0.003789958],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002606215,"threshold_uncertainty_score":0.006929636,"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","authors":[{"name":"Feng Ding","is_ca":true},{"name":"Tongwen Chen","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000630656,0.0009693506,0.0009267715,0.0004532725,0.0004786236,0.001187121,0.00119716,0.00127421,0.003783435],"category_scores_gemma":[0.003955924,0.0007042862,0.0008158152,0.000785767,0.000605716,0.001287372,0.00131313,0.0012805,0.00119858],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003939913,"about_ca_system_score_gemma":0.001587979,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002995993,"about_ca_topic_score_gemma":0.004735998,"domain_scores_codex":[0.9994105,0.0001509013,0.00003287876,0.0001051738,0.0002498241,0.00005070371],"domain_scores_gemma":[0.9988748,0.0005594385,0.0001453515,0.0001269509,0.0002605349,0.00003286167],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000168872,0.00008903497,0.0007424278,0.0002855593,0.000161898,0.0001365615,0.0006755647,0.6992423,0.03212565,0.06069344,0.002785919,0.2028928],"study_design_scores_gemma":[0.00001723594,0.00003000762,0.0001534766,0.00001285625,0.00001413363,0.00003209838,0.00003577191,0.9808944,0.005758862,0.01150146,0.001532199,0.00001747994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006289328,0.00005354255,0.9919868,0.00005519025,0.00002202068,0.00002096511,0.00002174409,0.0002183639,0.001332069],"genre_scores_gemma":[0.2471502,0.0003016708,0.7413054,0.0001031734,0.00005945902,0.000211176,0.0002244018,0.0002836761,0.0103609],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003783435,"threshold_uncertainty_score":0.01265687,"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","authors":[{"name":"Jason E. Hicken","is_ca":true},{"name":"David W. Zingg","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002924585,0.0006045705,0.0008152362,0.0003178426,0.0005915883,0.0004770558,0.0006787947,0.0005305277,0.007460329],"category_scores_gemma":[0.0009707396,0.0003197009,0.0005114811,0.0005460297,0.0003051021,0.0005824418,0.0007910712,0.0008338641,0.002039499],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004758754,"about_ca_system_score_gemma":0.002507557,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005821099,"about_ca_topic_score_gemma":0.009190545,"domain_scores_codex":[0.9997692,0.00004742328,0.00001145632,0.00002437582,0.0001236127,0.00002404068],"domain_scores_gemma":[0.9996971,0.0001131197,0.00004006171,0.00005180491,0.00008169636,0.0000162002],"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.000173748,0.0001290052,0.001856126,0.0002866499,0.00007495212,0.0002928322,0.000262626,0.6987747,0.02754545,0.07471061,0.007488136,0.1884051],"study_design_scores_gemma":[0.000023506,0.00001833113,0.0001217291,0.000004535671,0.000005048286,0.00004397065,0.00001372506,0.9884476,0.003413837,0.003575949,0.004326121,0.00000555792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02028782,0.00008867546,0.9677472,0.0001107232,0.0000477058,0.00007090472,0.0001668818,0.0008486132,0.01063139],"genre_scores_gemma":[0.2277091,0.0002082035,0.7509264,0.00005935677,0.00005140904,0.0003489869,0.0005812886,0.0003891068,0.01972616],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007460329,"threshold_uncertainty_score":0.0249573,"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","authors":[{"name":"William McCuaig","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001051207,0.0005519274,0.00135781,0.0006145212,0.002399495,0.004110656,0.001556549,0.001987115,0.02976206],"category_scores_gemma":[0.007964662,0.0005742397,0.0008912041,0.001291919,0.002262318,0.00618673,0.00254262,0.003688105,0.00480897],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001431838,"about_ca_system_score_gemma":0.002157921,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001693818,"about_ca_topic_score_gemma":0.001738288,"domain_scores_codex":[0.9988928,0.0002082526,0.00005313413,0.0004152035,0.0001786908,0.000251923],"domain_scores_gemma":[0.9964485,0.00203037,0.0002215024,0.000755378,0.0003119895,0.0002322395],"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.0001710391,0.00006507681,0.000336434,0.0001357724,0.00002245158,0.00009211453,0.0001205729,0.01096262,0.0005224669,0.9223806,0.02759467,0.03759609],"study_design_scores_gemma":[0.00005406238,0.00002060198,0.0001378707,0.00002206319,0.00001027321,0.00006374755,0.00008098537,0.02258317,0.0005526827,0.96441,0.0120514,0.00001314113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1559086,0.00233223,0.5329973,0.02009629,0.001513601,0.0002417628,0.004870184,0.002014332,0.2800258],"genre_scores_gemma":[0.7985178,0.001817646,0.09164168,0.001846742,0.0008830068,0.0003834738,0.003475276,0.0007571083,0.1006773],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02976206,"threshold_uncertainty_score":0.09956402,"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","authors":[{"name":"Amirhossein Amiraslani","is_ca":true},{"name":"Robert M. Corless","is_ca":true},{"name":"Peter Lancaster","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005933574,0.0005013396,0.0003039559,0.0005975059,0.0003257186,0.0008693819,0.000583995,0.0003427493,0.00538189],"category_scores_gemma":[0.001749416,0.0002156673,0.0003969888,0.0004474481,0.001080939,0.001413216,0.001132283,0.001051624,0.001746498],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005189793,"about_ca_system_score_gemma":0.0004017226,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006650086,"about_ca_topic_score_gemma":0.0004137831,"domain_scores_codex":[0.9995833,0.0001132131,0.00001496624,0.00005684025,0.0001574153,0.0000741969],"domain_scores_gemma":[0.9996533,0.000106841,0.00006138314,0.00005889421,0.00008380772,0.0000357831],"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.00004870805,0.00002662851,0.0002300508,0.00007771092,0.00001199867,0.000156639,0.0004345025,0.0215865,0.01668185,0.9402307,0.001185507,0.01932898],"study_design_scores_gemma":[0.00002047022,0.0001996521,0.000392539,0.00004963216,0.00001362035,0.0003019971,0.0004325045,0.1857262,0.01900896,0.7825263,0.01126909,0.00005912898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1630129,0.0003634503,0.7946829,0.0004375923,0.0001388636,0.00005882243,0.0001607626,0.0004972403,0.04064745],"genre_scores_gemma":[0.9240919,0.0006265638,0.05450385,0.0002107067,0.0001379656,0.00005947404,0.0001977974,0.0001929226,0.01997876],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00538189,"threshold_uncertainty_score":0.01800418,"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","authors":[{"name":"H. Windcliff","is_ca":true},{"name":"Peter Forsyth","is_ca":true},{"name":"K.R. Vetzal","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002527309,0.0005649318,0.0007683992,0.0008447454,0.0007351604,0.001513903,0.0007148672,0.001353829,0.003255082],"category_scores_gemma":[0.01649904,0.0002970072,0.0005712925,0.0002437448,0.003157186,0.001396778,0.001676236,0.001728537,0.0002838874],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000954567,"about_ca_system_score_gemma":0.001225498,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004229699,"about_ca_topic_score_gemma":0.001304676,"domain_scores_codex":[0.9993573,0.0003042205,0.00002577978,0.00006190525,0.0001842638,0.00006661408],"domain_scores_gemma":[0.9884531,0.008536601,0.00110491,0.0003301571,0.001202258,0.0003729283],"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.0005158816,0.0001605908,0.004325851,0.0002290255,0.0000950319,0.00050405,0.0003993193,0.6662417,0.02650681,0.2858145,0.001793608,0.01341361],"study_design_scores_gemma":[0.0000186539,0.00001957367,0.0001653701,0.000007013281,0.000003676977,0.00001115701,0.00001394848,0.9914967,0.0009643245,0.007188322,0.0001034358,0.000007730288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.5153573,0.0006585936,0.4649532,0.002141352,0.0001332453,0.0001409186,0.0001415202,0.0003218985,0.01615192],"genre_scores_gemma":[0.9810902,0.0001485272,0.01525993,0.0001083008,0.00005180859,0.00008066825,0.00007366956,0.0000563998,0.003130404],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.004229699,"threshold_uncertainty_score":0.01336586,"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","authors":[{"name":"Adrian S. Lewis","is_ca":true},{"name":"Hristo S. Sendov","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001062762,0.0007112286,0.0008781119,0.001501109,0.0004147925,0.001674751,0.0007711561,0.0006615499,0.004556468],"category_scores_gemma":[0.004876889,0.0003218751,0.0005959563,0.001491177,0.002086928,0.001809019,0.001003391,0.001944277,0.001080979],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005446876,"about_ca_system_score_gemma":0.0003150735,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005302439,"about_ca_topic_score_gemma":0.0003936118,"domain_scores_codex":[0.9994462,0.0001493853,0.00003610934,0.00008991655,0.0002502224,0.00002814656],"domain_scores_gemma":[0.9981562,0.001120149,0.0001675408,0.0002041885,0.0002871945,0.00006458251],"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.00003162,0.00004699753,0.0005736277,0.0005711826,0.00008331126,0.0001068953,0.0002740261,0.01536022,0.005055749,0.8700078,0.01342382,0.09446476],"study_design_scores_gemma":[0.000005710898,0.00004368897,0.0007387217,0.00008507854,0.00003181057,0.0001732325,0.00006581047,0.1078447,0.001384726,0.8764825,0.01312656,0.0000174897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01054688,0.02224435,0.9514882,0.0009645695,0.0007742558,0.00002765475,0.0001876838,0.0001654067,0.01360096],"genre_scores_gemma":[0.6978009,0.04386168,0.214662,0.001425007,0.005071548,0.0003497583,0.0007801427,0.0004426751,0.03560625],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004556468,"threshold_uncertainty_score":0.01524293,"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","authors":[{"name":"Yongge Tian","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01029103,0.004408669,0.002996253,0.007587485,0.002479065,0.0101066,0.005256542,0.003259906,0.01535911],"category_scores_gemma":[0.06453818,0.001795075,0.002877031,0.005212601,0.007321471,0.01776413,0.008425928,0.01002072,0.006363972],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002227349,"about_ca_system_score_gemma":0.002219475,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007763145,"about_ca_topic_score_gemma":0.0016953,"domain_scores_codex":[0.9832864,0.004854688,0.0008579204,0.00210638,0.006415519,0.002479095],"domain_scores_gemma":[0.9309817,0.04706066,0.003321214,0.009150415,0.007127451,0.002358523],"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.000451103,0.0002958031,0.0009926241,0.0005848875,0.0001097055,0.0002304429,0.0006755394,0.03685272,0.005745725,0.8434626,0.009195023,0.1014038],"study_design_scores_gemma":[0.00003129193,0.0001339696,0.0004478566,0.0001569737,0.00009372985,0.0002853657,0.0001559697,0.1356726,0.006239814,0.8500007,0.006645977,0.0001358362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03021468,0.004595113,0.927488,0.001882341,0.0005977682,0.0001492816,0.0005141065,0.001660736,0.03289787],"genre_scores_gemma":[0.5373285,0.006919373,0.4179072,0.001362737,0.004179215,0.0005806457,0.001375916,0.002233287,0.02811303],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01535911,"threshold_uncertainty_score":0.05442482,"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","authors":[{"name":"Gene H. Golub","is_ca":false},{"name":"Chen Greif","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009351884,0.001025212,0.00113026,0.001913921,0.001094575,0.002011827,0.001656988,0.001130504,0.01004145],"category_scores_gemma":[0.006898459,0.0005708946,0.0007342194,0.002180228,0.001015388,0.002815618,0.001875257,0.002406227,0.006599997],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007301327,"about_ca_system_score_gemma":0.001552953,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001404626,"about_ca_topic_score_gemma":0.003034096,"domain_scores_codex":[0.9990101,0.0002078106,0.00007306118,0.0001416318,0.0004905374,0.00007685079],"domain_scores_gemma":[0.99795,0.0005810554,0.00009760789,0.0005459865,0.0007123519,0.0001130105],"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.0004094196,0.0002076796,0.0008993897,0.0002980821,0.0000968286,0.000155895,0.0002394428,0.0562919,0.02075265,0.21986,0.02296451,0.6778241],"study_design_scores_gemma":[0.0001180465,0.0001592128,0.0003429885,0.00004416098,0.00004387059,0.0002289374,0.00007843663,0.7189972,0.019807,0.2399614,0.02013121,0.00008748654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003178275,0.000130748,0.9907089,0.0001499098,0.0001740882,0.0000609932,0.0001041339,0.00176719,0.003725752],"genre_scores_gemma":[0.06108914,0.0002143368,0.9283003,0.0001470139,0.0001696964,0.0002023393,0.000375644,0.0005387484,0.008962791],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01004145,"threshold_uncertainty_score":0.03359199,"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","authors":[{"name":"Edmond Chow","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001048799,0.0006999613,0.0006284353,0.0004183037,0.0007365299,0.0006388111,0.001108168,0.0008121363,0.002403513],"category_scores_gemma":[0.005778145,0.0003338213,0.0003504,0.0005111273,0.0008410977,0.0009606563,0.0009406203,0.0007635134,0.0006335733],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005260219,"about_ca_system_score_gemma":0.001113293,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003404794,"about_ca_topic_score_gemma":0.003749315,"domain_scores_codex":[0.9991891,0.0002337104,0.00002959851,0.00007673697,0.0003753316,0.00009557814],"domain_scores_gemma":[0.9977906,0.00118765,0.0001459141,0.000483573,0.0003269661,0.00006527439],"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.0004835251,0.0003414672,0.002692414,0.0002763367,0.00005693575,0.0004493017,0.0005267678,0.6102651,0.04503473,0.04425783,0.004679383,0.2909362],"study_design_scores_gemma":[0.00008010009,0.0001186158,0.0002653316,0.0000103978,0.00001240641,0.0001014022,0.0000470881,0.9586243,0.02711765,0.009099077,0.004510674,0.00001292866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0805883,0.0001206326,0.9077278,0.0003249224,0.00003423865,0.0001287059,0.00005370451,0.00275836,0.008263336],"genre_scores_gemma":[0.429456,0.0001586271,0.5668349,0.00004942809,0.00002984031,0.0001846506,0.0001551184,0.0003509172,0.002780493],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003404794,"threshold_uncertainty_score":0.008040607,"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","authors":[{"name":"Heinz H. Bauschke","is_ca":true},{"name":"Osman Güler","is_ca":false},{"name":"Adrian S. Lewis","is_ca":true},{"name":"Hristo S. Sendov","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001114197,0.0005492904,0.0004506873,0.001124609,0.0005225913,0.001080227,0.0004843124,0.0003172773,0.004700484],"category_scores_gemma":[0.00320978,0.0001856324,0.0004049894,0.0008997516,0.00286914,0.001533192,0.00157239,0.001557234,0.0005240042],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00146204,"about_ca_system_score_gemma":0.0004561221,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002270885,"about_ca_topic_score_gemma":0.001573284,"domain_scores_codex":[0.9995044,0.0001846176,0.00001550946,0.00008075064,0.0001437044,0.00007095641],"domain_scores_gemma":[0.9989918,0.0004172546,0.0001503466,0.00008233452,0.0002323292,0.000125931],"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.00001066413,0.000004341273,0.0001721428,0.0000190274,0.000006337501,0.00002601264,0.00005531012,0.008479042,0.000461191,0.9838644,0.001104318,0.005797203],"study_design_scores_gemma":[0.000006749487,0.00001525985,0.0003311033,0.00001574625,0.000004753869,0.00004085633,0.00008034075,0.1067071,0.0004739421,0.8870415,0.005274657,0.000008036982],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1735104,0.004266699,0.72889,0.003701049,0.0003125708,0.00006327392,0.0004153761,0.000139624,0.08870105],"genre_scores_gemma":[0.9354357,0.00167954,0.04330616,0.000240309,0.0004691361,0.00004273185,0.0002224463,0.00007647116,0.0185276],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004700484,"threshold_uncertainty_score":0.01572466,"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","authors":[],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001667677,0.0005514749,0.00113496,0.0009833726,0.004722007,0.00651837,0.000780353,0.002888927,0.01342677],"category_scores_gemma":[0.008230374,0.0005488829,0.0005988717,0.001285967,0.00884414,0.01190075,0.003638631,0.004582822,0.004978118],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001311689,"about_ca_system_score_gemma":0.0009107579,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000798671,"about_ca_topic_score_gemma":0.0007017576,"domain_scores_codex":[0.9988149,0.0002141633,0.00006325754,0.0003292647,0.0002977131,0.000280752],"domain_scores_gemma":[0.9958269,0.001852255,0.0004428943,0.0006191484,0.0007966515,0.000462123],"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.000105833,0.00001920273,0.0007787989,0.00007058059,0.00001250886,0.0001603174,0.000552886,0.0003239355,0.000492431,0.9791188,0.009378407,0.008986212],"study_design_scores_gemma":[0.00002473024,0.00002118693,0.000228717,0.00005368385,0.000007357174,0.0001147877,0.0003050885,0.0008169642,0.0005449932,0.9780777,0.01978258,0.00002224614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.3148532,0.01377762,0.08447418,0.121362,0.008608962,0.00005563643,0.001103953,0.0009722362,0.4547922],"genre_scores_gemma":[0.9603646,0.002327493,0.004767433,0.005932278,0.002526559,0.00004247285,0.0006470049,0.00009969015,0.02329248],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01342677,"threshold_uncertainty_score":0.04491705,"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)","authors":[{"name":"J. William Helton","is_ca":false},{"name":"Reza Rashidi Far","is_ca":true},{"name":"Roland Speicher","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009532879,0.0005697881,0.0005462325,0.0002872284,0.0003802927,0.0007876337,0.0009948142,0.001070688,0.003432718],"category_scores_gemma":[0.004861353,0.0002859923,0.0003053571,0.0004822352,0.001377124,0.001170835,0.001247281,0.001065075,0.0004098559],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004096495,"about_ca_system_score_gemma":0.0007956655,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001641325,"about_ca_topic_score_gemma":0.001523733,"domain_scores_codex":[0.9996567,0.0001362501,0.00001136635,0.00003774746,0.0001177955,0.0000402682],"domain_scores_gemma":[0.9986286,0.001010818,0.00008460599,0.00007007465,0.0001335779,0.0000722996],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001078903,0.00007748293,0.0004010111,0.0001885181,0.00002496741,0.0002092059,0.0003365143,0.4981888,0.007444049,0.4677262,0.001663777,0.02363157],"study_design_scores_gemma":[0.00001355419,0.00001776744,0.00002603803,0.000005124939,0.000001988594,0.00001732847,0.00001787507,0.9381379,0.0007960843,0.060459,0.0005020096,0.0000053261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03463972,0.00009308948,0.9571604,0.0003605389,0.00004707811,0.00003093249,0.00002649846,0.00008197322,0.007559819],"genre_scores_gemma":[0.6804838,0.0002850477,0.3006323,0.0002521167,0.0001059678,0.0001991097,0.0001004214,0.000191592,0.01774959],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003432718,"threshold_uncertainty_score":0.01148361,"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","authors":[{"name":"Shi-Wei Huang","is_ca":true},{"name":"Tucker Carrington","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007664516,0.0006705432,0.0007189274,0.0007248354,0.0007551666,0.0007912514,0.001987634,0.001108269,0.006360611],"category_scores_gemma":[0.001917346,0.0004265464,0.0009431788,0.0008132856,0.0006265481,0.001482566,0.001214838,0.001381696,0.002314232],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003542156,"about_ca_system_score_gemma":0.001224246,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00159236,"about_ca_topic_score_gemma":0.002649369,"domain_scores_codex":[0.9992574,0.0001483741,0.00003402094,0.00006817215,0.0004471775,0.00004476995],"domain_scores_gemma":[0.999369,0.0001941857,0.00003790771,0.0000884519,0.0002668065,0.00004364428],"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.0001202959,0.0001864113,0.0008508666,0.0005969608,0.0001854143,0.0003946981,0.0004217803,0.2448934,0.04985807,0.2292704,0.01873857,0.4544832],"study_design_scores_gemma":[0.00003851207,0.00005678118,0.0001482686,0.0000315946,0.00002685355,0.0002366686,0.00002368692,0.9304768,0.007117369,0.0330728,0.02872798,0.00004258611],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0009803639,0.00006730125,0.9965813,0.00004829411,0.00006034893,0.00003446543,0.00002914957,0.0001888203,0.002010061],"genre_scores_gemma":[0.01587444,0.0001561833,0.9776931,0.00008448535,0.00004606365,0.0002231106,0.000108524,0.000213458,0.005600563],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006360611,"threshold_uncertainty_score":0.02127838,"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","authors":[{"name":"Michael J. Tsatsomeros","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001483142,0.0006812694,0.0008598476,0.001654823,0.000976363,0.003062737,0.0008716294,0.0009054668,0.005268494],"category_scores_gemma":[0.0106083,0.0005121122,0.0005798828,0.00316476,0.003449061,0.004238151,0.001771876,0.001969038,0.002169436],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003419019,"about_ca_system_score_gemma":0.0007583982,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003437179,"about_ca_topic_score_gemma":0.0003550966,"domain_scores_codex":[0.9991407,0.0002066324,0.00004076244,0.0002048173,0.0003021194,0.0001048238],"domain_scores_gemma":[0.9944818,0.002631627,0.0006491356,0.00110736,0.000807545,0.000322481],"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.0002537341,0.00008646189,0.0009087952,0.00007104413,0.00001359236,0.0001665288,0.0002523689,0.004371502,0.007488201,0.912492,0.002386954,0.07150875],"study_design_scores_gemma":[0.00004621833,0.0001286235,0.0005144429,0.00002778062,0.00002551472,0.0009206214,0.0001640781,0.07187493,0.01620209,0.9036736,0.006377306,0.00004478665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09965061,0.001351885,0.8758356,0.0004226272,0.0002023674,0.00004707583,0.0001607222,0.000610257,0.02171894],"genre_scores_gemma":[0.8107091,0.002689754,0.1669777,0.0002418754,0.0007724931,0.00009830444,0.0004131803,0.000647901,0.01744976],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005268494,"threshold_uncertainty_score":0.01762486,"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","authors":[{"name":"Adrian S. Lewis","is_ca":true},{"name":"Hristo S. Sendov","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007979552960835083,"gpt":0.2555741821285429,"spread":0.2475946291677078,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000947605,0.0009845054,0.0005379859,0.001621324,0.0005549669,0.001624925,0.0006803588,0.001410759,0.006295066],"category_scores_gemma":[0.004225913,0.0002896214,0.0005115431,0.0007420056,0.001770443,0.003359496,0.001182405,0.001593597,0.001848411],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000777539,"about_ca_system_score_gemma":0.0004852578,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006488421,"about_ca_topic_score_gemma":0.0004423977,"domain_scores_codex":[0.9993781,0.0001230221,0.00003181411,0.0001309812,0.0002231259,0.0001129013],"domain_scores_gemma":[0.9980183,0.0005927614,0.000205857,0.0002461479,0.0006656294,0.0002713714],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006183396,0.00003036464,0.0007083761,0.00007106004,0.00001309701,0.0003887135,0.0002639531,0.01145243,0.01528821,0.9336768,0.003508626,0.03453657],"study_design_scores_gemma":[0.00001781822,0.00006912994,0.001079399,0.00004245468,0.00001016305,0.0006782418,0.0002095744,0.1824045,0.007574796,0.7975833,0.01027384,0.0000568087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.123481,0.0009330405,0.8360401,0.001107378,0.000298274,0.00005190917,0.0003578506,0.0005567973,0.03717357],"genre_scores_gemma":[0.8667603,0.001212605,0.09469093,0.0004514528,0.0003441129,0.0001360804,0.0004146569,0.0004868926,0.03550298],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006295066,"threshold_uncertainty_score":0.02105904,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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","authors":[{"name":"James V. Burke","is_ca":false},{"name":"Adrian S. Lewis","is_ca":true},{"name":"Michael L. Overton","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03626934322608164,"gpt":0.3461622929148682,"spread":0.3098929496887866,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002324517,0.001101213,0.001053326,0.00122936,0.0008062887,0.001253232,0.001405094,0.00192504,0.003853943],"category_scores_gemma":[0.009768385,0.0005001673,0.000776536,0.001090744,0.001493811,0.001834454,0.001903528,0.001806484,0.0007860332],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009154332,"about_ca_system_score_gemma":0.001236453,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001626345,"about_ca_topic_score_gemma":0.002525341,"domain_scores_codex":[0.9988093,0.0004321059,0.00006077973,0.0001354084,0.0005007174,0.00006170155],"domain_scores_gemma":[0.9969249,0.001496151,0.0002717233,0.0004112505,0.0007362021,0.000159742],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000280946,0.0002395763,0.0006709986,0.0003300216,0.00008777461,0.00005875138,0.0002327402,0.4429901,0.01286669,0.2091063,0.004747774,0.3283883],"study_design_scores_gemma":[0.00003169871,0.00005552976,0.0001225427,0.00001556319,0.0000127768,0.0000257971,0.00001155971,0.9733387,0.003071524,0.02029298,0.002999678,0.00002159259],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002390123,0.0002154974,0.9952652,0.0001662377,0.0001359216,0.00003117699,0.00001607228,0.000146995,0.001632825],"genre_scores_gemma":[0.1179168,0.0003716532,0.8722101,0.0001886437,0.0002551007,0.0003130731,0.00007221811,0.0003382465,0.008334131],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003853943,"threshold_uncertainty_score":0.01289272,"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","authors":[{"name":"Heinz H. Bauschke","is_ca":true},{"name":"Frank Deutsch","is_ca":false},{"name":"Hein Hundal","is_ca":false},{"name":"Sung-Ho Park","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002521868,0.0008373508,0.0007047447,0.0006767355,0.0005461198,0.0008281936,0.0009571375,0.0008717107,0.00190351],"category_scores_gemma":[0.00919749,0.0004542166,0.0006122461,0.0004814904,0.001428655,0.0017706,0.002044419,0.001602784,0.0006562374],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004722945,"about_ca_system_score_gemma":0.001184234,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00114459,"about_ca_topic_score_gemma":0.0008612724,"domain_scores_codex":[0.9985484,0.0007102196,0.00004682539,0.000108822,0.0004952853,0.00009045451],"domain_scores_gemma":[0.9970906,0.00172086,0.0001586459,0.0003976307,0.0005362801,0.00009585889],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003975191,0.0001002848,0.001296976,0.000219852,0.0001245106,0.0002095857,0.0004280316,0.4924116,0.02128343,0.3428145,0.002410603,0.1383032],"study_design_scores_gemma":[0.00002237248,0.00005476653,0.00009476073,0.00001222238,0.000007229357,0.00006369293,0.00001815165,0.9517756,0.004967606,0.04072019,0.002249276,0.0000142227],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02044344,0.0001732775,0.9762872,0.0001083572,0.00005524007,0.00004028017,0.00001174992,0.0001955967,0.002684828],"genre_scores_gemma":[0.2648149,0.0003892757,0.7301229,0.0001024115,0.00008522513,0.0002559881,0.00006052428,0.0001601242,0.004008587],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002521868,"threshold_uncertainty_score":0.01333708,"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","authors":[{"name":"Jianlong Chen","is_ca":false},{"name":"Huihui Zhu","is_ca":false},{"name":"Pedro Patrı́cio","is_ca":false},{"name":"Yulin Zhang","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008773624,0.0004203724,0.0003670338,0.001449287,0.0005475818,0.002070985,0.0005892579,0.0005499298,0.006883077],"category_scores_gemma":[0.002377687,0.0002189586,0.0004818238,0.0005745107,0.002088761,0.003144306,0.001632648,0.00164126,0.0009225045],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004439532,"about_ca_system_score_gemma":0.0002676331,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002270105,"about_ca_topic_score_gemma":0.0001890864,"domain_scores_codex":[0.9990932,0.0001542781,0.00006894888,0.0002318813,0.0003030061,0.0001486715],"domain_scores_gemma":[0.9985315,0.0003849326,0.0002144761,0.0002660463,0.0004280655,0.0001750558],"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.00003288531,0.0000273958,0.0002950924,0.00002700443,0.000004126161,0.0001072204,0.0003342981,0.0004938526,0.003491443,0.9851959,0.0004641694,0.00952665],"study_design_scores_gemma":[0.000016157,0.00007729033,0.0004009354,0.00002507795,0.00001192472,0.0005504371,0.0003597378,0.01423232,0.007982478,0.9654947,0.01081851,0.00003040544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.4674342,0.0005307366,0.4215862,0.0006055537,0.0002254133,0.00008338129,0.0002540832,0.0003968764,0.1088836],"genre_scores_gemma":[0.9604885,0.0001869317,0.02580665,0.000136589,0.0001601183,0.00004389341,0.0001916893,0.00008973387,0.01289588],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.006883077,"threshold_uncertainty_score":0.02302623,"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)","authors":[{"name":"Di‐Rong Chen","is_ca":false},{"name":"Rong-Qing Jia","is_ca":true},{"name":"S. D. Riemenschneider","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003268872,0.0007394447,0.0008596232,0.00172368,0.0006413,0.001910002,0.001146644,0.001290722,0.003163316],"category_scores_gemma":[0.01221559,0.0004797463,0.0005261638,0.001031733,0.002289663,0.002068389,0.003278898,0.001659176,0.0004213521],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001466817,"about_ca_system_score_gemma":0.0008969667,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004010071,"about_ca_topic_score_gemma":0.002165735,"domain_scores_codex":[0.9990599,0.0004503606,0.00004696648,0.00006161747,0.000287252,0.00009400919],"domain_scores_gemma":[0.9947276,0.003199964,0.0003596222,0.0002868064,0.001087899,0.0003381813],"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.0003482004,0.0001041294,0.001139171,0.0002346941,0.00003942563,0.00007249285,0.0007320101,0.1670201,0.01096435,0.7591074,0.001795791,0.05844226],"study_design_scores_gemma":[0.00001812613,0.0000512533,0.000241963,0.00003226472,0.000007357275,0.00003737501,0.00007306138,0.8411016,0.001483219,0.1547341,0.002204813,0.00001486653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1658582,0.002199832,0.8135318,0.0007733855,0.0003018238,0.0001025968,0.00006992151,0.0001871411,0.01697549],"genre_scores_gemma":[0.8120872,0.001969671,0.1533294,0.0002375029,0.0001595546,0.0002037492,0.0001986458,0.0003226391,0.03149153],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004010071,"threshold_uncertainty_score":0.01728761,"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","authors":[{"name":"JohnH. Drew","is_ca":true},{"name":"Charles R. Johnson","is_ca":true},{"name":"D.D. Olesky","is_ca":true},{"name":"Peter Vandendriessche","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004440264,0.0005715505,0.0006737813,0.001318934,0.001833698,0.002443923,0.0009218064,0.001213602,0.0236508],"category_scores_gemma":[0.003300151,0.0004100511,0.0005394634,0.001065774,0.002150745,0.004218864,0.002423474,0.001834581,0.005028266],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004537353,"about_ca_system_score_gemma":0.0004137572,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002831293,"about_ca_topic_score_gemma":0.0003616626,"domain_scores_codex":[0.9992036,0.0001575786,0.00003970283,0.0002225016,0.0002309671,0.0001456623],"domain_scores_gemma":[0.9988397,0.0002180368,0.0001185284,0.0004110789,0.0002605674,0.0001522446],"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.00003495829,0.00001789695,0.0001471706,0.00002472681,0.000004412368,0.00005814773,0.00009367367,0.0002446358,0.001881463,0.9846426,0.003317043,0.009533439],"study_design_scores_gemma":[0.000007568824,0.000009971827,0.0001673293,0.000008802977,0.000003630824,0.0002334832,0.00009534537,0.002564857,0.001323986,0.9868488,0.008726885,0.000009283975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2228098,0.0008658268,0.3622729,0.003976957,0.001867791,0.000126762,0.0008356881,0.001302994,0.4059412],"genre_scores_gemma":[0.8117189,0.0006137383,0.05284498,0.001732426,0.0008150854,0.0001696335,0.0008389608,0.0006563191,0.13061],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0236508,"threshold_uncertainty_score":0.0791198,"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","authors":[{"name":"Heng Lian","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005878585,0.0008370186,0.0009809004,0.0008063802,0.0003143582,0.001261308,0.001668323,0.001835494,0.003265802],"category_scores_gemma":[0.01063948,0.000414599,0.001296737,0.0005674606,0.002236756,0.001947336,0.001743547,0.001772926,0.0005772331],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00139694,"about_ca_system_score_gemma":0.0007092367,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003094517,"about_ca_topic_score_gemma":0.001786059,"domain_scores_codex":[0.9974684,0.001645276,0.00007379192,0.0002333017,0.0004174772,0.0001617694],"domain_scores_gemma":[0.9953468,0.003195798,0.0004497594,0.0002998998,0.0005622039,0.0001456188],"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.00004261142,0.00006486483,0.0005289266,0.0001028208,0.00006976989,0.000120567,0.0002124004,0.3004163,0.002458376,0.6826713,0.001151029,0.01216098],"study_design_scores_gemma":[0.000005524118,0.00001811687,0.0001471132,0.000008277323,0.000005530839,0.00002339289,0.00001224409,0.9072731,0.0001840238,0.09176775,0.0005440386,0.00001095302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01357597,0.0002464692,0.9831368,0.0005687007,0.00004887456,0.00002979342,0.00004433352,0.0000774597,0.002271585],"genre_scores_gemma":[0.8045563,0.0007330847,0.1757755,0.0004643308,0.0002029821,0.0003644025,0.0002195178,0.0001617148,0.01752229],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005878585,"threshold_uncertainty_score":0.03108931,"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","authors":[{"name":"Robert König","is_ca":true},{"name":"Graeme Smith","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003670855,0.0009188906,0.00106183,0.001623091,0.001367309,0.003207831,0.001566857,0.001556718,0.01048408],"category_scores_gemma":[0.01853777,0.0004656106,0.001102281,0.001261681,0.00542022,0.008016937,0.003877306,0.004293346,0.001386683],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002735337,"about_ca_system_score_gemma":0.001219993,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001909749,"about_ca_topic_score_gemma":0.0008008841,"domain_scores_codex":[0.9959183,0.00112656,0.0001981772,0.0006199154,0.001539927,0.0005971555],"domain_scores_gemma":[0.9884497,0.008779848,0.0004820216,0.0008694201,0.001039931,0.0003789902],"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.00002888514,0.000009329532,0.000185764,0.00006131783,0.00001025496,0.00009311608,0.00009879041,0.004838098,0.0009426004,0.9854521,0.001725469,0.006554291],"study_design_scores_gemma":[0.000007256779,0.000009960246,0.0001772778,0.00001473706,0.0000029526,0.0000357536,0.00001246679,0.03043275,0.0003274741,0.9673899,0.001578754,0.00001071364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08756595,0.005612079,0.6641608,0.009407498,0.0008914386,0.0001577472,0.001149579,0.0002606287,0.2307943],"genre_scores_gemma":[0.9077651,0.003518976,0.05515077,0.001909244,0.002724695,0.0004663607,0.0007720322,0.0002980031,0.02739482],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01048408,"threshold_uncertainty_score":0.03507268,"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","authors":[{"name":"Chen Li","is_ca":false},{"name":"Wayne Eberly","is_ca":true},{"name":"Erich Kaltofen","is_ca":false},{"name":"B. David Saunders","is_ca":false},{"name":"William J. Turner","is_ca":false},{"name":"Gilles Villard","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009483795,0.0009522352,0.001266144,0.0005533,0.0009956544,0.00122669,0.001324259,0.001004723,0.01657108],"category_scores_gemma":[0.003670656,0.0005458042,0.000544405,0.001084539,0.0009612317,0.00235414,0.001957894,0.002695058,0.004367729],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004917193,"about_ca_system_score_gemma":0.001297141,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001842663,"about_ca_topic_score_gemma":0.004684907,"domain_scores_codex":[0.9991302,0.0002306662,0.00003522773,0.00007713554,0.0004158633,0.0001108407],"domain_scores_gemma":[0.9987876,0.0004839831,0.00008938876,0.0003300057,0.0002344512,0.00007464793],"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.0009993637,0.0002490805,0.0003506938,0.0003249632,0.00009709352,0.0001588074,0.0002890476,0.1994828,0.0221632,0.3845066,0.04054424,0.3508342],"study_design_scores_gemma":[0.0001454933,0.00006279612,0.00009709695,0.00002555283,0.00001621777,0.00003350308,0.00004128931,0.7428606,0.01108369,0.2306002,0.01501077,0.000022891],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008324414,0.0001543962,0.982685,0.0002892444,0.0001708456,0.00005582555,0.0001497668,0.001782776,0.006387827],"genre_scores_gemma":[0.1673327,0.0003416124,0.807866,0.0002539311,0.0002493001,0.0003779765,0.0005025718,0.001162892,0.02191294],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01657108,"threshold_uncertainty_score":0.05543578,"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","authors":[{"name":"Yongge Tian","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001293913,0.0007559587,0.0006180492,0.002153318,0.001668756,0.004226798,0.001203397,0.0008495694,0.008052053],"category_scores_gemma":[0.007675522,0.0004230911,0.0007556112,0.001251027,0.002632767,0.003602162,0.001451871,0.00181394,0.001175773],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008595015,"about_ca_system_score_gemma":0.0008721473,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005465796,"about_ca_topic_score_gemma":0.0007042479,"domain_scores_codex":[0.9983755,0.0003814254,0.0001263507,0.0002645097,0.0004746798,0.0003774306],"domain_scores_gemma":[0.9958975,0.001845166,0.0006088861,0.0003316275,0.0007684797,0.000548284],"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.0001903978,0.00005246247,0.001090796,0.0001091728,0.00002009557,0.0003596268,0.001280446,0.00162835,0.006747973,0.9688498,0.002260613,0.01741023],"study_design_scores_gemma":[0.00002052193,0.0001004122,0.001300857,0.00003354769,0.00003000607,0.000716992,0.000661827,0.009706273,0.00465659,0.9780965,0.004601929,0.00007451617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7479477,0.001005584,0.1716492,0.001512126,0.0003449,0.00007663055,0.0007118198,0.0005655275,0.07618649],"genre_scores_gemma":[0.9595304,0.0003655165,0.02479857,0.0001589283,0.000329083,0.0000603678,0.0002989362,0.0001710123,0.01428719],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008052053,"threshold_uncertainty_score":0.02693677,"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","authors":[{"name":"H.A. van der Vorst","is_ca":true},{"name":"Qiang Ye","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003722225,0.001071332,0.0009671767,0.0006075097,0.0004533352,0.0009093657,0.001444188,0.001009104,0.00152191],"category_scores_gemma":[0.01145457,0.0003718885,0.0005863794,0.0003936699,0.001708383,0.00148528,0.001434474,0.001480894,0.0007882527],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005205865,"about_ca_system_score_gemma":0.0009109926,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008512411,"about_ca_topic_score_gemma":0.0009560083,"domain_scores_codex":[0.9981712,0.0008768191,0.0001022403,0.0001418557,0.0006298739,0.00007807911],"domain_scores_gemma":[0.9964691,0.002040875,0.0003185123,0.0005764472,0.0005123244,0.00008269279],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003046792,0.0001096595,0.001024222,0.0003429032,0.00007530235,0.0002289976,0.0006791271,0.4949049,0.0348123,0.3112028,0.001431936,0.1548833],"study_design_scores_gemma":[0.00001748367,0.0001318942,0.00007834448,0.00002956733,0.00000914718,0.00005639643,0.00002876827,0.9672565,0.009310254,0.02054795,0.002510738,0.00002284606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005831558,0.0001659952,0.9932505,0.00003643539,0.00001820424,0.0000224971,0.000004141697,0.0001395164,0.0005310122],"genre_scores_gemma":[0.2343097,0.0003486046,0.762809,0.00007744106,0.00004636864,0.0001998147,0.00005758088,0.000273264,0.001878208],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003722225,"threshold_uncertainty_score":0.01968521,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2015224767","doi":"10.1137/s0895479802402818","title":"Optimization and Pseudospectra, with Applications to Robust Stability","year":2003,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Lipschitz continuity; Mathematical analysis; Matrix (chemical analysis); Condition number; Applied mathematics; Complex plane","authors":[{"name":"James V. Burke","is_ca":false},{"name":"Adrian S. Lewis","is_ca":true},{"name":"Michael L. Overton","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01048618722052016,"gpt":0.2502751010984845,"spread":0.2397889138779643,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002148203,0.001912646,0.0009729183,0.001843997,0.0006188178,0.001742458,0.000936488,0.001761969,0.003797911],"category_scores_gemma":[0.006317785,0.0006517845,0.001294271,0.002018151,0.003104078,0.002295584,0.002856746,0.002819099,0.0007027843],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001397467,"about_ca_system_score_gemma":0.0008182801,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001766043,"about_ca_topic_score_gemma":0.001285274,"domain_scores_codex":[0.9988627,0.0005070631,0.00006810838,0.0001960888,0.0003200847,0.00004594275],"domain_scores_gemma":[0.996577,0.002350537,0.0003983685,0.0001795731,0.0003976232,0.00009693833],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000416513,0.00004105385,0.0005089598,0.0002644085,0.00007100047,0.0001564878,0.0002208895,0.3039907,0.004011077,0.6370138,0.002760601,0.05091934],"study_design_scores_gemma":[0.000006804068,0.00003632806,0.0001805182,0.00004296176,0.00001090839,0.00007396082,0.00003293775,0.6932808,0.0007550813,0.2999819,0.005573746,0.00002403906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005609786,0.00500494,0.9762387,0.001034357,0.0001659045,0.00003061307,0.00004615062,0.0001404918,0.01172903],"genre_scores_gemma":[0.5219045,0.02030286,0.4186262,0.001114612,0.002102915,0.0006188475,0.0002918838,0.0008756644,0.03416251],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003797911,"threshold_uncertainty_score":0.01270533,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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","authors":[{"name":"Ting Kei Pong","is_ca":true},{"name":"Henry Wolkowicz","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001637498,0.001162682,0.001812824,0.0005621869,0.0004086852,0.001875349,0.001429789,0.002229472,0.004937421],"category_scores_gemma":[0.008649843,0.0005864182,0.0007443634,0.0008686256,0.00158449,0.002250802,0.002357873,0.001957271,0.0007847086],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008173223,"about_ca_system_score_gemma":0.001563982,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002940961,"about_ca_topic_score_gemma":0.001766498,"domain_scores_codex":[0.9985247,0.000716909,0.00004742876,0.0003308749,0.0002781897,0.0001019476],"domain_scores_gemma":[0.9968666,0.002087985,0.0002153406,0.0003082524,0.0003824247,0.000139354],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002479591,0.00006852885,0.0004757812,0.0004402343,0.0001192875,0.0003377599,0.000115236,0.7781707,0.002450308,0.1326629,0.009483987,0.07542716],"study_design_scores_gemma":[0.00003065959,0.00003755269,0.00008694512,0.00001696189,0.00001434093,0.00008206911,0.00002264408,0.9405243,0.0005108548,0.0569586,0.001705294,0.000009731454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008606859,0.0003580048,0.9864319,0.0005290364,0.00007772575,0.00004590541,0.0001067007,0.00006881623,0.003775045],"genre_scores_gemma":[0.5571693,0.001319754,0.4218575,0.0004270359,0.0005111348,0.0004641726,0.0006399229,0.0003092303,0.01730198],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004937421,"threshold_uncertainty_score":0.01651728,"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","authors":[{"name":"Yongge Tian","is_ca":true},{"name":"George P. H. Styan","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002671788,0.001091761,0.0009862512,0.003154435,0.002373712,0.006098779,0.001409864,0.001366076,0.01721658],"category_scores_gemma":[0.0136745,0.0008285405,0.0008732657,0.002837581,0.004231714,0.01160786,0.003124808,0.00343451,0.002496164],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001026739,"about_ca_system_score_gemma":0.0007689394,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006305246,"about_ca_topic_score_gemma":0.001039226,"domain_scores_codex":[0.9971828,0.0006207182,0.0001801547,0.0004852526,0.001021012,0.0005099699],"domain_scores_gemma":[0.9894628,0.006210179,0.001235358,0.001176382,0.001071516,0.0008438849],"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.0001213205,0.00004936065,0.0004065909,0.00005949121,0.00001036132,0.0001366775,0.0004284667,0.001136537,0.00115621,0.9774296,0.003124527,0.01594085],"study_design_scores_gemma":[0.00001300979,0.00001833796,0.0001551378,0.000009960673,0.00000707191,0.0001356928,0.00007982278,0.002935433,0.0008150695,0.9943293,0.001483092,0.0000180173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3531513,0.003495956,0.4684169,0.003547658,0.000824745,0.0001211184,0.00107347,0.0009031213,0.1684658],"genre_scores_gemma":[0.922586,0.001499419,0.03747592,0.0006271526,0.001074904,0.0001108161,0.0006881391,0.0003298254,0.03560779],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01721658,"threshold_uncertainty_score":0.05759525,"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","authors":[{"name":"Kun Wang","is_ca":false},{"name":"Hui Liu","is_ca":false},{"name":"Zhangxin Chen","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006897394,0.0008850038,0.001176008,0.0005196257,0.001077309,0.0008916465,0.003098737,0.001215581,0.008922079],"category_scores_gemma":[0.002921309,0.0006250068,0.0007259563,0.000766962,0.0008539647,0.001761275,0.001820826,0.001465288,0.00139389],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008482686,"about_ca_system_score_gemma":0.002621462,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01302959,"about_ca_topic_score_gemma":0.01034311,"domain_scores_codex":[0.9996213,0.0001052579,0.00001633168,0.00004732777,0.0001381751,0.00007159916],"domain_scores_gemma":[0.9989665,0.0003744952,0.00004289098,0.0001903796,0.0002639877,0.0001618203],"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.0007618181,0.0002669425,0.001588556,0.0001768843,0.0001166877,0.0001897938,0.0001256911,0.9361097,0.00711642,0.01714312,0.01043096,0.02597339],"study_design_scores_gemma":[0.0001246179,0.00003857821,0.00006515685,0.000004256429,0.000009312691,0.000008176478,0.00001491375,0.992834,0.001451286,0.003790429,0.0016512,0.0000080225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3840276,0.0009227791,0.524106,0.001783031,0.001055287,0.000660538,0.002916989,0.02486563,0.0596622],"genre_scores_gemma":[0.7257326,0.0003507768,0.2561899,0.0003386103,0.00008336687,0.0004747473,0.002245823,0.002126613,0.01245752],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01302959,"threshold_uncertainty_score":0.02984732,"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","authors":[{"name":"S.W. Drury","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001200616,0.0006118305,0.0004000131,0.001044779,0.0005932771,0.001881906,0.0005879318,0.0004425343,0.008539315],"category_scores_gemma":[0.004995449,0.0002256901,0.0003482792,0.0005870569,0.003015917,0.003096308,0.001207767,0.0009460656,0.000788303],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004150314,"about_ca_system_score_gemma":0.0003066822,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001363423,"about_ca_topic_score_gemma":0.0001919442,"domain_scores_codex":[0.9991255,0.000226939,0.00003445609,0.0001565754,0.0003514507,0.0001050306],"domain_scores_gemma":[0.9974148,0.001009272,0.0004955214,0.0002763332,0.0005457298,0.0002581847],"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.00005871378,0.00002388182,0.0003849664,0.00004534229,0.000008683563,0.0002361546,0.0001702535,0.004494764,0.007729806,0.9797141,0.0007544378,0.006378958],"study_design_scores_gemma":[0.00001296573,0.00006872245,0.0004191089,0.00001794265,0.000005093251,0.0004326455,0.0001123149,0.05331852,0.005639466,0.9371558,0.002796155,0.00002126696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3784583,0.00065839,0.5751511,0.0007788498,0.0002463882,0.00004766728,0.0001115638,0.0002126194,0.0443351],"genre_scores_gemma":[0.957666,0.0002741751,0.02947317,0.0001166419,0.0002568832,0.00003520503,0.0000516162,0.0001003775,0.01202605],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008539315,"threshold_uncertainty_score":0.0285669,"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","authors":[{"name":"Peter Lancaster","is_ca":true},{"name":"Leiba Rodman","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00318337,0.001147316,0.001047906,0.002749596,0.00353963,0.00801365,0.001198575,0.001653947,0.01092132],"category_scores_gemma":[0.006594125,0.000919371,0.001384671,0.002220849,0.005881099,0.01049577,0.004089705,0.003399366,0.002662638],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00112245,"about_ca_system_score_gemma":0.001699288,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005439941,"about_ca_topic_score_gemma":0.0006484208,"domain_scores_codex":[0.9961705,0.0008330179,0.0002950975,0.0008196364,0.001152921,0.0007288662],"domain_scores_gemma":[0.9963792,0.0008359918,0.0004715504,0.0004513503,0.001146346,0.0007155712],"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.00002808774,0.00002388212,0.00009291997,0.00001057466,0.000003958372,0.00005650444,0.0002648985,0.00009471786,0.0004641306,0.994843,0.0008240924,0.00329326],"study_design_scores_gemma":[0.00001755319,0.00001842727,0.00008443544,0.000007421696,0.000006360912,0.0001240873,0.0001745959,0.0009662641,0.0008430759,0.9953787,0.002364099,0.00001498103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3290351,0.0008634474,0.5079154,0.003652803,0.002277855,0.0004221967,0.0008466471,0.001089676,0.1538968],"genre_scores_gemma":[0.9099423,0.0008602446,0.05071943,0.0008183733,0.001179299,0.0004185075,0.0007024457,0.0005749405,0.03478449],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01092132,"threshold_uncertainty_score":0.0365355,"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","authors":[{"name":"Michael Baake","is_ca":false},{"name":"Ulrike E. Schlägel","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001185215,0.0007318628,0.0005345984,0.001566984,0.0009377881,0.001802098,0.0008092514,0.0007732257,0.008942982],"category_scores_gemma":[0.002926925,0.0002716123,0.0005235912,0.001202495,0.002627791,0.004424688,0.001190473,0.00238447,0.003107185],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001165255,"about_ca_system_score_gemma":0.0008121704,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001447898,"about_ca_topic_score_gemma":0.001013017,"domain_scores_codex":[0.9994701,0.0001349097,0.00002395481,0.0000925763,0.0002347215,0.00004376182],"domain_scores_gemma":[0.999713,0.0001351889,0.00001984909,0.00003814346,0.00006786028,0.00002591019],"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.000002650908,0.000002238386,0.00001825185,0.00003341624,0.000001268459,0.00001734505,0.00004523037,0.0004040451,0.0001393698,0.988009,0.002642996,0.008684227],"study_design_scores_gemma":[0.000003886098,0.00001085949,0.00008304867,0.00005027035,0.000002801583,0.0001221607,0.0000377636,0.003011791,0.0002737971,0.9069097,0.08948252,0.00001147016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.01227134,0.04767475,0.2996951,0.00535798,0.003969583,0.00006788175,0.0002600122,0.0004418982,0.6302614],"genre_scores_gemma":[0.5253566,0.0788466,0.1921817,0.003327966,0.005926236,0.0002323568,0.0004142871,0.0006620838,0.1930523],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008942982,"threshold_uncertainty_score":0.0299173,"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","authors":[{"name":"Len Bos","is_ca":true},{"name":"Mark A. Taylor","is_ca":false},{"name":"Beth Wingate","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009233882,0.0005487154,0.0005422576,0.001149836,0.0008993903,0.002426145,0.0007475416,0.0009098801,0.006198657],"category_scores_gemma":[0.004722666,0.0003266101,0.0005058851,0.0009272074,0.002144972,0.002785777,0.00166069,0.001646102,0.003122937],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005637998,"about_ca_system_score_gemma":0.0005471621,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001219206,"about_ca_topic_score_gemma":0.0009404845,"domain_scores_codex":[0.9993744,0.0001415984,0.00003313926,0.00009311124,0.0002884175,0.00006936553],"domain_scores_gemma":[0.9986978,0.000399709,0.0001248047,0.0002114553,0.0004722863,0.00009394958],"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.00009983033,0.00002057963,0.0006112923,0.00008499666,0.000009892811,0.00009097477,0.0002826047,0.0134023,0.003950805,0.9383042,0.002248161,0.04089439],"study_design_scores_gemma":[0.00002108014,0.00005130816,0.0004065929,0.0000675101,0.00001081086,0.0002966971,0.0002280199,0.1488046,0.007959184,0.8215961,0.02051287,0.00004517711],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07127927,0.0003794007,0.9026431,0.0002755094,0.0001429735,0.00004857015,0.0001247622,0.0003315475,0.02477487],"genre_scores_gemma":[0.6446385,0.0006797491,0.3351309,0.0002694758,0.0001115865,0.0001665828,0.0003913412,0.0007410892,0.01787073],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006198657,"threshold_uncertainty_score":0.02073652,"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","authors":[{"name":"Gustavo Avila","is_ca":true},{"name":"Tucker Carrington","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008797626,0.0003606115,0.0005935868,0.0005432778,0.0005716624,0.0005823091,0.00094363,0.0009773476,0.001605673],"category_scores_gemma":[0.001515609,0.0002849439,0.0005675163,0.0004923897,0.0007783229,0.001193372,0.0009477491,0.001092952,0.0006021113],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003832354,"about_ca_system_score_gemma":0.0007674131,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001728989,"about_ca_topic_score_gemma":0.001970112,"domain_scores_codex":[0.9996221,0.0001233474,0.00002524703,0.0000356435,0.0001593953,0.00003413038],"domain_scores_gemma":[0.9994505,0.0003147876,0.00004360337,0.00007866126,0.00008921023,0.00002325422],"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.0001293254,0.0001089042,0.001059927,0.0002069216,0.00005161714,0.0002306858,0.0002501753,0.5139886,0.02127028,0.4003714,0.00159711,0.06073518],"study_design_scores_gemma":[0.00001065638,0.0000200575,0.00005495585,0.00000653562,0.000002519312,0.00001580272,0.00001109545,0.9736809,0.001675673,0.02327444,0.001239202,0.000008227548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01108683,0.00009180267,0.9868255,0.00007751341,0.00004294264,0.0000194635,0.00001808766,0.00007541672,0.001762378],"genre_scores_gemma":[0.2547032,0.0003726386,0.7395911,0.0001289438,0.0000635164,0.000158957,0.0001237571,0.0001630428,0.00469497],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001728989,"threshold_uncertainty_score":0.005371451,"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","authors":[{"name":"Paul Gomme","is_ca":true},{"name":"Paul Klein","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009800278,0.001133578,0.001296765,0.0006450643,0.0005353122,0.001466276,0.00104579,0.001209517,0.002920827],"category_scores_gemma":[0.004216243,0.0006297067,0.0009128842,0.0006301305,0.000891924,0.002110401,0.001214911,0.002143811,0.0009521849],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008956075,"about_ca_system_score_gemma":0.001244572,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01019653,"about_ca_topic_score_gemma":0.008544916,"domain_scores_codex":[0.9996632,0.0001395151,0.00002025581,0.00004088442,0.00009816365,0.00003787904],"domain_scores_gemma":[0.9985734,0.0007063432,0.0001322309,0.0002951421,0.0001936653,0.00009913088],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001041076,0.00009083265,0.0004105826,0.0001519421,0.0000631971,0.0001319585,0.0001397353,0.6809518,0.003472724,0.2839612,0.002617851,0.02790399],"study_design_scores_gemma":[0.000002168969,0.000006379321,0.00002116932,0.000002710022,0.000002692836,0.00001013381,0.000003930718,0.9854445,0.0001927823,0.01373206,0.0005777219,0.000003730729],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01028998,0.0003368402,0.9852585,0.0002010486,0.0001237917,0.00001669322,0.00007407743,0.0002206963,0.003478303],"genre_scores_gemma":[0.6708754,0.001583128,0.2964136,0.0002596497,0.0002861539,0.0001974959,0.0005902614,0.0004524752,0.02934182],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01019653,"threshold_uncertainty_score":0.0202744,"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","authors":[{"name":"Feng Dai","is_ca":false},{"name":"Andriy Prymak","is_ca":false},{"name":"Vladimir Temlyakov","is_ca":false},{"name":"Sergey Tikhonov","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00180566,0.000331004,0.0007838144,0.0009579216,0.0005720191,0.001683815,0.001041339,0.0008665493,0.003721327],"category_scores_gemma":[0.005205445,0.0002136513,0.0005219581,0.00122927,0.002332732,0.002580778,0.001572367,0.002011117,0.0004640947],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001482494,"about_ca_system_score_gemma":0.0005726691,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009571686,"about_ca_topic_score_gemma":0.0006290462,"domain_scores_codex":[0.9987826,0.0004626385,0.00006275892,0.0001743052,0.0004400258,0.00007769302],"domain_scores_gemma":[0.9981768,0.001091077,0.0001286498,0.0001966555,0.000307215,0.0000995528],"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.00001977309,0.00001345171,0.0001411707,0.00008644779,0.000008457811,0.00003918259,0.0000652785,0.01845935,0.0005657991,0.9640981,0.001213891,0.01528909],"study_design_scores_gemma":[0.000005519813,0.00001584088,0.0000958524,0.00003981679,0.000004410804,0.00006437675,0.00004600737,0.1509463,0.0005522146,0.8433099,0.004912334,0.000007526487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.02705801,0.003412792,0.9359594,0.0012377,0.0004889641,0.00002722903,0.0001257249,0.0001305655,0.03155961],"genre_scores_gemma":[0.6035319,0.004392236,0.3640965,0.0005931066,0.0008958149,0.0001521247,0.0005299263,0.0002587924,0.0255496],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.003721327,"threshold_uncertainty_score":0.01244909,"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","authors":[{"name":"Maysum Panju","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004038191,0.001435588,0.0009762034,0.001568429,0.001031065,0.001346617,0.001978507,0.001411718,0.005388642],"category_scores_gemma":[0.01849031,0.0005620396,0.001326152,0.002098508,0.001914911,0.002070476,0.001691353,0.002319033,0.002757251],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005938955,"about_ca_system_score_gemma":0.00113526,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001426225,"about_ca_topic_score_gemma":0.001754928,"domain_scores_codex":[0.997277,0.001199571,0.0001573111,0.0002332569,0.001012638,0.0001203254],"domain_scores_gemma":[0.9944323,0.003028983,0.0003236875,0.000668365,0.001448306,0.00009845727],"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.00007136835,0.0001037706,0.0008462979,0.0005738679,0.0001150381,0.0001683661,0.0004483219,0.2126759,0.00724263,0.570886,0.007057411,0.199811],"study_design_scores_gemma":[0.00004648971,0.00006688329,0.0002588877,0.000115329,0.00003151413,0.0002102593,0.00006885683,0.682702,0.0054736,0.2887507,0.02221436,0.00006111698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006144951,0.0003015939,0.9966516,0.00008654624,0.00005528547,0.00003004664,0.00001536385,0.0001212658,0.002123896],"genre_scores_gemma":[0.02802826,0.001142966,0.9661294,0.0001222333,0.0001293285,0.0002723483,0.00007453233,0.0002562207,0.003844639],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005388642,"threshold_uncertainty_score":0.02135623,"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","authors":[{"name":"Adrian S. Lewis","is_ca":true},{"name":"Hristo S. Sendov","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000524869,0.0006542871,0.0007012141,0.001215156,0.0002725298,0.001087108,0.0004972033,0.0006212065,0.005927157],"category_scores_gemma":[0.002654439,0.0002315296,0.0006296004,0.001159514,0.001017391,0.0008903578,0.0007761114,0.001264444,0.001550971],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003237857,"about_ca_system_score_gemma":0.0003202125,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005201334,"about_ca_topic_score_gemma":0.0003768879,"domain_scores_codex":[0.9996698,0.00008190094,0.0000221023,0.00006813242,0.0001385415,0.00001954642],"domain_scores_gemma":[0.9990702,0.000493431,0.00008795958,0.000133261,0.0001703246,0.00004482936],"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.0001203632,0.0001466243,0.00113845,0.001436644,0.000196749,0.000370962,0.000470401,0.04327855,0.02935123,0.3889129,0.03557294,0.4990042],"study_design_scores_gemma":[0.00001458709,0.0001178451,0.002277563,0.0002442529,0.00006842567,0.000667139,0.0001337851,0.2344044,0.007776843,0.70158,0.05267496,0.00004021656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01081947,0.03725551,0.9330466,0.0009888936,0.001578411,0.0000492974,0.0001862248,0.0002568077,0.0158187],"genre_scores_gemma":[0.5584821,0.07972623,0.2994338,0.001485696,0.007011443,0.0003202497,0.0007832404,0.0007206334,0.05203661],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005927157,"threshold_uncertainty_score":0.01982826,"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","authors":[{"name":"Francesco Barioli","is_ca":false},{"name":"Shaun Fallat","is_ca":true},{"name":"H. Tracy Hall","is_ca":false},{"name":"Daniel Hershkowitz","is_ca":false},{"name":"Leslie Hogben","is_ca":false},{"name":"Hein van der Holst","is_ca":false},{"name":"Bryan L. Shader","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003039873,0.001143653,0.001156728,0.001697393,0.0008493087,0.002417414,0.001227033,0.001156978,0.005860564],"category_scores_gemma":[0.02379195,0.0006804182,0.001107928,0.002633403,0.002902722,0.006893528,0.001558484,0.002334721,0.001382934],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008807322,"about_ca_system_score_gemma":0.000893612,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001482228,"about_ca_topic_score_gemma":0.001724331,"domain_scores_codex":[0.9981092,0.0006829429,0.0001222723,0.0003482185,0.0004981278,0.0002391268],"domain_scores_gemma":[0.976073,0.01775624,0.001721239,0.001624221,0.002204424,0.0006208851],"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.0002810568,0.0002410497,0.003109012,0.0008190425,0.00006785837,0.0004394686,0.0005508874,0.08145505,0.006414099,0.829823,0.008406213,0.06839318],"study_design_scores_gemma":[0.00003107289,0.0003083824,0.001240465,0.0001205599,0.00003080845,0.000529717,0.0002052212,0.1854534,0.003502936,0.8015743,0.006939307,0.00006373506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1108384,0.004695161,0.8516504,0.001450992,0.0002052916,0.000086712,0.000531182,0.0002848306,0.03025717],"genre_scores_gemma":[0.7292107,0.008523044,0.2434589,0.0005587622,0.001308662,0.0001696442,0.001305743,0.0003380213,0.01512654],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005860564,"threshold_uncertainty_score":0.01960558,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1968250174","doi":"10.1137/040620047","title":"A Multipreconditioned Conjugate Gradient Algorithm","year":2006,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjugate gradient method; Preconditioner; Mathematics; Derivation of the conjugate gradient method; Conjugate residual method; Algorithm; Positive-definite matrix; Generalization; Matrix (chemical analysis); Nonlinear conjugate gradient method; Applied mathematics; Biconjugate gradient method; Linear system; Block (permutation group theory); Cholesky decomposition; Gradient method; Conjugate; Domain decomposition methods; Relation (database); Coefficient matrix; Gradient descent; Computer science; Iterative method; Combinatorics; Mathematical analysis; Eigenvalues and eigenvectors; Finite element method; Artificial intelligence","authors":[{"name":"Robert Bridson","is_ca":true},{"name":"Chen Greif","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005290628705126683,"gpt":0.2455948881573417,"spread":0.240304259452215,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007035067,0.000705038,0.001078412,0.0005978958,0.0004491131,0.0009240672,0.001744059,0.001370735,0.007382967],"category_scores_gemma":[0.001811196,0.0005908914,0.0006782389,0.0007016971,0.0006979151,0.001267325,0.001645596,0.001515192,0.003183894],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004628482,"about_ca_system_score_gemma":0.001547366,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001958551,"about_ca_topic_score_gemma":0.002571405,"domain_scores_codex":[0.9993598,0.000172021,0.000035408,0.0001105602,0.000266236,0.00005605194],"domain_scores_gemma":[0.9992982,0.0001755643,0.00004454419,0.0001545264,0.0002681109,0.00005894155],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002159135,0.0001504298,0.0005985412,0.0001898706,0.00009411306,0.0002428747,0.0001153863,0.5225598,0.02076042,0.08305053,0.01269495,0.3593271],"study_design_scores_gemma":[0.00002895474,0.00002738354,0.00005594158,0.000006935868,0.000006287141,0.00004613339,0.000004732676,0.9841858,0.003063847,0.007982844,0.004580189,0.00001092128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001578866,0.00005014488,0.9966741,0.00006382449,0.00005309195,0.00003898942,0.00003130412,0.0003713835,0.001138413],"genre_scores_gemma":[0.03949752,0.0001020351,0.9540662,0.0001241749,0.00005669552,0.0001764046,0.0001604512,0.0001845713,0.005631927],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007382967,"threshold_uncertainty_score":0.02469844,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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","authors":[{"name":"Minghua Lin","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001901386,0.001339607,0.0008114587,0.002058544,0.001150797,0.002352071,0.001460067,0.001302269,0.01037089],"category_scores_gemma":[0.006090751,0.00052131,0.0009611492,0.001441317,0.003566294,0.003836084,0.002500342,0.003447604,0.0008945935],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002182111,"about_ca_system_score_gemma":0.0009153382,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002424629,"about_ca_topic_score_gemma":0.004327418,"domain_scores_codex":[0.9991216,0.0002657931,0.0000449446,0.0001611085,0.0002576634,0.0001489557],"domain_scores_gemma":[0.9968287,0.00201201,0.0002613032,0.0001632121,0.0004619656,0.0002726924],"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.0000187073,0.000008658713,0.0001253324,0.00003213352,0.000008444392,0.00003748719,0.00009228326,0.004530069,0.0008094287,0.990877,0.0007916713,0.002668871],"study_design_scores_gemma":[0.000006938891,0.00001297123,0.0001862503,0.00001304154,0.000006573602,0.00003900895,0.00004698037,0.03467036,0.0004650751,0.9629082,0.001623139,0.00002134043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1031577,0.002166523,0.7792738,0.003185036,0.0004433163,0.00006815822,0.0007109832,0.000160054,0.1108346],"genre_scores_gemma":[0.9009354,0.001870172,0.05827208,0.000978742,0.0004480732,0.0001393172,0.0004831982,0.0001067724,0.03676625],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01037089,"threshold_uncertainty_score":0.03469408,"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","authors":[{"name":"Michele Benzi","is_ca":false},{"name":"Eldad Haber","is_ca":true},{"name":"Lauren Taralli","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005117501,0.0009061504,0.0006466059,0.0004314725,0.0004197503,0.0004925583,0.0006348822,0.0009568658,0.003785483],"category_scores_gemma":[0.001939633,0.0002541239,0.0005926035,0.0007164601,0.0006409682,0.0007210009,0.001073456,0.00176883,0.0009893798],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001603492,"about_ca_system_score_gemma":0.0005987193,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000725175,"about_ca_topic_score_gemma":0.001164927,"domain_scores_codex":[0.9997403,0.00008360027,0.00001432318,0.00003488343,0.0001028744,0.00002410005],"domain_scores_gemma":[0.999631,0.0001513247,0.00003768128,0.00006132279,0.00008129127,0.00003737058],"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.0003417009,0.0002322956,0.0005818388,0.0007043199,0.00008560122,0.0007519654,0.0002656377,0.2093291,0.1038387,0.312756,0.01882131,0.3522915],"study_design_scores_gemma":[0.00006014646,0.0001540394,0.0002502346,0.00004091764,0.00003089509,0.0003183262,0.0000288478,0.9042723,0.008586784,0.07090437,0.01532951,0.00002375546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003931836,0.0002397284,0.9922126,0.0001560835,0.0001321347,0.000036617,0.00004223475,0.0001451188,0.003103595],"genre_scores_gemma":[0.1534365,0.001361512,0.8345668,0.0002830423,0.0003416895,0.0002585698,0.0002635442,0.0002904319,0.009197905],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003785483,"threshold_uncertainty_score":0.01266372,"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","authors":[{"name":"T. Rees","is_ca":true},{"name":"Chen Greif","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001538134,0.0008694929,0.0009643284,0.0004986226,0.0006148457,0.000801057,0.0008010578,0.00133511,0.004591378],"category_scores_gemma":[0.005892381,0.0004237573,0.0006227339,0.0006945847,0.001066237,0.0009602806,0.001832941,0.002741063,0.002528963],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003095191,"about_ca_system_score_gemma":0.001120427,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009458524,"about_ca_topic_score_gemma":0.001107734,"domain_scores_codex":[0.9989308,0.000460272,0.00004435544,0.00008265156,0.0004130301,0.00006902056],"domain_scores_gemma":[0.9983513,0.0008930538,0.0001697407,0.0002641816,0.0002563705,0.00006536547],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002189715,0.0001538861,0.0006808329,0.0005901281,0.00007759759,0.0005228184,0.0004341738,0.5205763,0.03503006,0.2281516,0.009970653,0.203593],"study_design_scores_gemma":[0.00003231035,0.00006256491,0.00008572653,0.00003560543,0.00001020958,0.00008910264,0.00001786462,0.9543607,0.007360369,0.02905925,0.008871359,0.0000150241],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001625843,0.00007497636,0.9964834,0.00008710533,0.00003806207,0.00003227835,0.00002752521,0.0002972933,0.00133344],"genre_scores_gemma":[0.05325275,0.0002946222,0.9430901,0.0001029159,0.00008743809,0.0002802436,0.0001326837,0.0003248479,0.002434505],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004591378,"threshold_uncertainty_score":0.0153597,"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","authors":[{"name":"James V. Burke","is_ca":false},{"name":"Adrian S. Lewis","is_ca":true},{"name":"Michael L. Overton","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03108360772005937,"gpt":0.2848674620295977,"spread":0.2537838543095383,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002032189,0.000970735,0.001689967,0.001871036,0.001773637,0.003822044,0.001464298,0.001631529,0.01088704],"category_scores_gemma":[0.0180906,0.0007376373,0.0007629443,0.001330286,0.003992462,0.006295036,0.003860412,0.002903438,0.001440264],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001463477,"about_ca_system_score_gemma":0.0009534627,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003736271,"about_ca_topic_score_gemma":0.000327519,"domain_scores_codex":[0.9982077,0.0006159842,0.00007327165,0.0004248131,0.0004369082,0.000241285],"domain_scores_gemma":[0.9907724,0.005674243,0.000832379,0.0008904916,0.00110752,0.000722909],"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.00007875857,0.00002652185,0.0002191231,0.00003662918,0.00001300462,0.00001901239,0.00008121408,0.01084722,0.0009321414,0.9785188,0.001699407,0.007528197],"study_design_scores_gemma":[0.000009753236,0.00001089169,0.0001082424,0.000006387745,0.000004074588,0.00001905899,0.00002529297,0.02646263,0.0004084283,0.9723913,0.0005445869,0.000009383362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2353407,0.002755791,0.6439716,0.006388979,0.0007472077,0.00009084528,0.000282348,0.0005686528,0.1098539],"genre_scores_gemma":[0.960607,0.0007767814,0.02055353,0.0003633069,0.0007494371,0.0001413961,0.0001121139,0.0001950513,0.01650134],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01088704,"threshold_uncertainty_score":0.03642076,"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","authors":[{"name":"Chun‐Hua Guo","is_ca":true},{"name":"Peter Lancaster","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001198313,0.001035409,0.000691272,0.0008425717,0.0009405952,0.001780823,0.001712355,0.001374013,0.02113873],"category_scores_gemma":[0.008528688,0.0005473493,0.0009735609,0.001065808,0.0009841889,0.003264042,0.003766027,0.00239187,0.006251094],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009595453,"about_ca_system_score_gemma":0.0008458549,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002361309,"about_ca_topic_score_gemma":0.003684876,"domain_scores_codex":[0.9991193,0.000278744,0.00005924837,0.0001860105,0.0002424822,0.0001142094],"domain_scores_gemma":[0.9975376,0.00145021,0.0001270431,0.0003138518,0.0004314698,0.0001398729],"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.0001845397,0.0001732276,0.001426748,0.0004459497,0.00008874652,0.0002010578,0.0005433804,0.1712251,0.002422773,0.5832943,0.03669091,0.2033034],"study_design_scores_gemma":[0.00004363947,0.00002738812,0.0001415765,0.00002803456,0.000008657512,0.00006008266,0.0001023834,0.5022758,0.0008207746,0.4871742,0.009300921,0.00001653665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008536661,0.0003938414,0.9728413,0.0008441802,0.0001941427,0.00006617871,0.0001533574,0.0009013442,0.01606903],"genre_scores_gemma":[0.2344099,0.0007828944,0.7151266,0.0006160045,0.0003790409,0.0003966107,0.001099007,0.001468665,0.04572128],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02113873,"threshold_uncertainty_score":0.07071608,"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","authors":[{"name":"Abdellatif Bourhim","is_ca":false},{"name":"Javad Mashreghi","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00112604,0.0006004196,0.0008330299,0.003889635,0.001082322,0.002495008,0.000644299,0.0007200405,0.006745577],"category_scores_gemma":[0.00189687,0.0004197949,0.0004695643,0.005179563,0.002027056,0.008508253,0.001672797,0.001932448,0.001275872],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007961413,"about_ca_system_score_gemma":0.0006311505,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004196119,"about_ca_topic_score_gemma":0.0003055705,"domain_scores_codex":[0.9993421,0.0001433091,0.00005104523,0.0001737324,0.0002200529,0.00006972154],"domain_scores_gemma":[0.9988004,0.000707958,0.000103724,0.000148242,0.0001419608,0.00009774996],"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.00002828695,0.00003820761,0.00108947,0.0007720038,0.00001976269,0.0001362218,0.0006434522,0.0007483063,0.001274489,0.8973352,0.005951573,0.09196309],"study_design_scores_gemma":[0.000008535387,0.00008368059,0.001674996,0.0003369604,0.00002321102,0.001286657,0.0004958327,0.002006548,0.001297162,0.8255236,0.1672279,0.00003500219],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"review","genre_gemma":"methods","genre_scores_codex":[0.1234353,0.3965519,0.1942974,0.006643576,0.001046997,0.0000776973,0.000819782,0.0005135515,0.2766138],"genre_scores_gemma":[0.5280676,0.3712898,0.05485835,0.001819963,0.005150992,0.0001269524,0.001537528,0.000382199,0.03676673],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.006745577,"threshold_uncertainty_score":0.0225662,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}