{"id":"W6891559455","doi":"10.4230/lipics.disc.2022.40","title":"Brief Announcement: Distributed Algorithms for Minimum Dominating Set Problem and Beyond, a New Approach","year":2022,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Dominating set; Set cover problem; Set (abstract data type); Connected dominating set; Cover (algebra); Distributed algorithm","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.003539425,0.001315128,0.001521108,0.001804491,0.001223209,0.003577638,0.002508127,0.002879001,0.004942561],"category_scores_gemma":[0.006149977,0.000764833,0.001387759,0.003352582,0.002364527,0.01087086,0.001967722,0.007423069,0.002280147],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002461426,"about_ca_system_score_gemma":0.001738661,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001306827,"about_ca_topic_score_gemma":0.0009041775,"domain_scores_codex":[0.9977842,0.0006482023,0.0001516083,0.0005627795,0.0007094013,0.0001438483],"domain_scores_gemma":[0.9966419,0.001803323,0.00009258756,0.0004227142,0.0007690562,0.0002705208],"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.0001841209,0.0001188535,0.0003865748,0.001055751,0.0001076944,0.0001652924,0.0002104778,0.0210377,0.002085768,0.5848895,0.1095212,0.280237],"study_design_scores_gemma":[0.00008731578,0.000183231,0.0002728347,0.0002516826,0.00007591063,0.0005250274,0.0001567255,0.09474245,0.001411507,0.5033913,0.3988347,0.00006738053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002108528,0.05333692,0.8863791,0.02712143,0.01659524,0.0001138664,0.0002061538,0.0004524626,0.01368622],"genre_scores_gemma":[0.1190313,0.1024769,0.6762171,0.01295453,0.04683123,0.0005931022,0.00126672,0.000650798,0.03997834],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004942561,"threshold_uncertainty_score":0.01871848,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03013473362047713,"score_gpt":0.2921644039674968,"score_spread":0.2620296703470197,"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."}}