{"id":"W4205439189","doi":"10.17771/pucrio.acad.51356","title":"THE MULTI-PERIOD PRIZE-COLLECTING STEINER TREE PROBLEM WITH BUDGET CONSTRAINTS","year":2019,"lang":"en","type":"dissertation","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Centre interuniversitaire de recherche sur les reseaux d'entreprise, la logistique et le transport","keywords":"Steiner tree problem; Benchmark (surveying); Period (music); Combinatorics; Tree (set theory); Revenue; Time horizon; Mathematics; Mathematical optimization; Computer science; Geography; Economics; Cartography; Physics","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003650245,0.0003877446,0.0003494489,0.0001443269,0.0007256182,0.0008061789,0.00157811,0.0001807797,0.00004881709],"category_scores_gemma":[0.00003886526,0.0002326067,0.0001404839,0.0004978475,0.0001448312,0.0002561556,0.0001289781,0.0005367261,0.00006295769],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004757783,"about_ca_system_score_gemma":0.0004657326,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000532858,"about_ca_topic_score_gemma":0.002069241,"domain_scores_codex":[0.9978193,0.0000832168,0.0003886697,0.0007066538,0.0005137466,0.000488393],"domain_scores_gemma":[0.9982852,0.000238584,0.0002984686,0.0008444518,0.0002488615,0.0000844557],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001266606,0.0003266611,0.0005996032,0.0003586089,0.0005107423,0.00006295285,0.01294438,0.00006341052,0.0004334589,0.1566065,0.002677456,0.8252896],"study_design_scores_gemma":[0.02508133,0.005410416,0.027199,0.005802358,0.0006019251,0.001225493,0.05004853,0.6754298,0.01453123,0.03321883,0.1465514,0.01489966],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007687375,0.0008359479,0.510778,0.001772638,0.005169829,0.004951598,0.00004064715,0.001378079,0.4673859],"genre_scores_gemma":[0.05815783,0.00005549794,0.5970607,0.0002706365,0.0001899825,0.0003051095,0.0001903553,0.0001026995,0.3436672],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8103899,"threshold_uncertainty_score":0.9485428,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01859464823067754,"score_gpt":0.257944092199948,"score_spread":0.2393494439692704,"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."}}