{"id":"W4240838206","doi":"10.1002/jgt.20291","title":"A better bound for the cop number of general graphs","year":2008,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":32,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Wilfrid Laurier University","keywords":"Combinatorics; Mathematics; Sublinear function; Upper and lower bounds; Vertex (graph theory); Graph; Discrete mathematics","routes":{"ca_aff":true,"ca_fund":true,"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.001734711,0.0001809964,0.0004361245,0.0001644128,0.0004013801,0.00001489649,0.0005183292,0.0001054182,0.0001839158],"category_scores_gemma":[0.0003440755,0.00009969588,0.0007702326,0.0002068768,0.0006480932,0.0001203251,0.0000545514,0.0003031306,8.88597e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001248569,"about_ca_system_score_gemma":0.00004940407,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001987246,"about_ca_topic_score_gemma":9.823916e-7,"domain_scores_codex":[0.9983563,0.0002136311,0.0007084591,0.0001075692,0.0003705464,0.0002434633],"domain_scores_gemma":[0.9964462,0.00206243,0.0007275989,0.0003688877,0.0003219688,0.00007294162],"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.0005034187,0.0000862143,0.002981015,0.00005398938,0.0005522877,0.00001768912,0.001891717,0.000004273284,0.0005868172,0.9777148,0.0144593,0.001148494],"study_design_scores_gemma":[0.0008970712,0.0001262797,0.0021231,0.00003810352,0.0002120848,0.0007662287,0.000205189,0.000007554863,0.001772529,0.9912919,0.002435314,0.0001246343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9895638,0.00083298,0.006367,0.0002089013,0.0008666802,0.0002030206,0.00001799744,0.00001066412,0.001928959],"genre_scores_gemma":[0.9875795,0.0002892057,0.0106622,0.0005339243,0.0003920426,0.000007049561,5.064556e-7,0.00003744843,0.0004981614],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01357713,"threshold_uncertainty_score":0.406548,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03242892619103172,"score_gpt":0.3078512286830073,"score_spread":0.2754223024919756,"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."}}