{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001316117,0.0002141691,0.0003058252,0.00009483346,0.0002789834,0.0002364644,0.001092154,0.0000448919,0.0002114684],"category_scores_gemma":[0.00001931855,0.0001406605,0.0001237033,0.0003030579,0.00595296,0.000046497,0.001897181,0.00040645,0.000007422814],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002337565,"about_ca_system_score_gemma":0.00008064929,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003907526,"about_ca_topic_score_gemma":0.000001089212,"domain_scores_codex":[0.9983099,0.0001120724,0.0002708609,0.0005420162,0.0004454362,0.0003197122],"domain_scores_gemma":[0.9984655,0.0003320886,0.0001852032,0.0007690545,0.0001441524,0.0001039911],"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.000005569097,0.00002523443,0.003066411,0.000006659211,0.00002179945,4.324314e-7,0.0002412119,0.0001731996,0.00001883165,0.9888082,0.0003126865,0.007319734],"study_design_scores_gemma":[0.00004908308,0.00009650466,0.002392249,0.00019805,0.00002998553,6.566579e-7,0.00001723561,0.1740538,0.0009587323,0.8219453,0.00007037617,0.0001880042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5806822,0.00001172061,0.4068172,0.0003548145,0.0001676557,0.0001877928,0.000005019212,0.00004282542,0.01173082],"genre_scores_gemma":[0.9896845,0.000001401304,0.009841488,0.00008881794,0.0003557089,0.000009769655,0.000002998696,0.00001021286,0.00000516855],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4090023,"threshold_uncertainty_score":0.9967523,"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."}}