{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005969375,0.001045078,0.001233884,0.0009027721,0.001101763,0.002044138,0.001459714,0.002170968,0.01343059],"category_scores_gemma":[0.002919667,0.0005474866,0.0008215538,0.001891922,0.001098838,0.003248504,0.001398562,0.002051484,0.001073744],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009050727,"about_ca_system_score_gemma":0.0006070226,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00240454,"about_ca_topic_score_gemma":0.001732359,"domain_scores_codex":[0.9995835,0.0001036038,0.00002068316,0.0001063563,0.00006927756,0.0001165475],"domain_scores_gemma":[0.9987242,0.00071854,0.0001439903,0.0001520933,0.00009942707,0.0001618562],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005179456,0.0002976017,0.0009842613,0.0004854599,0.00007251029,0.001033592,0.0003498544,0.3133665,0.007505259,0.5587986,0.02413201,0.09245649],"study_design_scores_gemma":[0.00007747914,0.0001248084,0.0006181098,0.00005404625,0.00003502966,0.000432879,0.0002842972,0.436996,0.003821583,0.5476769,0.00984686,0.00003205031],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4621255,0.0008320725,0.4291863,0.002450683,0.0003649994,0.0002018954,0.001340498,0.000388839,0.1031092],"genre_scores_gemma":[0.8153333,0.001427854,0.1250318,0.000421252,0.0002642445,0.0001948644,0.001886371,0.00036377,0.05507658],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01343059,"threshold_uncertainty_score":0.0449298,"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."}}