{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002520292,0.0002410883,0.0004868895,0.0006897806,0.00009345794,0.0000185279,0.0003112977,0.000134796,0.00008649947],"category_scores_gemma":[0.0000158155,0.0003107763,0.0001907329,0.0007922429,0.000220288,0.00009288362,0.0004428272,0.0003725051,0.000003831623],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001027961,"about_ca_system_score_gemma":0.0000543348,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002376451,"about_ca_topic_score_gemma":0.000007893446,"domain_scores_codex":[0.9988527,0.0001696563,0.0003188971,0.0003565022,0.0001199866,0.0001822867],"domain_scores_gemma":[0.9989007,0.000420266,0.0002612062,0.000232081,0.0001013091,0.0000844777],"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.00007918049,0.00005721183,0.01060372,0.0007161539,0.0003064944,0.00005169907,0.0003140343,0.7276903,0.00009895041,0.2600249,0.00001650167,0.00004084949],"study_design_scores_gemma":[0.001348528,0.0001971421,0.03935003,0.0005735419,0.0005108216,0.00005682459,0.001303961,0.6565989,0.0005267103,0.2985626,0.00007629644,0.0008946678],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9872642,0.0009223109,0.007826399,0.000004739911,0.0002272416,0.0002429157,0.0004797328,0.00008317072,0.002949257],"genre_scores_gemma":[0.9992067,0.0001606356,0.0004310759,0.000004634997,0.00001659397,0.00000103533,0.000110628,0.00002394314,0.00004471158],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0710914,"threshold_uncertainty_score":0.9999344,"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."}}