{"id":"W3136251153","doi":"10.48550/arxiv.2103.08061","title":"On distributed algorithms for minimum dominating set problem and beyond","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Dominating set; Set cover problem; Distributed algorithm; Algorithm; Computer science; Connected dominating set; Set (abstract data type); Upper and lower bounds; Graph; Theory of computation; Approximation algorithm; Cover (algebra); Randomized algorithm; Mathematics; Theoretical computer science; Distributed computing","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.003513147,0.001641419,0.002201709,0.00155067,0.001695112,0.002711753,0.003077013,0.002233432,0.003989822],"category_scores_gemma":[0.01224623,0.0007319319,0.001546651,0.003263147,0.002350444,0.007003891,0.003556071,0.00426679,0.0009818139],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003266425,"about_ca_system_score_gemma":0.002252585,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002535623,"about_ca_topic_score_gemma":0.001765345,"domain_scores_codex":[0.9963422,0.001375566,0.0001955664,0.0009439993,0.0008358149,0.0003067685],"domain_scores_gemma":[0.9921119,0.005768899,0.0003430581,0.0009545445,0.0006003123,0.00022118],"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.0002727964,0.0001686575,0.0005819465,0.0006969814,0.0001315149,0.0001279055,0.0004283189,0.3889346,0.002264799,0.4679284,0.01333809,0.125126],"study_design_scores_gemma":[0.00007415886,0.00007810568,0.0001395963,0.00007034784,0.00002485684,0.0001260966,0.00007361852,0.5558906,0.0009919758,0.4278165,0.01468756,0.00002662653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004908836,0.002554325,0.9832045,0.001892699,0.0003019462,0.0001393996,0.0000973474,0.000289409,0.006611428],"genre_scores_gemma":[0.2512834,0.005396587,0.7306842,0.001409467,0.0009709026,0.0008298781,0.0006367723,0.0003909004,0.008397948],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003989822,"threshold_uncertainty_score":0.0236997,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07399647599064386,"score_gpt":0.2143383928248311,"score_spread":0.1403419168341872,"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."}}