{"id":"W2402021895","doi":"","title":"On the lower and upper bounds for the Euclidean norm of a complex matrix and its Applications.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Euclidean geometry; Norm (philosophy); Matrix (chemical analysis); Upper and lower bounds; Matrix norm; Euclidean distance matrix; Euclidean distance; Pure mathematics; Combinatorics; Mathematical analysis; Geometry; Eigenvalues and eigenvectors","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003597018,0.00009271892,0.0001064912,0.00002579886,0.0002813639,0.0001367917,0.0004959369,0.00003080324,0.00002919377],"category_scores_gemma":[0.00004567369,0.00005217396,0.00003494191,0.00014056,0.00009261155,0.0001427916,0.0001613981,0.00007487735,0.00002165062],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006606226,"about_ca_system_score_gemma":0.000013718,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001007369,"about_ca_topic_score_gemma":4.586498e-7,"domain_scores_codex":[0.9993766,0.00004047365,0.0001419806,0.0001823657,0.0001167726,0.0001418274],"domain_scores_gemma":[0.9982921,0.001106868,0.00007442958,0.0003968692,0.00008705054,0.00004260617],"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.000003895498,0.00004256927,0.0000287769,0.00001209774,0.00001178677,9.172744e-8,0.0001458571,0.000001001512,0.0001463703,0.9946545,0.001482926,0.003470105],"study_design_scores_gemma":[0.0003547904,0.0001300572,0.001257275,0.000008716685,0.000008252066,0.000004292906,0.00004073873,0.02106877,0.0003508704,0.9678995,0.008788887,0.00008783409],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9522659,0.001759667,0.02211126,0.01619122,0.0010973,0.003571492,0.0000208329,0.0001227734,0.002859616],"genre_scores_gemma":[0.9984078,0.00002482143,0.0007233928,0.0002869827,0.00001002478,0.0001895199,6.512032e-7,0.000006406672,0.0003504006],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04614196,"threshold_uncertainty_score":0.2164052,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01304081874039916,"score_gpt":0.2481510524962072,"score_spread":0.2351102337558081,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}