{"id":"W2950757391","doi":"10.48550/arxiv.1903.11980","title":"Probabilistic Analysis of Facility Location on Random Shortest Path Metrics","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; RWTH Aachen University; Fédération Wallonie-Bruxelles; Deutsche Forschungsgemeinschaft; Freistaat Sachsen; National Foundation for Science and Technology Development","keywords":"Facility location problem; Shortest path problem; Heuristic; Mathematical optimization; Probabilistic logic; Metric (unit); Mathematics; Computer science; Path (computing); Euclidean geometry; Probabilistic analysis of algorithms; Metric space; Euclidean distance; Greedy algorithm; Upper and lower bounds; Combinatorics; Discrete mathematics; Statistics; Artificial intelligence; Engineering","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007493904,0.00223888,0.002945398,0.004254405,0.001389821,0.003395972,0.004382576,0.002312741,0.005163494],"category_scores_gemma":[0.0507594,0.001999905,0.003012666,0.004735544,0.004069471,0.01069054,0.004321716,0.004225219,0.0009849078],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006530739,"about_ca_system_score_gemma":0.001935772,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003727941,"about_ca_topic_score_gemma":0.002291147,"domain_scores_codex":[0.9904259,0.004498946,0.0003186656,0.001464481,0.002355483,0.0009365249],"domain_scores_gemma":[0.9489197,0.03880373,0.005175823,0.003269211,0.002650499,0.001181119],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001381295,0.00005030657,0.001630203,0.0003206639,0.000144977,0.0001298366,0.0001539748,0.6036273,0.001447927,0.3760394,0.003975898,0.01234146],"study_design_scores_gemma":[0.00001564889,0.000037873,0.0005954133,0.00004102889,0.0000310523,0.00008167129,0.00002713764,0.8299124,0.0003765418,0.1672607,0.001592119,0.00002842135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04279244,0.002486142,0.9418688,0.002010509,0.00007493657,0.0001467684,0.0005772377,0.0005559837,0.00948712],"genre_scores_gemma":[0.8000699,0.004618709,0.1827713,0.0008154736,0.0005162698,0.0009206547,0.0015697,0.0008933292,0.007824651],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007493904,"threshold_uncertainty_score":0.04738408,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08636848891975024,"score_gpt":0.2005369723349278,"score_spread":0.1141684834151775,"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."}}