{"id":"W1658042064","doi":"10.1016/j.comgeo.2016.05.005","title":"Analysis of farthest point sampling for approximating geodesics in a graph","year":2016,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Geodesic; Vertex (graph theory); Mathematics; Distance; Shortest path problem; Path graph; Bounded function; Computation; Graph; Discrete mathematics; Graph power; Algorithm; Geometry; Line graph; Mathematical analysis","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.003478961,0.001261049,0.001492124,0.002561467,0.0007452978,0.001510212,0.002311958,0.001942424,0.003064766],"category_scores_gemma":[0.02394414,0.0007997913,0.001128381,0.001539659,0.001625211,0.001956825,0.002124287,0.001655955,0.0003803986],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002285183,"about_ca_system_score_gemma":0.001398921,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00860944,"about_ca_topic_score_gemma":0.007370467,"domain_scores_codex":[0.9986889,0.0005118826,0.0000501972,0.0001569645,0.0004878575,0.0001041848],"domain_scores_gemma":[0.9869121,0.0104044,0.0004904612,0.0005869468,0.001106213,0.0004997829],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000282847,0.0001035457,0.002588453,0.0001938564,0.0000621391,0.0001154816,0.0001740942,0.8759928,0.003948049,0.08078224,0.001437381,0.03431914],"study_design_scores_gemma":[0.000003829813,0.00001250494,0.00008008463,0.000005391701,0.000003275485,0.00001252713,0.000008085692,0.9947723,0.000219231,0.004755771,0.0001241026,0.000002943221],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05279711,0.0004943283,0.9439732,0.000249636,0.00004824488,0.0000746255,0.0001032276,0.0002462399,0.002013324],"genre_scores_gemma":[0.6835535,0.0007771405,0.3096632,0.0002135232,0.0001672319,0.0002073858,0.0008871813,0.0004850842,0.004045668],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00860944,"threshold_uncertainty_score":0.0183987,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03545272358260807,"score_gpt":0.2890276890335498,"score_spread":0.2535749654509417,"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."}}