{"id":"W4414100071","doi":"10.26493/1855-3974.3451.46f","title":"Extending graph burning to hypergraphs","year":2025,"lang":"en","type":"article","venue":"Ars Mathematica Contemporanea","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Memorial University of Newfoundland; Toronto Metropolitan University; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hypergraph; Graph; Conjecture; Generalization; Existential quantification; Upper and lower bounds","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":[],"consensus_categories":[],"category_scores_codex":[0.0008331224,0.0002175605,0.0003333608,0.0004968604,0.0002581085,0.0002136193,0.001123371,0.00005791646,0.00002156464],"category_scores_gemma":[0.0001627317,0.0001931872,0.0001692227,0.0013327,0.0000610002,0.0003466524,0.0002621878,0.000149764,0.0001448398],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001589257,"about_ca_system_score_gemma":0.0000389601,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004864769,"about_ca_topic_score_gemma":0.000001217558,"domain_scores_codex":[0.9984205,0.00009791027,0.0004042489,0.0004619117,0.0002403642,0.0003750313],"domain_scores_gemma":[0.9985453,0.000324938,0.00009121754,0.000813256,0.00007870926,0.0001466007],"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.000005375154,0.00006653377,0.0001116532,0.00005817612,0.0000469998,0.00002948155,0.001124669,0.00001309621,0.002291046,0.9854182,0.0007439667,0.01009081],"study_design_scores_gemma":[0.0004576817,0.00006615929,0.000175949,0.0003911749,0.00001790574,0.00002455384,0.0002898265,0.00431076,0.003728438,0.9862096,0.003979936,0.0003479568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03266646,0.0002484554,0.9181078,0.002179101,0.0004912546,0.0003887991,0.000001853718,0.0004362712,0.04548003],"genre_scores_gemma":[0.9333299,0.000006395264,0.06388022,0.001136268,0.00001336633,0.00005990693,0.000001038493,0.00001223898,0.001560624],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9006635,"threshold_uncertainty_score":0.7877944,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01258541289274254,"score_gpt":0.2570222555429517,"score_spread":0.2444368426502091,"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."}}