{"id":"W3143897082","doi":"10.1007/s10878-021-00757-7","title":"The Steiner cycle and path cover problem on interval graphs","year":2021,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Surrey Memorial Hospital; Simon Fraser University; Fraser Health","funders":"Austrian Science Fund; TU Graz, Internationale Beziehungen und Mobilitätsprogramme","keywords":"Steiner tree problem; Combinatorics; Mathematics; Hamiltonian path; Path (computing); Cover (algebra); Longest path problem; Discrete mathematics; Set cover problem; Dominating set; Graph; Shortest path problem; Computer science; Set (abstract data type); Vertex (graph theory)","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":[],"consensus_categories":[],"category_scores_codex":[0.0002289969,0.00007693982,0.000123632,0.00004477258,0.00006105569,0.0000944564,0.00007081233,0.00005775041,0.00001148277],"category_scores_gemma":[0.0000673608,0.00005489175,0.00005044012,0.0001179625,0.00001658541,0.0001613231,0.00001411294,0.0001627733,9.163879e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003422474,"about_ca_system_score_gemma":0.00002766594,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.815476e-7,"about_ca_topic_score_gemma":6.040919e-8,"domain_scores_codex":[0.9993974,0.00004823038,0.0002506839,0.00004900559,0.0001681799,0.00008647823],"domain_scores_gemma":[0.9995356,0.00006758835,0.00008659248,0.00007837353,0.000179065,0.00005282153],"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.0001781656,0.0001753274,0.0002699506,0.000065869,0.0002040762,0.00007238765,0.0004184994,0.8813657,0.003021516,0.07648116,0.02655834,0.01118907],"study_design_scores_gemma":[0.008316739,0.002944125,0.0005563055,0.0009013647,0.0002571973,0.000409267,0.0002763932,0.6125945,0.04748416,0.2817685,0.04347459,0.001016839],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1175869,0.005320538,0.8298059,0.002071121,0.01881041,0.0008240671,0.00001320088,0.000522482,0.02504541],"genre_scores_gemma":[0.9874281,0.001198894,0.01100504,0.00004902453,0.0002338856,0.00000309406,0.0000022503,0.00002524962,0.00005448513],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8698412,"threshold_uncertainty_score":0.223842,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.004398170932766899,"score_gpt":0.1978950734039759,"score_spread":0.193496902471209,"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."}}