{"id":"W158188782","doi":"","title":"On the lower bounds of partial signed domination number of graphs.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Domination analysis; Combinatorics; Discrete mathematics; Graph","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002883766,0.001639748,0.001567707,0.003990836,0.001893663,0.005013157,0.0036026,0.001998938,0.01735951],"category_scores_gemma":[0.03064936,0.000691083,0.001047647,0.003332992,0.003035609,0.01061821,0.003637448,0.004394358,0.003143356],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00261806,"about_ca_system_score_gemma":0.001293518,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009428867,"about_ca_topic_score_gemma":0.001625828,"domain_scores_codex":[0.9973794,0.0006314876,0.0001178437,0.0004726395,0.0008323134,0.0005663367],"domain_scores_gemma":[0.9737709,0.01931971,0.001306224,0.002401472,0.001630147,0.001571475],"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.0007598722,0.0002301009,0.003428615,0.0007446855,0.0001318454,0.0002313833,0.0005075912,0.03689837,0.007558061,0.8393548,0.02782666,0.08232802],"study_design_scores_gemma":[0.00004791679,0.0001042885,0.001913986,0.0001762131,0.00008938744,0.0003715356,0.000136836,0.09368794,0.004320008,0.8856404,0.01345074,0.00006078302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.3122572,0.01329485,0.3254001,0.01113016,0.001585407,0.000219375,0.003291572,0.00168861,0.3311326],"genre_scores_gemma":[0.9183863,0.00454016,0.04709224,0.0013259,0.001206514,0.0004044195,0.002011916,0.000590781,0.02444185],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01735951,"threshold_uncertainty_score":0.0580734,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01261581860335374,"score_gpt":0.2841050634765157,"score_spread":0.271489244873162,"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."}}