{"id":"W2281619726","doi":"","title":"The Connected Domination and Tree Domination of P(n,k) for k = 1, 2, [n/2]","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Tree (set theory); Domination analysis; Graph","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005366975,0.0003877466,0.0003131014,0.002031815,0.002177839,0.003065198,0.001321311,0.001135379,0.01142381],"category_scores_gemma":[0.005675618,0.0003988128,0.0005401308,0.00201444,0.002022177,0.00261737,0.001705171,0.001240349,0.0007766766],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001135465,"about_ca_system_score_gemma":0.0009065234,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003231552,"about_ca_topic_score_gemma":0.004232671,"domain_scores_codex":[0.9992505,0.0001564972,0.00003421587,0.0001720827,0.0001997385,0.0001870119],"domain_scores_gemma":[0.9965663,0.001715592,0.0005343727,0.0002738142,0.0003979372,0.000511929],"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.0005931417,0.00006652276,0.002937807,0.0001731849,0.00004082565,0.0006481354,0.001821026,0.00714367,0.008352844,0.9505875,0.005974537,0.02166085],"study_design_scores_gemma":[0.00008352689,0.00003233774,0.004884521,0.00005028467,0.0000403235,0.0009252037,0.0004723608,0.03329006,0.003639568,0.9462158,0.01031746,0.00004855183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8027562,0.0007322797,0.05160835,0.001727786,0.00008547585,0.0001550411,0.001417207,0.0002180283,0.1412996],"genre_scores_gemma":[0.9586015,0.0004246675,0.01226349,0.0002065329,0.00006862704,0.0001665425,0.00111113,0.0001197666,0.0270376],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01142381,"threshold_uncertainty_score":0.03821641,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02436807322774128,"score_gpt":0.2716758538431672,"score_spread":0.2473077806154259,"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."}}