{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003292618,0.0003723944,0.0004283906,0.0002220929,0.0003523506,0.0003640541,0.001236625,0.000268349,0.0000107601],"category_scores_gemma":[0.00006987725,0.000439568,0.0002456847,0.0005622408,0.000151778,0.0003032421,0.002263604,0.0005275765,0.000003612681],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001206282,"about_ca_system_score_gemma":0.0001526773,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003760349,"about_ca_topic_score_gemma":0.00002426891,"domain_scores_codex":[0.9976556,0.0001139662,0.0002394957,0.001438732,0.0001165261,0.0004357272],"domain_scores_gemma":[0.9979289,0.0004902429,0.0002457934,0.0009173286,0.0002333094,0.0001844056],"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.00007205876,0.0003741243,0.0002894316,0.0005661015,0.0003303445,0.0006090844,0.00142602,0.03528769,0.0000517893,0.9406462,0.00145301,0.01889415],"study_design_scores_gemma":[0.0008234215,0.0001328617,0.0001461845,0.0001598181,0.00005188012,0.00001012434,0.0002256885,0.724312,0.0001393304,0.2731765,0.0003201142,0.000502106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08425117,0.00007933352,0.9130908,0.0002527649,0.0005588475,0.0005509366,0.0002717718,0.0001835479,0.0007608728],"genre_scores_gemma":[0.928602,0.00007561144,0.07039835,0.0001669152,0.00009032815,0.000007485683,0.0002479518,0.00002251919,0.000388817],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8443509,"threshold_uncertainty_score":0.9998056,"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."}}