{"id":"W2094138124","doi":"10.1017/s0963548315000061","title":"On the Chromatic Thresholds of Hypergraphs","year":2015,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"University of Illinois at Urbana-Champaign; Hungarian Scientific Research Fund; European Commission; National Science Foundation","keywords":"Combinatorics; Chromatic scale; Mathematics; Infimum and supremum; Hypergraph; Dimension (graph theory); Bounded function; Upper and lower bounds; Bipartite graph; Discrete mathematics; Graph","routes":{"ca_aff":true,"ca_fund":false,"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.00247299,0.0001988522,0.0003518376,0.00006843982,0.000269914,0.0000244343,0.0006112594,0.00009913415,0.00001066674],"category_scores_gemma":[0.003279926,0.0001253298,0.0001497013,0.0004582634,0.000271635,0.00004390886,0.000352524,0.0002975552,0.000003127481],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008611435,"about_ca_system_score_gemma":0.00006315739,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005047144,"about_ca_topic_score_gemma":7.403538e-7,"domain_scores_codex":[0.9981697,0.0002894743,0.0005065775,0.0002655958,0.0004987328,0.0002698957],"domain_scores_gemma":[0.9961854,0.002230682,0.0002684218,0.0009390555,0.0002803105,0.00009618387],"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.00001259644,0.0001982592,0.003545994,0.0001288516,0.00003010779,0.000001039252,0.001675177,0.00008201577,0.00001532238,0.9932271,0.000820228,0.000263314],"study_design_scores_gemma":[0.0003588218,0.0001698346,0.0005538577,0.00007089737,0.00002122331,0.00000616228,0.0001572279,0.002234584,0.0004802336,0.9957637,0.00004434695,0.0001391437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9861866,0.00008770342,0.000791927,0.0001905142,0.0007252663,0.0004547689,0.000001720463,0.0001049404,0.01145654],"genre_scores_gemma":[0.998109,9.704617e-7,0.001724006,0.00008039687,0.00003438632,0.000005258414,6.903057e-7,0.00002101293,0.00002427174],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01192239,"threshold_uncertainty_score":0.51108,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1124812024018226,"score_gpt":0.3067277013778394,"score_spread":0.1942464989760168,"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."}}