{"id":"W2952450694","doi":"10.48550/arxiv.math/0612388","title":"Sensor Network Localization, Euclidean Distance Matrix Completions, and Graph Realization","year":2006,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Semidefinite programming; Euclidean distance matrix; Clique; Euclidean geometry; Euclidean distance; Relaxation (psychology); Graph; Projection (relational algebra); Matrix (chemical analysis); Reduction (mathematics); Realization (probability); Distance matrix; Mathematical optimization; Combinatorics; Algorithm","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.00151948,0.001155811,0.0008164599,0.0004769305,0.0003822939,0.001179874,0.00112506,0.0009231204,0.003226855],"category_scores_gemma":[0.005750732,0.0005047238,0.0007609954,0.0009546835,0.001889671,0.002207603,0.001473845,0.002976552,0.0005346523],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001373383,"about_ca_system_score_gemma":0.001162321,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003752612,"about_ca_topic_score_gemma":0.002741526,"domain_scores_codex":[0.9989951,0.0004775374,0.00002843228,0.0002394141,0.0001692826,0.00009024788],"domain_scores_gemma":[0.9972414,0.001754566,0.0003743905,0.0002321359,0.0002443461,0.0001532993],"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.00006168133,0.00007365314,0.0002988735,0.0001459765,0.00002566777,0.00009415717,0.0001192083,0.7794576,0.001166112,0.1956136,0.003781032,0.01916231],"study_design_scores_gemma":[0.00000772454,0.00002500747,0.0000718305,0.000008581541,0.000002779384,0.00002059924,0.0000282567,0.9270427,0.0003448986,0.07135011,0.001090055,0.000007535016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008689774,0.0002071086,0.9862585,0.0004654647,0.00003794866,0.00002450914,0.0001259567,0.000127012,0.0040638],"genre_scores_gemma":[0.6116175,0.001433409,0.3668836,0.0004559522,0.0003245815,0.0003496584,0.0009727166,0.0002993118,0.0176633],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003752612,"threshold_uncertainty_score":0.01079488,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02179466516268194,"score_gpt":0.2463369626370266,"score_spread":0.2245422974743446,"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."}}