{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008013098,0.0001368211,0.000313949,0.001836083,0.0000756109,0.00005025211,0.0003685596,0.00005525133,0.00001308966],"category_scores_gemma":[0.0003605361,0.0001149766,0.0002056652,0.004046325,0.00004143718,0.0003771503,0.0001017848,0.00005101824,0.000004630929],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006496148,"about_ca_system_score_gemma":0.00009732493,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008117649,"about_ca_topic_score_gemma":0.000007830047,"domain_scores_codex":[0.9983483,0.00005285967,0.0006029786,0.0004055749,0.0003573156,0.0002329802],"domain_scores_gemma":[0.9973073,0.001807848,0.0002610382,0.0002244287,0.0003369426,0.0000624612],"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.00001459888,0.0001114379,0.009487882,0.00003299686,0.0002024576,7.951459e-7,0.0002112993,0.7621021,0.0007369814,0.1418344,0.00002506846,0.08523989],"study_design_scores_gemma":[0.0006714666,0.00006299292,0.1165633,0.00004559432,0.00005469587,0.000002908489,0.00001937407,0.7717809,0.0004001823,0.1101056,0.0000935149,0.0001994915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1557273,0.00008437416,0.8433571,0.0003928352,0.000111958,0.0001840273,0.00003112931,0.00004061697,0.00007062915],"genre_scores_gemma":[0.7171232,0.000003138204,0.2826454,0.0001001976,0.00003155994,0.00002032154,0.00004774931,0.000005722079,0.00002275049],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5613958,"threshold_uncertainty_score":0.4688609,"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."}}