{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.002569886,0.001657748,0.001364438,0.0005413708,0.002426754,0.002091896,0.004431105,0.001641949,0.00009525734],"category_scores_gemma":[0.001486319,0.002015822,0.00143072,0.001090084,0.002135917,0.001860333,0.003860033,0.001961352,0.001342059],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009853276,"about_ca_system_score_gemma":0.0009306259,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003447578,"about_ca_topic_score_gemma":0.0002530814,"domain_scores_codex":[0.9887263,0.0002292698,0.003227391,0.002410456,0.002915464,0.002491138],"domain_scores_gemma":[0.9883413,0.00196818,0.003993796,0.004552436,0.0002690636,0.0008752209],"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.0004595416,0.000720978,0.0000226438,0.00185642,0.000657707,0.0006008773,0.002398525,0.001132211,0.003158905,0.9849125,0.0004245896,0.003655142],"study_design_scores_gemma":[0.002770221,0.0007002674,0.0001492334,0.001753248,0.000746514,0.0009802862,0.00118685,0.9667006,0.01134725,0.0110664,0.000887766,0.001711353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9640515,0.0002383543,0.02800993,0.0003287545,0.001675054,0.0004152705,0.001334757,0.0005719802,0.003374394],"genre_scores_gemma":[0.9326298,0.0002798136,0.06312395,0.0004378524,0.0008356522,0.0008524445,0.001287379,0.0004682125,0.00008493427],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9738461,"threshold_uncertainty_score":0.9996541,"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."}}