{"id":"W4389477517","doi":"10.1007/s10208-023-09637-4","title":"Computational Complexity of Decomposing a Symmetric Matrix as a Sum of Positive Semidefinite and Diagonal Matrices","year":2023,"lang":"en","type":"article","venue":"Foundations of Computational Mathematics","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Rank (graph theory); Matrix (chemical analysis); Positive-definite matrix; Diagonal; Combinatorics; Diagonal matrix; Semidefinite programming; Symmetric matrix; Polynomial matrix; Bounded function; Matrix polynomial; Matrix decomposition; Computational complexity theory; Polynomial; Discrete mathematics; Mathematical optimization; Algorithm; Mathematical analysis; Eigenvalues and eigenvectors","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001827571,0.0001430956,0.0003473928,0.000666149,0.00007034922,0.00002403569,0.0001315496,0.00005211352,0.00001755748],"category_scores_gemma":[0.0001079392,0.0001577204,0.00008157658,0.0009426538,0.000245699,0.0001241939,0.0000741621,0.00007784004,0.00001051546],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002544555,"about_ca_system_score_gemma":0.0000590228,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002148662,"about_ca_topic_score_gemma":0.000001519761,"domain_scores_codex":[0.9987193,0.00002995054,0.0006272584,0.0001197958,0.0003785506,0.0001251659],"domain_scores_gemma":[0.9976419,0.001484249,0.0002773693,0.0001202887,0.0004359759,0.00004017097],"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.00001098925,0.0001360697,0.0004856116,0.0004680916,0.0001918446,0.000002086048,0.000829945,0.6891827,0.0009298827,0.3066881,0.0002930012,0.0007816655],"study_design_scores_gemma":[0.0001910314,0.00004697149,0.008343282,0.0002325009,0.00004209776,0.0000212085,0.0001090689,0.5818784,0.001578348,0.4074419,0.000009635445,0.0001056191],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8103482,0.0001730355,0.1875791,0.00006891151,0.00005997385,0.0002249306,0.0001800867,0.0001974974,0.00116827],"genre_scores_gemma":[0.7894202,0.00002927296,0.2103197,0.000005310832,0.00001175006,0.000005067833,0.0001843547,0.00001843279,0.000005814936],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1073043,"threshold_uncertainty_score":0.6431651,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03505159384007851,"score_gpt":0.3077297506518258,"score_spread":0.2726781568117473,"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."}}