{"id":"W4403268005","doi":"10.1016/j.tcs.2024.114900","title":"Algorithms for the thief orienteering problem on directed acyclic graphs","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"Hewlett-Packard (Canada); Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Orienteering; Directed acyclic graph; Computer science; Combinatorics; Mathematics; Directed graph; Theoretical computer science; Algorithm; Mathematical optimization","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":[],"consensus_categories":[],"category_scores_codex":[0.001372687,0.0001388176,0.0001095507,0.0001271987,0.0002677456,0.0003465816,0.000563754,0.00003770653,0.00001881524],"category_scores_gemma":[0.00008785728,0.00009095445,0.0000603927,0.001125682,0.0006903168,0.000137456,0.0001057663,0.0002055393,0.00001884734],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005057426,"about_ca_system_score_gemma":0.00002300829,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.249317e-7,"about_ca_topic_score_gemma":7.788539e-8,"domain_scores_codex":[0.9987762,0.00003824441,0.0001731183,0.0003278899,0.0003052634,0.0003793157],"domain_scores_gemma":[0.998584,0.0009502848,0.000009688089,0.0003026956,0.00006277819,0.00009057976],"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.000002832454,0.000006720777,0.00000315399,0.00002917757,0.00001016286,0.000001551613,0.0003248805,0.1419109,0.000390213,0.7640412,0.0001016453,0.09317758],"study_design_scores_gemma":[0.00006877878,0.00005636549,0.00006575706,0.00006730098,0.000009177382,0.000006817439,0.000004050284,0.9653233,0.002969291,0.03056021,0.0007447116,0.0001241896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003479007,0.0001048591,0.9914302,0.0003832743,0.00130428,0.0002949578,0.000003548433,0.001379083,0.001620759],"genre_scores_gemma":[0.6274757,0.00001195753,0.3722167,0.00008614499,0.0001385838,0.00003311914,7.874376e-7,0.00002540301,0.00001168327],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8234125,"threshold_uncertainty_score":0.3709015,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01480756759879641,"score_gpt":0.2794228516752325,"score_spread":0.2646152840764361,"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."}}