{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002422036,0.001133665,0.001944383,0.003383211,0.002147189,0.003040304,0.003370543,0.001445247,0.0129455],"category_scores_gemma":[0.01292973,0.0007442803,0.001188923,0.002282766,0.003726367,0.008536998,0.00315755,0.005470074,0.001812334],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003549919,"about_ca_system_score_gemma":0.0009954339,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001342632,"about_ca_topic_score_gemma":0.001034584,"domain_scores_codex":[0.99773,0.0005889664,0.00005939614,0.0005916229,0.0006010623,0.0004290382],"domain_scores_gemma":[0.9879178,0.00722468,0.0006910468,0.001931872,0.0009636618,0.001270873],"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.0002571914,0.0001506164,0.001626885,0.0002286068,0.00005297013,0.000314021,0.0002496693,0.01384942,0.004073988,0.9396361,0.02207381,0.01748662],"study_design_scores_gemma":[0.00003965141,0.00006576256,0.001346971,0.00008405418,0.00004163945,0.0004204843,0.00007831993,0.1188239,0.003857215,0.8602042,0.01498628,0.00005149717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4218178,0.008005936,0.2995629,0.01158876,0.001221778,0.0002089646,0.001341033,0.001563717,0.2546891],"genre_scores_gemma":[0.945011,0.001750299,0.03831734,0.001384077,0.0008968608,0.000185735,0.0006717868,0.0007024951,0.01108046],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0129455,"threshold_uncertainty_score":0.04330701,"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."}}