{"id":"W4408882635","doi":"10.1007/s00236-025-00486-y","title":"The thief orienteering problem on 2-terminal series–parallel graphs","year":2025,"lang":"en","type":"article","venue":"Acta Informatica","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Mount Royal University; Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Orienteering; Terminal (telecommunication); Theory of computation; Computer science; Series (stratigraphy); GRASP; Mathematics; Combinatorics; Theoretical computer science; Mathematical optimization; Algorithm; Computer network; Programming language","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.0001388002,0.0001296649,0.0001006405,0.00008543042,0.0002251739,0.0001704063,0.0002195611,0.00005558242,0.00003584435],"category_scores_gemma":[0.00002714081,0.00009327379,0.0000425799,0.0002607818,0.00004071775,0.0003336033,0.00003861338,0.000188869,0.00008249615],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002993995,"about_ca_system_score_gemma":0.00002070836,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001349493,"about_ca_topic_score_gemma":0.000003844596,"domain_scores_codex":[0.9992762,0.000008241188,0.0002943469,0.00005697987,0.0001257284,0.0002384799],"domain_scores_gemma":[0.9995707,0.0000672014,0.0000321281,0.0002569709,0.00003246838,0.0000405374],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001030231,0.00004729947,0.0003085824,0.001001586,0.0002630519,0.000005029901,0.005764617,0.3040604,0.00009486004,0.5601162,0.09456857,0.03366682],"study_design_scores_gemma":[0.0005659282,0.00008686281,0.0003227427,0.0002876041,0.00002135699,0.00001650045,0.0003914193,0.1508024,0.0004116306,0.004017377,0.8427519,0.0003242812],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.006875002,0.00008337181,0.01259331,0.001569265,0.001102127,0.0006080107,0.000007045572,0.0008876295,0.9762743],"genre_scores_gemma":[0.9836273,0.0004545532,0.00919801,0.0007741087,0.00003217184,0.0001278927,0.00002328032,0.00003099612,0.005731726],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9767523,"threshold_uncertainty_score":0.3803595,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.004946546587709932,"score_gpt":0.2047632126414121,"score_spread":0.1998166660537022,"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."}}