{"id":"W4379118138","doi":"10.1007/978-3-031-34347-6_8","title":"A Polynomial-Time Approximation Scheme for Thief Orienteering on Directed Acyclic Graphs","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Regina; Western University","funders":"","keywords":"Knapsack problem; Orienteering; Polynomial-time approximation scheme; Combinatorics; Vertex (graph theory); Approximation algorithm; Mathematics; Directed graph; Discrete mathematics; Time complexity; Mathematical optimization; Computer science; Graph","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.0002987247,0.0003342315,0.0003052196,0.0007178957,0.0001286792,0.0001784728,0.0004380817,0.0002416486,0.00001848623],"category_scores_gemma":[0.00007842828,0.0003341091,0.00009332854,0.0004911452,0.0001145763,0.0001389859,0.00008842906,0.0003600814,0.00006322735],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001412495,"about_ca_system_score_gemma":0.00005049692,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002601974,"about_ca_topic_score_gemma":0.000007759485,"domain_scores_codex":[0.998445,0.000006863739,0.0003063232,0.0005370426,0.0003298572,0.0003749188],"domain_scores_gemma":[0.9991094,0.0002686999,0.00007983175,0.0003809572,0.00008584745,0.00007527579],"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.00000882708,0.000008378198,0.000007773054,0.0001304621,0.00001990271,0.000002846559,0.0004021769,0.9356293,0.001074519,0.0009114972,0.0003357416,0.06146858],"study_design_scores_gemma":[0.0002351549,0.00005738971,0.00001359144,0.0004033292,0.000006068636,0.000002850278,6.376992e-8,0.9906532,0.001763155,0.004462767,0.00202058,0.0003818492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001607429,0.00005577624,0.9917074,0.0001043731,0.001860585,0.0006116586,0.0000200168,0.001204462,0.004274999],"genre_scores_gemma":[0.07707985,0.0002177757,0.9130453,0.0009767283,0.001463537,0.0002058903,0.0003651374,0.0006278801,0.006017909],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0786621,"threshold_uncertainty_score":0.9999111,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0156756127671737,"score_gpt":0.2234739703599969,"score_spread":0.2077983575928233,"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."}}