{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002360964,0.001236098,0.001686772,0.002009117,0.0006224108,0.002415972,0.002512578,0.00288858,0.002237288],"category_scores_gemma":[0.02016706,0.0006609112,0.0009204451,0.004445992,0.001783693,0.004786053,0.001688009,0.002322781,0.0008562],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001099957,"about_ca_system_score_gemma":0.0009818634,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002935624,"about_ca_topic_score_gemma":0.001844196,"domain_scores_codex":[0.997062,0.0009962417,0.000212773,0.0008139027,0.0008229138,0.00009221746],"domain_scores_gemma":[0.9925424,0.005180447,0.0006988184,0.0006020191,0.000872702,0.0001035705],"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.0001818563,0.0001103815,0.001238638,0.0008681206,0.0002224034,0.000124808,0.0002112131,0.5151889,0.00364976,0.1771466,0.006595853,0.2944615],"study_design_scores_gemma":[0.00001823566,0.00006624359,0.0007435044,0.00006933938,0.00003338879,0.0001636705,0.0001043884,0.7774077,0.002060484,0.2151072,0.004179196,0.00004661935],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009870649,0.0009594522,0.9870302,0.0005732255,0.0001055026,0.00002809906,0.0002502792,0.0001063842,0.001076133],"genre_scores_gemma":[0.2201745,0.002850208,0.7648341,0.0002350417,0.0005268293,0.0003084976,0.001657597,0.0002398119,0.009173427],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002935624,"threshold_uncertainty_score":0.01248616,"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."}}