{"id":"W2588377248","doi":"10.1016/j.dam.2017.01.012","title":"Deterministic distributed construction of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"mml3\" display=\"inline\" overflow=\"scroll\" altimg=\"si3.gif\"><mml:mi>T</mml:mi></mml:math>-dominating sets in time <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"mml4\" display=\"inline\" overflow=\"scroll\" altimg=\"si3.gif\"><mml:mi>T</mml:mi></mml:math>","year":2017,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec en Outaouais","keywords":"Mathematics; Dominating set; Combinatorics; Upper and lower bounds; Hypergraph; Disjoint sets; Graph; Discrete mathematics; Binary logarithm; Vertex (graph theory)","routes":{"ca_aff":true,"ca_fund":true,"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.002195714,0.0008722583,0.00113367,0.001174256,0.002091737,0.00289371,0.003059546,0.001237359,0.01706741],"category_scores_gemma":[0.01026929,0.0008044005,0.002073411,0.001909576,0.00133304,0.003503309,0.004871024,0.001983759,0.003945349],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002807435,"about_ca_system_score_gemma":0.003907892,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003367161,"about_ca_topic_score_gemma":0.007061949,"domain_scores_codex":[0.9970934,0.0006784554,0.0001785629,0.0008905635,0.000695444,0.0004635877],"domain_scores_gemma":[0.9910581,0.004115461,0.000305653,0.002514337,0.001183958,0.0008225928],"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.001618698,0.0008733206,0.004403489,0.001718057,0.0002549986,0.0004775272,0.001225928,0.1942618,0.03237585,0.4107764,0.09986723,0.2521467],"study_design_scores_gemma":[0.0003805345,0.0002986014,0.001616351,0.0001161924,0.0001758498,0.0003494424,0.0005324409,0.5073081,0.02527754,0.4223163,0.04153453,0.0000940997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05087213,0.000243091,0.9178138,0.001938835,0.0002574401,0.0007491566,0.003032613,0.0042893,0.02080358],"genre_scores_gemma":[0.353509,0.0002820346,0.6116837,0.000511879,0.00009963567,0.0009045707,0.0077317,0.001500153,0.02377736],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01706741,"threshold_uncertainty_score":0.05709612,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01854931552203832,"score_gpt":0.2546052673358363,"score_spread":0.236055951813798,"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."}}