{"id":"W4380992167","doi":"10.37236/11307","title":"On the Running Time of Hypergraph Bootstrap Percolation","year":2023,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Indian Institute of Science Education and Research Mohali; Indian Institute of Science Education and Research Pune; University of Victoria","keywords":"Hypergraph; Combinatorics; Mathematics; Conjecture; Upper and lower bounds; Constant (computer programming); Graph; Omega; Complete graph; Discrete mathematics; Mathematical analysis; Physics; 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":[],"consensus_categories":[],"category_scores_codex":[0.001631932,0.0001069596,0.0002318299,0.00009099663,0.0001378535,0.00001763365,0.0003969867,0.00004894299,0.00003471044],"category_scores_gemma":[0.001407271,0.00005685453,0.0001109201,0.000597656,0.00004191268,0.00004247403,0.00003146281,0.0005096774,0.00001811369],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007507364,"about_ca_system_score_gemma":0.000181074,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.518664e-7,"about_ca_topic_score_gemma":3.562379e-7,"domain_scores_codex":[0.9986384,0.00007005822,0.0004001512,0.00006571853,0.0005042173,0.000321457],"domain_scores_gemma":[0.9965785,0.002575145,0.0003863117,0.0001950931,0.0002289634,0.00003598245],"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.00004356,0.00005277308,0.0000033693,0.00001848424,0.00006093513,0.000002424468,0.0002858791,0.00004194134,0.0004268173,0.9973158,0.001556665,0.0001913464],"study_design_scores_gemma":[0.0002896259,0.0006567017,0.00003989357,0.00005939407,0.00007969166,0.00003201193,0.0002125658,0.005153326,0.0006481055,0.9926631,0.0001045665,0.00006103521],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7720605,0.0006770807,0.2217362,0.003063505,0.0005050451,0.0003419293,0.000005132803,0.00005596058,0.001554618],"genre_scores_gemma":[0.9995288,0.0001161419,0.00003370858,0.00004499809,0.00004203686,0.000002609838,4.127867e-7,0.00001804032,0.0002133064],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2274682,"threshold_uncertainty_score":0.231846,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03652708860321113,"score_gpt":0.300824066326651,"score_spread":0.2642969777234399,"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."}}