{"id":"W2967821251","doi":"10.1016/j.tcs.2019.08.017","title":"Perfect Roman domination in graphs","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Saskatchewan","funders":"Science and Engineering Research Board","keywords":"Combinatorics; Mathematics; Chordal graph; Interval graph; Bipartite graph; Vertex (graph theory); Minimum weight; Discrete mathematics; Dominating set; Strong perfect graph theorem; Pathwidth; Graph; 1-planar graph; Line graph","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":[],"consensus_categories":[],"category_scores_codex":[0.002898766,0.0001676356,0.00020858,0.0006847938,0.0001750408,0.0003139021,0.003272192,0.00004984172,0.00008347628],"category_scores_gemma":[0.0001000114,0.0001424018,0.00006467288,0.003111373,0.001716996,0.001331743,0.001193615,0.0003104665,0.0003681784],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009998499,"about_ca_system_score_gemma":0.0001013866,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002657392,"about_ca_topic_score_gemma":0.000001111158,"domain_scores_codex":[0.9969654,0.0002197916,0.0002493405,0.0008931429,0.0009234337,0.0007488791],"domain_scores_gemma":[0.9981132,0.0004119717,0.00004680542,0.001076673,0.0001428771,0.0002085261],"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.00001069002,0.00004618825,0.001041451,0.000005718724,0.000001037146,0.00001124331,0.0002787478,0.0002464002,0.002249182,0.9705756,0.000004553765,0.02552917],"study_design_scores_gemma":[0.0003295284,0.0002131129,0.007329383,0.00002260162,5.10622e-7,0.00001888635,0.000005532763,0.3803791,0.0034101,0.6080825,0.00003500034,0.0001738353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4180675,0.00001580817,0.5737574,0.0003664832,0.0003491738,0.0002615231,2.884813e-7,0.0001148309,0.007067007],"genre_scores_gemma":[0.9396346,0.000003009854,0.06009512,0.0002038502,0.0000220018,0.000009480695,3.5514e-7,0.000007513973,0.00002408904],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5215671,"threshold_uncertainty_score":0.6326342,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007997550992975874,"score_gpt":0.274766509484722,"score_spread":0.2667689584917461,"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."}}