{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007494661,0.0001184221,0.0001169482,0.00007394244,0.0001598629,0.0001938309,0.001156496,0.00003389794,0.00002544949],"category_scores_gemma":[0.00007132078,0.000113489,0.00005688372,0.0003078564,0.00002299183,0.0008659554,0.0004590372,0.00008102406,0.00002781688],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002958951,"about_ca_system_score_gemma":0.00001328035,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005264981,"about_ca_topic_score_gemma":0.000007709154,"domain_scores_codex":[0.9987385,0.00001102966,0.0001784971,0.0003821531,0.0002500543,0.0004397145],"domain_scores_gemma":[0.9990641,0.0001423224,0.00006906679,0.0005731613,0.00006093863,0.00009036814],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000020822,0.0001109708,0.0003383013,0.0001117825,0.00004589192,0.00004879817,0.0006207681,0.0002001147,0.002955873,0.3800173,0.04343679,0.5720927],"study_design_scores_gemma":[0.0003475328,0.00004395451,0.0002658487,0.00002711304,0.000005455548,0.000001894821,0.00004655358,0.7584295,0.00281884,0.01630921,0.2214915,0.0002126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003498998,0.00004104407,0.9752898,0.001178295,0.0005094348,0.0002362486,0.000008913416,0.0002028913,0.02218343],"genre_scores_gemma":[0.03455885,0.00001027084,0.9578242,0.0002312681,0.0003878728,0.00002102283,0.00001400878,0.00001473761,0.006937745],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7582294,"threshold_uncertainty_score":0.4627947,"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."}}