{"id":"W2741500259","doi":"10.1016/j.tcs.2018.05.035","title":"Bounds on the burning numbers of spiders and path-forests","year":2018,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Vertex (graph theory); Graph; Mathematics; Path (computing); Upper and lower bounds; Discrete mathematics; Computer science","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.004609148,0.001604749,0.001903704,0.003921752,0.002353153,0.004642501,0.003936239,0.002640671,0.01250123],"category_scores_gemma":[0.040107,0.00127995,0.001467518,0.003114325,0.004314119,0.01345588,0.004271547,0.006146324,0.0009628939],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001947407,"about_ca_system_score_gemma":0.0008122734,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007530532,"about_ca_topic_score_gemma":0.001469593,"domain_scores_codex":[0.9980705,0.0005853674,0.00008406142,0.0004261695,0.0004663105,0.0003675185],"domain_scores_gemma":[0.9497706,0.04171472,0.002163487,0.002078364,0.001307321,0.002965427],"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.0003235494,0.00009135863,0.003567987,0.0004269967,0.00008676495,0.0001440259,0.0005039746,0.0367055,0.003377666,0.9233723,0.004634579,0.02676532],"study_design_scores_gemma":[0.00001954589,0.00002767506,0.0009037008,0.00007857297,0.00004091606,0.0001922195,0.00008282853,0.0900368,0.0007608117,0.9054198,0.002415972,0.00002117215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3843581,0.0106462,0.5112615,0.007138305,0.0005189937,0.0001449879,0.001375706,0.0005595556,0.08399671],"genre_scores_gemma":[0.8964152,0.005431484,0.07975349,0.0007656648,0.0007296263,0.0002730385,0.0008311023,0.0004239731,0.01537637],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01250123,"threshold_uncertainty_score":0.04182082,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01182209950060828,"score_gpt":0.2734107971776106,"score_spread":0.2615886976770023,"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."}}