{"id":"W1988192783","doi":"10.5784/23-1-46","title":"An algorithm for the (r,s)-domination number of a tree","year":2007,"lang":"en","type":"article","venue":"Orion/ORiON","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Neighbourhood (mathematics); Combinatorics; Vertex (graph theory); Mathematics; Graph; Function (biology); Tree (set theory); Domination analysis; Discrete mathematics; Algorithm","routes":{"ca_aff":true,"ca_fund":true,"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.001853819,0.0001197626,0.0001379863,0.000123277,0.0002180331,0.00005716931,0.0008742768,0.00007434012,0.00001876438],"category_scores_gemma":[0.0001011149,0.00008899286,0.0000907212,0.0006319215,0.00009553463,0.000641333,0.0001005713,0.0001353203,0.00002514017],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006990836,"about_ca_system_score_gemma":0.0000497723,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002293094,"about_ca_topic_score_gemma":0.00003968937,"domain_scores_codex":[0.9985444,0.0000781237,0.0002567056,0.0003261841,0.0004470253,0.0003475863],"domain_scores_gemma":[0.9981377,0.0006418681,0.0001322809,0.0006985458,0.0003005342,0.00008909273],"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.00003631151,0.00007991178,0.0002012923,0.000006931098,0.000009752043,0.00000253018,0.0004155743,0.00002746506,0.003104398,0.1307778,0.0001279642,0.8652101],"study_design_scores_gemma":[0.003623571,0.001098376,0.0165932,0.00007027316,0.00004075001,0.00008590501,0.0006958327,0.4750745,0.1134659,0.3353546,0.0531502,0.0007468241],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01008604,0.00007260128,0.98773,0.0003191459,0.0004652454,0.0004260035,0.000005261293,0.00006727561,0.0008283793],"genre_scores_gemma":[0.6257409,0.00005042103,0.3725206,0.0001049493,0.0004301573,0.0000742027,0.00001417453,0.00002911752,0.001035437],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8644632,"threshold_uncertainty_score":0.3629023,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02119826534912793,"score_gpt":0.3456694556178839,"score_spread":0.324471190268756,"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."}}