{"id":"W2950683345","doi":"10.1007/978-3-642-32512-0_10","title":"Approximating Minimum-Cost Connected T-Joins","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Approximation algorithm; Combinatorics; Rounding; Steiner tree problem; Degree (music); Undirected graph; Mathematics; Discrete mathematics; Graph; Connected dominating set; Computer science; Physics","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.001339103,0.000756795,0.0007770144,0.001112595,0.0005315674,0.0007771216,0.004881083,0.0004170809,0.00008002095],"category_scores_gemma":[0.0001795857,0.000725149,0.00023814,0.001115238,0.001027816,0.001004323,0.002420016,0.001299515,0.0001324352],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002813269,"about_ca_system_score_gemma":0.0004601554,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000228201,"about_ca_topic_score_gemma":0.00005299326,"domain_scores_codex":[0.9948335,0.00005793503,0.0008297634,0.001766697,0.001251088,0.001261042],"domain_scores_gemma":[0.9959993,0.0008647016,0.0004791261,0.002016449,0.0002874776,0.0003529083],"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.000003020392,0.00005327263,0.00004032287,0.00005143563,0.00001618576,0.00005109257,0.001085512,0.001821795,0.000130605,0.09488796,0.0000317069,0.9018271],"study_design_scores_gemma":[0.0004235439,0.0001350106,0.0001446349,0.0005170791,0.00001495475,0.0002017163,4.330745e-7,0.7051721,0.001268644,0.2845777,0.006208533,0.001335731],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00007185571,0.0008816129,0.9873773,0.0005351464,0.002776972,0.0006324821,0.00001210484,0.0003958544,0.007316656],"genre_scores_gemma":[0.06895236,0.0000569562,0.9276145,0.001682483,0.001241786,0.00002929005,0.00001609653,0.00006510987,0.0003414043],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9004914,"threshold_uncertainty_score":0.9995199,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03168321393909158,"score_gpt":0.252427819317922,"score_spread":0.2207446053788304,"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."}}