{"id":"W2915860730","doi":"10.1007/s00453-020-00785-5","title":"Travelling on Graphs with Small Highway Dimension","year":2021,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Deutsche Forschungsgemeinschaft","keywords":"Dimension (graph theory); Steiner tree problem; Theory of computation; Combinatorics; Mathematics; Graph; Polynomial; Approximation algorithm; Scheme (mathematics); Time complexity; Tree (set theory); Polynomial-time approximation scheme; Shortest path problem; Metric dimension; Discrete mathematics; Pathwidth; Line graph; 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.0001333563,0.0002327629,0.0002344347,0.0001434301,0.0002619102,0.0001735875,0.000648452,0.00007587926,0.00003257914],"category_scores_gemma":[0.00001576823,0.0001973181,0.0001151746,0.001001101,0.00008245984,0.0001762827,0.0001973454,0.0003074963,0.00005672493],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002642138,"about_ca_system_score_gemma":0.00009017639,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002184881,"about_ca_topic_score_gemma":0.00002508728,"domain_scores_codex":[0.998203,0.00008435948,0.000215871,0.0007025713,0.0003757055,0.0004184869],"domain_scores_gemma":[0.998592,0.0001789879,0.0000702563,0.000852187,0.0001515753,0.0001550296],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0000222824,0.0006170163,0.00007012867,0.00002318618,0.000106098,0.0009632497,0.0006979925,0.0002599748,0.001613867,0.3946868,0.0006478319,0.6002916],"study_design_scores_gemma":[0.005236468,0.002622127,0.01178371,0.0008653505,0.0001213665,0.001551506,0.000525197,0.3000088,0.3012813,0.2680196,0.1042856,0.003698852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07679539,0.0004582953,0.9137424,0.002741887,0.001105149,0.0002187738,0.00001781393,0.0006450865,0.004275242],"genre_scores_gemma":[0.2042126,0.0000943082,0.7925908,0.002022875,0.0002157743,0.00001834502,0.00003400411,0.00003899873,0.0007722447],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5965927,"threshold_uncertainty_score":0.8046399,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02525317334317673,"score_gpt":0.2192488803682884,"score_spread":0.1939957070251116,"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."}}