{"id":"W1986858995","doi":"10.1016/j.dam.2011.07.004","title":"Randomized algorithms and upper bounds for multiple domination in graphs and networks","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"ca_institutions":"Acadia University","funders":"","keywords":"Mathematics; Domination analysis; Upper and lower bounds; Combinatorics; Dominating set; Randomized algorithm; Tuple; Graph; Discrete mathematics; Algorithm; Vertex (graph theory)","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01770608,0.006631063,0.007277538,0.007353842,0.006825477,0.01521842,0.0181621,0.007588569,0.02126116],"category_scores_gemma":[0.1040614,0.004220369,0.005577785,0.0127066,0.01280671,0.03619957,0.0155342,0.02240966,0.003680976],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0156623,"about_ca_system_score_gemma":0.009683134,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006100632,"about_ca_topic_score_gemma":0.01127939,"domain_scores_codex":[0.9765609,0.00843876,0.0009257957,0.004945444,0.0053534,0.003775778],"domain_scores_gemma":[0.8213705,0.1474546,0.006743875,0.01408252,0.005349272,0.004999102],"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.001815229,0.001218483,0.002411175,0.001451883,0.0004313155,0.0001616175,0.0008430448,0.2626635,0.00303516,0.6081384,0.03484639,0.0829838],"study_design_scores_gemma":[0.0002762147,0.00009821107,0.0004369117,0.0001387777,0.0001727458,0.0001155621,0.000130616,0.384417,0.001392036,0.6083468,0.004394001,0.00008108532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0383848,0.01137689,0.8908383,0.0144957,0.001224638,0.0006273899,0.001895909,0.002290303,0.03886608],"genre_scores_gemma":[0.5336752,0.01058421,0.403898,0.006089756,0.004788639,0.003075908,0.003839626,0.003062158,0.0309865],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02126116,"threshold_uncertainty_score":0.1136385,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02782976408193505,"score_gpt":0.2457143103930917,"score_spread":0.2178845463111567,"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."}}