{"id":"W1586356312","doi":"10.1007/978-3-319-12691-3_22","title":"Algorithms for Cut Problems on Trees","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Regina; University of Alberta","funders":"","keywords":"Parameterized complexity; Combinatorics; Running time; Time complexity; Tree (set theory); Mathematics; Constant (computer programming); Polynomial; Computer science; Discrete mathematics; Algorithm","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","open_science"],"consensus_categories":[],"category_scores_codex":[0.00167274,0.0006298475,0.0006301291,0.001248364,0.0003865212,0.0005360484,0.005471446,0.0003310464,0.00001144289],"category_scores_gemma":[0.0002155501,0.0005409229,0.0002237096,0.0006580674,0.0009920916,0.0004065643,0.001175612,0.0009032,0.00007398688],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002712886,"about_ca_system_score_gemma":0.0003564942,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005320024,"about_ca_topic_score_gemma":0.00005867475,"domain_scores_codex":[0.9948571,0.000054172,0.0005054863,0.002175625,0.001324484,0.001083098],"domain_scores_gemma":[0.9954154,0.001613149,0.0002650932,0.002083755,0.0003670685,0.0002555079],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001081614,0.00002165729,0.000003319152,0.00003895905,0.000007952259,0.00001377975,0.0002447572,0.03896514,0.00008808585,0.2008804,0.00003036995,0.7596948],"study_design_scores_gemma":[0.0003176927,0.000609619,0.000009311952,0.0002851496,0.00000289276,0.0000208832,4.862081e-8,0.4089937,0.001259939,0.5775509,0.01042897,0.000520829],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000007439971,0.0001939788,0.9922259,0.000909221,0.001358337,0.001078958,0.00001060151,0.0002235708,0.00399198],"genre_scores_gemma":[0.0325801,0.00005696398,0.9598045,0.002426541,0.001178154,0.0001404826,0.00001210517,0.000117588,0.003683511],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7591739,"threshold_uncertainty_score":0.9999094,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03428784771039901,"score_gpt":0.2979919124767282,"score_spread":0.2637040647663292,"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."}}