{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008344602,0.00009738292,0.0001409238,0.0001256087,0.0001349082,0.0000714521,0.0004123355,0.00001336545,0.0004863897],"category_scores_gemma":[0.000008204737,0.00008059,0.00005534148,0.0007351078,0.001317929,0.0002125134,0.0002353767,0.0001238855,0.00001967685],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001559002,"about_ca_system_score_gemma":0.0000226378,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001533699,"about_ca_topic_score_gemma":4.311209e-7,"domain_scores_codex":[0.9988856,0.00005135562,0.0001763934,0.0002080754,0.000205572,0.0004730472],"domain_scores_gemma":[0.9994171,0.0001473109,0.00003636134,0.0002316817,0.00003510444,0.000132468],"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.000001249704,0.00004482895,0.03323656,7.194928e-7,0.000002396574,3.186786e-7,0.000150149,0.00001744856,0.0001668441,0.9416434,0.00003264182,0.02470341],"study_design_scores_gemma":[0.0002041304,0.0000432156,0.02303566,0.00004398102,0.00001068809,0.000002607123,0.0000369911,0.1726367,0.004949276,0.7985141,0.000208885,0.0003137474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6027071,0.00001975197,0.3734915,0.0001221173,0.000101281,0.00009128558,0.000001290814,0.00007561797,0.02339004],"genre_scores_gemma":[0.9775684,2.161905e-7,0.02216646,0.00006602001,0.000185328,0.000005292302,0.000001344957,0.000004196877,0.000002709781],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3748614,"threshold_uncertainty_score":0.5325626,"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."}}