{"id":"W3164058326","doi":"10.1002/net.22055","title":"The node cop‐win reliability of unicyclic and bicyclic graphs","year":2021,"lang":"en","type":"article","venue":"Networks","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Guelph","funders":"","keywords":"Combinatorics; Graph; Random graph; Mathematics; Discrete mathematics; Computer science","routes":{"ca_aff":true,"ca_fund":false,"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.002609409,0.0005847605,0.0008246475,0.00185118,0.0004686577,0.001280762,0.001311378,0.000704055,0.001739134],"category_scores_gemma":[0.01446521,0.0004752809,0.0004087279,0.001304543,0.001785311,0.001665475,0.0009581412,0.0008684798,0.0001535074],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001472194,"about_ca_system_score_gemma":0.0004683741,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003489927,"about_ca_topic_score_gemma":0.002443135,"domain_scores_codex":[0.9988656,0.0005021321,0.00004411336,0.0001930073,0.0002193259,0.0001759265],"domain_scores_gemma":[0.9842465,0.01004832,0.002699511,0.001163807,0.001252242,0.0005895048],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000287283,0.00005896483,0.007422626,0.0001967747,0.0001182931,0.0002886319,0.000522782,0.6405971,0.002860619,0.3282956,0.004756424,0.01459487],"study_design_scores_gemma":[0.00001638358,0.00005859373,0.002163055,0.00003991887,0.00003086772,0.0002542273,0.0001274069,0.84782,0.0006448074,0.1476998,0.001122635,0.00002211565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6822153,0.001522829,0.3035898,0.001009325,0.00005664713,0.00008469772,0.0006979796,0.0002334458,0.01058986],"genre_scores_gemma":[0.9939295,0.0003038073,0.004377986,0.00003948664,0.00002968801,0.00002858075,0.0001010784,0.00002879096,0.001160924],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003489927,"threshold_uncertainty_score":0.01380002,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.003734307403357608,"score_gpt":0.1851559022038302,"score_spread":0.1814215948004725,"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."}}