{"id":"W3196808644","doi":"10.1016/j.dam.2023.05.030","title":"A linear-time algorithm for semitotal domination in strongly chordal graphs","year":2023,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Chordal graph; Mathematics; Dominating set; Combinatorics; Time complexity; Vertex (graph theory); Maximal independent set; Bipartite graph; Interval graph; Discrete mathematics; Graph; 1-planar 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.0008788413,0.000199842,0.0002854009,0.0004005147,0.0001129175,0.00009016469,0.0007947833,0.00008783279,0.000007847148],"category_scores_gemma":[0.00008445254,0.0001870278,0.0001015149,0.001344676,0.00008158692,0.0002525677,0.0003084198,0.000182272,0.0001812677],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004774109,"about_ca_system_score_gemma":0.00004165284,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001025472,"about_ca_topic_score_gemma":0.000001528416,"domain_scores_codex":[0.9981925,0.00002293226,0.0003738786,0.0004249125,0.0004317802,0.000554026],"domain_scores_gemma":[0.9986296,0.0005250821,0.0001129945,0.0005699013,0.00006651873,0.00009591995],"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.00001922166,0.00013586,0.000007053762,0.0001469688,0.00003472666,0.00001359063,0.002271454,0.00108108,0.01071628,0.8994156,0.0003800075,0.08577812],"study_design_scores_gemma":[0.0006528036,0.00004295478,0.0000346749,0.00002065774,0.000003956659,0.000002758873,0.000206266,0.6632335,0.002637513,0.3328745,0.0001095952,0.0001808296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01625093,0.00000962647,0.9803703,0.0001239947,0.00006687929,0.001041673,0.00003407984,0.0003305844,0.001771954],"genre_scores_gemma":[0.03824848,0.00001091665,0.9602631,0.00001920543,0.00006607373,0.0007079156,0.00007383922,0.00005242603,0.0005580204],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6621524,"threshold_uncertainty_score":0.7626771,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01700210038948882,"score_gpt":0.2984159592858348,"score_spread":0.281413858896346,"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."}}