{"id":"W94648563","doi":"","title":"Lower bounds on dominating functions in graphs.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Dominating set; Combinatorics; 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.00611365,0.004079407,0.002741037,0.008532866,0.0030552,0.008775048,0.005684667,0.003715887,0.02318861],"category_scores_gemma":[0.04274416,0.001416071,0.002243725,0.007979961,0.004099676,0.01837605,0.006492694,0.01137212,0.006779216],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006672403,"about_ca_system_score_gemma":0.001825705,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001980656,"about_ca_topic_score_gemma":0.003546244,"domain_scores_codex":[0.9951497,0.00117789,0.0001931719,0.0007149016,0.001523039,0.001241443],"domain_scores_gemma":[0.9473695,0.04284869,0.001224557,0.003413048,0.002724136,0.002420114],"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.0007001396,0.0003205217,0.002634002,0.0012536,0.0001707483,0.0002114812,0.0007281762,0.02216063,0.003526064,0.80302,0.06185235,0.1034224],"study_design_scores_gemma":[0.00005876757,0.00009080597,0.001297232,0.0003373435,0.0001562364,0.0003689951,0.0001938667,0.03703236,0.002245113,0.9326807,0.02548842,0.00005014199],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09772757,0.04058602,0.4939985,0.02872226,0.003441325,0.0003065148,0.006362264,0.002621997,0.3262336],"genre_scores_gemma":[0.7101023,0.03375318,0.1465204,0.006836812,0.006536978,0.001175713,0.008478959,0.002833212,0.08376241],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02318861,"threshold_uncertainty_score":0.07757366,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01276027673999091,"score_gpt":0.2704202048579882,"score_spread":0.2576599281179973,"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."}}