{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008488395,0.0001883378,0.0004419201,0.0001575687,0.0001333761,0.0001245269,0.00028277,0.00008750363,0.000003457971],"category_scores_gemma":[0.00006312336,0.0001587268,0.00007735149,0.0002221639,0.0002251257,0.0001937979,0.0001924144,0.0001107116,8.173169e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009602354,"about_ca_system_score_gemma":0.000009518852,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000152251,"about_ca_topic_score_gemma":0.00001442563,"domain_scores_codex":[0.9988589,0.00002538437,0.0003750263,0.0003361937,0.000135162,0.0002693697],"domain_scores_gemma":[0.9988229,0.0006373257,0.0001329676,0.0002993451,0.00003336897,0.00007405344],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004291685,0.00007189228,0.00004256733,0.00008115851,0.0000277326,0.000001160123,0.005223055,0.000008057102,0.00003221588,0.9762161,0.00001929655,0.01784765],"study_design_scores_gemma":[0.01980994,0.00001803573,0.000144305,0.00002315758,0.00001568024,0.000005054811,0.0001750178,0.5059856,0.0001256536,0.4735145,0.00002607062,0.0001570298],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01985526,0.0001903192,0.976873,0.00005195129,0.00009508082,0.001058758,0.000004309639,0.00008262883,0.001788686],"genre_scores_gemma":[0.3879579,0.00009609079,0.6115417,0.0000597429,0.00001528373,0.0002894007,0.000006031404,0.00001373589,0.00002015715],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5059775,"threshold_uncertainty_score":0.6472691,"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."}}