{"id":"W4297821321","doi":"10.48550/arxiv.2209.05678","title":"Computational complexity of decomposing a symmetric matrix as a sum of positive semidefinite and diagonal matrices","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; Georgia Institute of Technology","keywords":"Mathematics; Rank (graph theory); Matrix (chemical analysis); Positive-definite matrix; Diagonal; Combinatorics; Diagonal matrix; Polynomial matrix; Semidefinite programming; Symmetric matrix; Matrix decomposition; Matrix polynomial; Bounded function; Polynomial; Discrete mathematics; Applied mathematics; Mathematical optimization; Mathematical analysis; Eigenvalues and eigenvectors","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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.001870998,0.001169511,0.001215362,0.0006290963,0.0006374482,0.002720525,0.001178505,0.001025752,0.009816128],"category_scores_gemma":[0.008856831,0.0005142689,0.0009326409,0.001094654,0.001200016,0.003322671,0.001553148,0.002358577,0.001142078],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001393928,"about_ca_system_score_gemma":0.001913405,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004413486,"about_ca_topic_score_gemma":0.007280339,"domain_scores_codex":[0.9983963,0.0006152146,0.00006530592,0.0003435872,0.0003033556,0.0002760791],"domain_scores_gemma":[0.9901328,0.008093671,0.0004886677,0.0006251931,0.0003507731,0.0003089048],"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.0009153766,0.0004084365,0.00266776,0.0006186605,0.0001636583,0.0002883746,0.0002204867,0.8032291,0.004632833,0.0636901,0.01739643,0.1057687],"study_design_scores_gemma":[0.000079236,0.00005514899,0.0002843139,0.00001320382,0.0000174912,0.00004329837,0.0000665774,0.9418138,0.0008868055,0.05617568,0.0005547191,0.000009815017],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3075734,0.00109165,0.6547902,0.006576582,0.0002544228,0.0002846791,0.001790753,0.001744684,0.0258936],"genre_scores_gemma":[0.7971116,0.0005626476,0.1896728,0.0005805329,0.0002389004,0.0002118442,0.002474534,0.0003825591,0.008764595],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009816128,"threshold_uncertainty_score":0.03283828,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04171935949327458,"score_gpt":0.1962113643799527,"score_spread":0.1544920048866781,"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."}}