{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002312758,0.0001400171,0.0001814285,0.00008420064,0.0003673739,0.00008721185,0.00009337895,0.00005938067,0.00001203534],"category_scores_gemma":[0.0001012785,0.000133369,0.00002846291,0.0002701054,0.00006248055,0.0002344832,0.00005934989,0.0001037312,0.000004575791],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003148125,"about_ca_system_score_gemma":0.00001759791,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001790092,"about_ca_topic_score_gemma":0.000006259411,"domain_scores_codex":[0.9989609,0.000021009,0.000304289,0.0003118579,0.0001515945,0.0002504252],"domain_scores_gemma":[0.9991054,0.000290167,0.000148939,0.0001793564,0.0001737293,0.0001023908],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005445025,0.0006043729,0.0005708682,0.002383465,0.0001055112,6.042231e-7,0.001410026,0.005644402,0.003918587,0.7837479,0.0002266023,0.2013332],"study_design_scores_gemma":[0.0005991286,0.00003754332,0.00003210973,0.00006031579,0.00004490849,0.000014362,0.0001290804,0.898268,0.0004528241,0.02415434,0.07594686,0.0002604956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0118476,0.0009352426,0.9844614,0.0003945955,0.000007410668,0.0020298,0.00006742324,0.0001337224,0.0001228083],"genre_scores_gemma":[0.0499477,0.0005115562,0.9479952,0.00004952112,0.0001910424,0.0008187499,0.00008486923,0.0000534156,0.0003479001],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8926236,"threshold_uncertainty_score":0.5438632,"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."}}