{"id":"W1519450118","doi":"10.1007/11604686_10","title":"Roman Domination over Some Graph Classes","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Combinatorics; Vertex (graph theory); Domination analysis; Graph; Interval graph; Minimum weight; Mathematics; Time complexity; Dominating set; Discrete mathematics; Line graph; Pathwidth","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.001221425,0.0006205659,0.0005501081,0.002087318,0.0003680555,0.0006861985,0.005069131,0.0003788681,0.00006960019],"category_scores_gemma":[0.0001311341,0.0005791116,0.0002065981,0.001133542,0.001256551,0.002250136,0.001854117,0.00118384,0.0001293547],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005056108,"about_ca_system_score_gemma":0.0005242676,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006995496,"about_ca_topic_score_gemma":0.00005750269,"domain_scores_codex":[0.9946352,0.00007061971,0.0005553301,0.001957738,0.001780863,0.001000293],"domain_scores_gemma":[0.9964374,0.0007589398,0.0003011661,0.001952498,0.0002909147,0.0002591352],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000008398217,0.00003351427,0.00003307642,0.00002268191,0.00001074801,0.00007483854,0.0002405963,0.01057249,0.0003149869,0.4197222,0.00003686502,0.5689296],"study_design_scores_gemma":[0.0003516309,0.0001644319,0.0003180803,0.0001923358,0.000004967811,0.0000507665,8.810093e-8,0.1227994,0.00165747,0.8693923,0.004347114,0.0007214054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002944478,0.0008960001,0.9916955,0.0008093654,0.001214518,0.0004713917,0.000005198059,0.0002502442,0.004363382],"genre_scores_gemma":[0.2452942,0.000456651,0.7446695,0.003698527,0.002203475,0.00004909491,0.00001640527,0.0001470802,0.003465047],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5682082,"threshold_uncertainty_score":0.999666,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01672967113981929,"score_gpt":0.2842366235948487,"score_spread":0.2675069524550295,"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."}}