{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000720009,0.0001049911,0.0001599929,0.00008826389,0.00009143195,0.00002764615,0.0008848423,0.00005182246,0.00008366992],"category_scores_gemma":[0.0001822286,0.0000784677,0.00009604065,0.0006416715,0.0002148672,0.0003018668,0.000155337,0.0001426039,0.00004825909],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003024761,"about_ca_system_score_gemma":0.00004345786,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005240466,"about_ca_topic_score_gemma":0.000001088974,"domain_scores_codex":[0.998597,0.0001841358,0.0002572095,0.0002206941,0.0005125048,0.0002284915],"domain_scores_gemma":[0.9983087,0.0006035476,0.0001463022,0.0006974632,0.0001938086,0.00005024682],"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.00004740622,0.0002743625,0.0002723312,0.000004626215,0.00001525425,0.000001284591,0.0002478345,0.00003269883,0.001835793,0.9939508,0.0004593437,0.002858213],"study_design_scores_gemma":[0.0005569381,0.0002047148,0.0004693502,0.0000161521,0.000003235693,0.000001550435,0.00001192004,0.001724457,0.05288743,0.9436731,0.0003669967,0.00008420092],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9895656,0.00002638842,0.004008564,0.0008053545,0.0005987337,0.0002075507,0.000001849204,0.00003713448,0.004748795],"genre_scores_gemma":[0.9987757,0.000004697728,0.0009824872,0.00007434031,0.000005120402,0.00001739199,6.757689e-7,0.000008560372,0.0001310943],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05105164,"threshold_uncertainty_score":0.319982,"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."}}