{"id":"W2075893026","doi":"10.1016/j.laa.2005.03.021","title":"Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming","year":2005,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":51,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Euclidean distance matrix; Euclidean distance; Semidefinite programming; Distance matrix; Matrix norm; Matrix (chemical analysis); Euclidean geometry; Matrix completion; Large margin nearest neighbor; Diagonal; Mathematical optimization; Combinatorics; Applied mathematics; k-nearest neighbors algorithm; Computer science; Eigenvalues and eigenvectors; Geometry; Artificial intelligence","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005051052,0.001759894,0.002840591,0.001215694,0.0009445053,0.004093579,0.003581364,0.002703696,0.006610396],"category_scores_gemma":[0.02723219,0.001254632,0.001259112,0.002445058,0.003862022,0.01005806,0.003895986,0.005825934,0.001056175],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001842211,"about_ca_system_score_gemma":0.002551598,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0032211,"about_ca_topic_score_gemma":0.003390144,"domain_scores_codex":[0.9958848,0.001664474,0.0001900256,0.0008009885,0.001189866,0.0002696647],"domain_scores_gemma":[0.9859638,0.009049001,0.000969444,0.001935333,0.001485686,0.0005967442],"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.0003050146,0.0003161046,0.0004586043,0.000458715,0.00008734547,0.00009588176,0.0002418785,0.5199913,0.001253732,0.3861409,0.00825537,0.08239514],"study_design_scores_gemma":[0.00002721637,0.00004480583,0.00008138015,0.00001765734,0.000006996063,0.00003869218,0.00005378648,0.7496986,0.0004567275,0.2486266,0.0009263483,0.0000212026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009857042,0.0003275872,0.9870184,0.0004272984,0.00006647123,0.0000497398,0.0001986401,0.0001366849,0.001918183],"genre_scores_gemma":[0.3749588,0.001261363,0.6112893,0.0003610254,0.0004198663,0.000404018,0.001404867,0.0004310025,0.009469747],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006610396,"threshold_uncertainty_score":0.02671283,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07301771218730009,"score_gpt":0.3652212376610858,"score_spread":0.2922035254737858,"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."}}