{"id":"W4309783453","doi":"10.1007/s00453-022-01062-3","title":"On the Tractability of Covering a Graph with 2-Clubs","year":2022,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Sherbrooke","funders":"Università degli studi di Bergamo","keywords":"Algorithm; Parameterized complexity; Graph; Computer science; Club; Artificial intelligence; Combinatorics; Mathematics; Geology","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.0006722957,0.00008504599,0.0001115246,0.00008445825,0.0002784955,0.00002264735,0.001172067,0.00001129539,0.00009656982],"category_scores_gemma":[0.00005868065,0.00005591994,0.00005611541,0.0008083603,0.0001463049,0.0001321598,0.0003977174,0.0003180658,0.000004984135],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004051108,"about_ca_system_score_gemma":0.00005676978,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001594569,"about_ca_topic_score_gemma":0.000001788796,"domain_scores_codex":[0.9985979,0.0002136417,0.0001255031,0.0002809228,0.0005549916,0.0002270423],"domain_scores_gemma":[0.9983805,0.0006743923,0.00006555951,0.0007856586,0.00005055148,0.0000432849],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001679788,0.0003653188,0.0002284396,0.00001391588,0.00006140103,0.00003700354,0.001283937,0.005000609,0.001937331,0.9479812,0.0002969744,0.04262594],"study_design_scores_gemma":[0.001246901,0.00284517,0.004558074,0.00002624388,0.0000122656,0.000116782,0.0006969245,0.06500359,0.03234965,0.8872211,0.005368319,0.0005550041],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4433635,0.00007122974,0.5495349,0.002452781,0.0001586893,0.0005724252,0.00002651705,0.0001304901,0.003689497],"genre_scores_gemma":[0.9921213,0.000001380943,0.007537176,0.0001730955,0.000008297688,0.0000813713,6.644889e-7,0.000007806537,0.0000688625],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5487579,"threshold_uncertainty_score":0.2280349,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01420126211002945,"score_gpt":0.2454591080255627,"score_spread":0.2312578459155332,"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."}}