{"id":"W2224651063","doi":"10.22215/etd/2007-06323","title":"On improving FPT K-VERTEX COVER with applications to some combinatorial problems","year":2007,"lang":"en","type":"dissertation","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University; Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Cover (algebra); Vertex (graph theory); Vertex cover; Combinatorics; Mathematics; Computer science; Engineering; Time complexity; Mechanical engineering","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.0001683545,0.0003113086,0.0002656373,0.0002463139,0.0002355954,0.0003090377,0.001141735,0.0002155705,0.00004068528],"category_scores_gemma":[0.00001271833,0.0002345835,0.0000540312,0.0004286177,0.00001145321,0.0005139587,0.0001519744,0.0003206289,0.000404553],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009130735,"about_ca_system_score_gemma":0.000193124,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001839259,"about_ca_topic_score_gemma":0.00004303276,"domain_scores_codex":[0.997893,0.00001697015,0.0002891584,0.0008000611,0.0006521755,0.0003485914],"domain_scores_gemma":[0.9983644,0.00009485013,0.0001814852,0.0009773588,0.0001843789,0.0001975336],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00009794541,0.0003256494,0.000004554549,0.0001290554,0.00003288349,0.000009138656,0.000350348,0.0002875316,0.0006500933,0.8295952,0.01279735,0.1557202],"study_design_scores_gemma":[0.01041452,0.007643369,0.004045085,0.003039983,0.0002565752,0.00005057646,0.0005450147,0.136871,0.02845734,0.2592625,0.5401579,0.009256185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00104984,0.00006221985,0.9731924,0.00007370883,0.001867176,0.001487266,0.0000206217,0.0003335422,0.02191326],"genre_scores_gemma":[0.2080432,0.0001048298,0.5961383,0.007959096,0.004500286,0.005056074,0.009501748,0.0006460106,0.1680505],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5703326,"threshold_uncertainty_score":0.9566038,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00863670814053174,"score_gpt":0.2656693011958386,"score_spread":0.2570325930553068,"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."}}