{"id":"W4413682904","doi":"10.1016/j.tcs.2025.115529","title":"Hypergraph burning, matchings, and zero forcing","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hypergraph; Forcing (mathematics); Zero (linguistics); Mathematics; Combinatorics; Computer science; Mathematical analysis; Linguistics","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.0004834649,0.0001027579,0.0001490288,0.0001412241,0.0003391013,0.0001960723,0.0004038593,0.00001345676,0.0000704284],"category_scores_gemma":[0.000005208856,0.00008569717,0.00004906179,0.000623334,0.001154425,0.0001154927,0.0004840249,0.0001237057,0.000003751831],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001073581,"about_ca_system_score_gemma":0.00002746602,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001779434,"about_ca_topic_score_gemma":2.092675e-7,"domain_scores_codex":[0.9990828,0.00002952615,0.0001428023,0.0003249405,0.0001568208,0.0002631223],"domain_scores_gemma":[0.9994766,0.0001060367,0.00003070619,0.0002568397,0.00005361109,0.00007628402],"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.00000165958,0.00001250561,0.005047021,0.000002042375,0.000007051027,3.071411e-7,0.00005425671,0.0000305048,0.0002606678,0.944344,0.0001293598,0.05011064],"study_design_scores_gemma":[0.00007446476,0.00002051513,0.001630985,0.0000385506,0.00001422835,7.357453e-7,0.000007895667,0.1336835,0.001644049,0.8624262,0.00035682,0.0001020762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1831271,0.00002211304,0.7985713,0.0002168622,0.00005725467,0.00005650142,4.518177e-7,0.00006880842,0.01787959],"genre_scores_gemma":[0.9676887,0.000001021715,0.03203854,0.0001718364,0.00006031812,0.000003945321,7.241583e-7,0.000003582436,0.00003128135],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7845616,"threshold_uncertainty_score":0.4253528,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.003242009541975954,"score_gpt":0.2481483777420117,"score_spread":0.2449063682000357,"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."}}