{"id":"W1969798922","doi":"10.1007/978-3-540-69903-3_35","title":"Computing the Greedy Spanner in Near-Quadratic Time","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Spanner; Greedy algorithm; Computer science; Dimension (graph theory); Logarithm; Quadratic equation; Time complexity; Euclidean space; Upper and lower bounds; Metric (unit); Combinatorics; Algorithm; Mathematical optimization; Mathematics","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.001610183,0.001852403,0.002363574,0.001171862,0.001040237,0.003007757,0.00274667,0.001972705,0.02957135],"category_scores_gemma":[0.008080897,0.0008731959,0.001410112,0.002291889,0.001635348,0.006618564,0.003147854,0.002695156,0.006628646],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001524137,"about_ca_system_score_gemma":0.002138597,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002755991,"about_ca_topic_score_gemma":0.007017588,"domain_scores_codex":[0.9982834,0.0003609294,0.00009863856,0.0004850333,0.0004388138,0.0003332895],"domain_scores_gemma":[0.9968399,0.001952506,0.000127614,0.0006337435,0.0002163587,0.0002298234],"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.002380331,0.0005469225,0.002478558,0.0009524226,0.0002429017,0.0002561878,0.000339352,0.3095192,0.01194122,0.1483076,0.06444227,0.458593],"study_design_scores_gemma":[0.0002312187,0.0001730516,0.0003640447,0.00004224026,0.00006209117,0.0001404932,0.0001872839,0.668911,0.0027133,0.3222884,0.00486117,0.00002568009],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09331591,0.0013881,0.8601084,0.001904255,0.0005606257,0.0002438811,0.001707651,0.007120201,0.03365096],"genre_scores_gemma":[0.3716559,0.000571062,0.6019353,0.0006583272,0.0002950837,0.0003533241,0.003637035,0.001957275,0.01893676],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02957135,"threshold_uncertainty_score":0.09892601,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0153657797872961,"score_gpt":0.2334040478138106,"score_spread":0.2180382680265144,"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."}}