{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001523326,0.0004513894,0.0009258245,0.002198639,0.003150885,0.004608625,0.001069511,0.001103829,0.009441176],"category_scores_gemma":[0.008377557,0.0006126597,0.0005298952,0.00232281,0.00375551,0.004542018,0.002317075,0.001839269,0.001024518],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001259229,"about_ca_system_score_gemma":0.0008773283,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001342971,"about_ca_topic_score_gemma":0.001437243,"domain_scores_codex":[0.9979842,0.000760655,0.00006505821,0.0002937193,0.0004235993,0.0004727376],"domain_scores_gemma":[0.9945012,0.003078261,0.0006408889,0.0005568458,0.0005162967,0.0007064067],"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.00007196404,0.00001530899,0.0004347384,0.00003522862,0.000007044279,0.00006693842,0.0003251834,0.0009962508,0.0003941644,0.9913856,0.001592647,0.004674986],"study_design_scores_gemma":[0.00002898615,0.00001162236,0.0003516888,0.0000152564,0.000009297916,0.0001307872,0.0001310547,0.004346692,0.0004723712,0.9917259,0.002766739,0.0000096863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6480314,0.0009571547,0.06554311,0.002735148,0.000212917,0.00008530567,0.0004789243,0.0003521785,0.2816039],"genre_scores_gemma":[0.9761553,0.0003267748,0.004997962,0.0002276637,0.0001056757,0.00004116959,0.0001954127,0.00006551721,0.01788466],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009441176,"threshold_uncertainty_score":0.03158385,"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."}}