{"id":"W1976934926","doi":"10.1016/j.apnum.2007.01.008","title":"Euclidean distances and least squares problems for a given set of vectors","year":2007,"lang":"en","type":"article","venue":"Applied Numerical Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Euclidean distance matrix; Euclidean distance; Euclidean geometry; Rank (graph theory); Combinatorics; Euclidean space; Simple (philosophy); Column (typography); Matrix (chemical analysis); Set (abstract data type); Least-squares function approximation; Euclidean shortest path; Applied mathematics; Geometry; Statistics; Computer science","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.0002785458,0.0001309675,0.0002771739,0.00004372489,0.00003662652,0.00001282269,0.0000936551,0.00005594191,0.000007164382],"category_scores_gemma":[0.00001779367,0.0001111501,0.00004839206,0.0001393179,0.0000630407,0.00002649669,0.00001358453,0.0000607363,0.000004245376],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001036919,"about_ca_system_score_gemma":0.000002367332,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001572586,"about_ca_topic_score_gemma":0.000002406388,"domain_scores_codex":[0.9992489,0.000004827695,0.000329244,0.0001076379,0.000106411,0.0002030325],"domain_scores_gemma":[0.9994247,0.000286059,0.00006899016,0.0001384679,0.00001615866,0.00006565318],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001428374,0.0002926044,0.001032765,0.0132005,0.0004194429,0.000004150423,0.02285286,0.003266546,0.05107969,0.8810987,0.001371174,0.02523874],"study_design_scores_gemma":[0.003262166,0.0007081126,0.002099036,0.000938492,0.0003368621,0.00005462886,0.02175589,0.04895231,0.06630824,0.8149685,0.03841611,0.002199701],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4611213,0.0003199022,0.529933,0.00001990402,0.000129188,0.0008236251,0.00004229274,0.0002255703,0.007385216],"genre_scores_gemma":[0.9930567,0.000006163222,0.006790834,0.000005035391,0.00004287553,0.00004655826,0.000004742394,0.00002969988,0.00001744435],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5319353,"threshold_uncertainty_score":0.4532569,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01191015011851256,"score_gpt":0.2183315139589488,"score_spread":0.2064213638404362,"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."}}