{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008241151,0.003213437,0.002326355,0.005479098,0.001769837,0.005651893,0.004381057,0.003746798,0.01126825],"category_scores_gemma":[0.0611905,0.001066056,0.00155808,0.005224111,0.006686679,0.01294965,0.006504849,0.01204798,0.006161992],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002231001,"about_ca_system_score_gemma":0.001218157,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001791938,"about_ca_topic_score_gemma":0.002448066,"domain_scores_codex":[0.9949286,0.001797441,0.0003913962,0.0007577792,0.001669482,0.0004553014],"domain_scores_gemma":[0.9622048,0.0285289,0.001563622,0.00323709,0.003138135,0.001327379],"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.0001423597,0.00008312728,0.0004356717,0.0003087446,0.00004962374,0.0001488203,0.0002764525,0.01122402,0.001634501,0.9348625,0.01396186,0.03687239],"study_design_scores_gemma":[0.00001260626,0.00004284613,0.0003889327,0.0001596255,0.00002904884,0.0002374927,0.0001012747,0.04900508,0.0009505711,0.9355842,0.01343508,0.00005327168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01744487,0.04525404,0.8334261,0.007486894,0.003123673,0.00008252574,0.0009295637,0.0006269982,0.09162536],"genre_scores_gemma":[0.4535722,0.04992053,0.421255,0.005623753,0.01086289,0.0009065805,0.002124198,0.001537303,0.05419752],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01126825,"threshold_uncertainty_score":0.04358387,"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."}}