{"id":"W2141646866","doi":"10.24517/00062794","title":"Linear-Space Algorithms for Distance Preserving Embedding","year":2007,"lang":"en","type":"article","venue":"NPARC","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Combinatorics; Distance matrix; Mathematics; Euclidean distance; Euclidean space; Euclidean distance matrix; Embedding; Disjoint sets; Strength of a graph; Discrete mathematics; Linear space; Partition (number theory); Algorithm; Graph; Graph power; Computer science; Line graph; Artificial intelligence","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001826609,0.002148832,0.00177095,0.002469358,0.00141589,0.003102093,0.003689011,0.001933206,0.01204781],"category_scores_gemma":[0.008595695,0.0008085303,0.001305141,0.004700848,0.001849802,0.006976321,0.004872446,0.003666522,0.005589037],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002390269,"about_ca_system_score_gemma":0.001614817,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003731279,"about_ca_topic_score_gemma":0.004560482,"domain_scores_codex":[0.9969465,0.0008033514,0.0001980941,0.0006275908,0.001068346,0.0003560928],"domain_scores_gemma":[0.9954779,0.00225314,0.0003248794,0.001192277,0.0006230244,0.0001288207],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004932894,0.0004764464,0.0006965753,0.0005287776,0.000129563,0.0001029617,0.0003819252,0.2497065,0.002979411,0.1989061,0.02716569,0.5184328],"study_design_scores_gemma":[0.0001143476,0.0001132108,0.0001783813,0.00003203509,0.00002848997,0.0001165255,0.0001374979,0.647903,0.002483562,0.3384186,0.010441,0.00003341046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004068437,0.0007463081,0.9894575,0.0003423622,0.00005674557,0.00008754251,0.0002238546,0.001924311,0.003092916],"genre_scores_gemma":[0.1044796,0.0007429711,0.8851188,0.0002209734,0.0001414278,0.000514249,0.001428865,0.0005090364,0.006844045],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01204781,"threshold_uncertainty_score":0.04030401,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02873094450592093,"score_gpt":0.3070024107349173,"score_spread":0.2782714662289963,"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."}}