{"id":"W7110209134","doi":"10.4230/lipics.approx/random.2025.1","title":"Approximation Schemes for Orienteering and Deadline TSP in Doubling Metrics","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Orienteering; Bounded function; Travelling salesman problem; Hamiltonian path; Treewidth; Dimension (graph theory); Path (computing); Graph","routes":{"ca_aff":true,"ca_fund":true,"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.0008484504,0.0002644528,0.0003621948,0.000947629,0.0003051534,0.0005293696,0.0007694921,0.0001442799,0.000001804175],"category_scores_gemma":[0.0002689591,0.0002609068,0.0001328493,0.001261568,0.00007211565,0.00161514,0.0005080148,0.0002643456,0.000002805294],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001024145,"about_ca_system_score_gemma":0.00006702151,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001159519,"about_ca_topic_score_gemma":0.00001750644,"domain_scores_codex":[0.9980015,0.00001656786,0.000884989,0.0002971186,0.0002660574,0.0005338283],"domain_scores_gemma":[0.9986522,0.0003150839,0.0002224445,0.0004729693,0.0002483093,0.0000889967],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001125501,0.0003766757,0.008744206,0.002217245,0.0001424325,0.000002095336,0.005930785,0.0004081383,0.00006493876,0.7606542,0.0007418277,0.220605],"study_design_scores_gemma":[0.003289719,0.0001061461,0.0004738994,0.0002421793,0.00001776343,0.000009060816,0.0005115586,0.9139563,0.00138386,0.01627097,0.06338823,0.0003503054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05830323,0.0001626964,0.9384294,0.0003959425,0.0007292962,0.001056473,0.00006912473,0.0001466813,0.0007071182],"genre_scores_gemma":[0.4328352,0.00006802287,0.5656902,0.0006898898,0.00008379087,0.0002916861,0.0001687273,0.00002136167,0.0001511072],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9135482,"threshold_uncertainty_score":0.9999843,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01875167200096725,"score_gpt":0.2838451202113926,"score_spread":0.2650934482104254,"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."}}