{"id":"W3021716813","doi":"10.1007/s00453-009-9293-4","title":"Computing the Greedy Spanner in Near-Quadratic Time","year":2009,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"Society for the Study of School Psychology","keywords":"Spanner; Greedy algorithm; Combinatorics; Dimension (graph theory); Logarithm; Mathematics; Time complexity; Running time; Upper and lower bounds; Bounded function; Quadratic equation; Binary logarithm; Metric space; Metric (unit); Euclidean space; Discrete mathematics; Computer science; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003330032,0.00009367846,0.0001010017,0.00006893509,0.0001755456,0.0001936482,0.0004718193,0.00003306638,0.00001503128],"category_scores_gemma":[0.00003255295,0.00007121839,0.00003826012,0.0006706485,0.00002492363,0.0002315648,0.00007447566,0.0001274671,0.0002069465],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000270848,"about_ca_system_score_gemma":0.00006201203,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001300006,"about_ca_topic_score_gemma":0.000002442654,"domain_scores_codex":[0.9990751,0.00007658165,0.0001954208,0.0002350879,0.0002124333,0.0002053468],"domain_scores_gemma":[0.9994645,0.0001300766,0.00005110231,0.0002655897,0.00004762104,0.00004118239],"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.000003791679,0.0001248682,0.00006387047,0.000002753462,0.000009938166,0.00002976679,0.001245265,0.0343934,0.001048699,0.02426555,0.002832926,0.9359792],"study_design_scores_gemma":[0.0001762105,0.00005935538,0.01147731,0.000008634046,0.00000194057,0.00002431515,0.000005683263,0.9762887,0.0004057683,0.00917013,0.00227601,0.000105985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09516205,0.0001807879,0.8886181,0.0126002,0.0003641856,0.0002525567,8.783066e-7,0.0001474691,0.002673785],"genre_scores_gemma":[0.9286699,0.000001339829,0.06908312,0.001644224,0.0001974028,0.000002098122,0.000006046334,0.000003702557,0.0003921305],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9418952,"threshold_uncertainty_score":0.2904202,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006244191694777135,"score_gpt":0.2270014671969099,"score_spread":0.2207572755021327,"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."}}