{"id":"W2564729024","doi":"10.1016/j.comgeo.2004.04.003","title":"Approximating geometric bottleneck shortest paths","year":2004,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Dalhousie University; Carleton University","funders":"","keywords":"Delaunay triangulation; Shortest path problem; Bottleneck; Computer science; Combinatorics; Point set triangulation; Path (computing); Graph; Discrete mathematics; 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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005901386,0.0002805899,0.0002760069,0.001253917,0.0003946083,0.0003518205,0.0008305873,0.0001067719,0.00004726457],"category_scores_gemma":[0.0003387642,0.0002974957,0.0001509417,0.004883576,0.00005811718,0.0009139421,0.0003196707,0.0002454956,0.0003842341],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001903783,"about_ca_system_score_gemma":0.0003221807,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001192144,"about_ca_topic_score_gemma":0.00000130319,"domain_scores_codex":[0.9972354,0.00005535856,0.000613504,0.0007025454,0.0009374625,0.0004557699],"domain_scores_gemma":[0.9983411,0.0003949035,0.0002253325,0.0004155362,0.0004005797,0.0002225828],"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.000003244999,0.0001943168,0.000593774,0.000018448,0.00003241246,0.00002045756,0.0001230001,0.7970122,0.0001327259,0.1518475,0.0003896099,0.04963236],"study_design_scores_gemma":[0.002717551,0.0003929782,0.08273543,0.00009209522,0.00003092178,0.0004265931,0.00007426456,0.5280129,0.002306052,0.3768863,0.004946263,0.001378636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09180779,0.0005089622,0.9039068,0.0008159937,0.0006407322,0.000220566,0.000009322579,0.0003640832,0.001725767],"genre_scores_gemma":[0.6750309,0.000007114507,0.3238964,0.0006191636,0.0002135752,0.00002245226,0.00009455499,0.00001504722,0.0001007509],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5832232,"threshold_uncertainty_score":0.9999477,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01591962100472446,"score_gpt":0.2435223757131707,"score_spread":0.2276027547084463,"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."}}