{"id":"W2116273603","doi":"10.1016/j.tcs.2012.01.041","title":"Fighting constrained fires in graphs","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":11,"is_retracted":false,"has_abstract":false,"ca_institutions":"Mount Allison University; Toronto Metropolitan University","funders":"","keywords":"Vertex (graph theory); Combinatorics; Limiting; Random regular graph; Random graph; Mathematics; Graph; Discrete mathematics; Chordal graph; 1-planar graph; Engineering","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.001113814,0.0008768506,0.001209163,0.001047904,0.001149527,0.001355726,0.002239054,0.001940295,0.006702504],"category_scores_gemma":[0.008142974,0.0007992843,0.0008166638,0.001016016,0.001764437,0.003153135,0.002428059,0.002080179,0.0003772369],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000740632,"about_ca_system_score_gemma":0.0004992799,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002595865,"about_ca_topic_score_gemma":0.003862831,"domain_scores_codex":[0.9993896,0.0002091757,0.00002800408,0.0001625285,0.00009967519,0.0001109232],"domain_scores_gemma":[0.9905999,0.007014269,0.0008464903,0.0004772769,0.000282791,0.0007792867],"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.0002346155,0.00008696989,0.001038121,0.0001586647,0.0001068547,0.0002062368,0.0002115563,0.7709326,0.002474748,0.204976,0.002189731,0.01738395],"study_design_scores_gemma":[0.00002229694,0.00002976413,0.000236801,0.00001262703,0.00001865955,0.00004268384,0.0000627832,0.8055038,0.000407779,0.1931314,0.0005218693,0.000009570076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2979982,0.000361928,0.6889916,0.0007025649,0.0001156759,0.00009999864,0.0002311093,0.000245706,0.01125328],"genre_scores_gemma":[0.9331038,0.0003685196,0.05194039,0.0001907118,0.0000879654,0.0001458122,0.0002679995,0.0001354441,0.01375932],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006702504,"threshold_uncertainty_score":0.02242213,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00893920547535462,"score_gpt":0.263824961362226,"score_spread":0.2548857558868714,"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."}}