{"id":"W2095784445","doi":"10.1017/s096354830800967x","title":"The Ramsey Number for 3-Uniform Tight Hypergraph Cycles","year":2009,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":33,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Banff International Research Station for Mathematical Innovation and Discovery; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Fundação de Amparo à Pesquisa do Estado de São Paulo; National Science Foundation","keywords":"Hypergraph; Combinatorics; Mathematics; Ramsey's theorem; Lemma (botany); Monochromatic color; Integer (computer science); Discrete mathematics; Physics; Graph; 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.001914203,0.0002771654,0.0003466055,0.00003815227,0.001887594,0.0001329919,0.00070983,0.0001587857,0.000006375609],"category_scores_gemma":[0.001321776,0.0001883015,0.0002828677,0.0003415138,0.0001975668,0.0000927912,0.0001940851,0.0003312991,0.000003055003],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001087758,"about_ca_system_score_gemma":0.00004401421,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002018757,"about_ca_topic_score_gemma":0.000001895678,"domain_scores_codex":[0.9979823,0.0001355506,0.0005824168,0.0004062664,0.0003179555,0.0005755763],"domain_scores_gemma":[0.9961788,0.002325149,0.0002446074,0.0008326486,0.0003092587,0.0001095459],"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.00002753108,0.0001398817,0.002078496,0.00006834811,0.00002924498,7.178289e-7,0.0005570923,0.00001066948,0.00001357953,0.9808204,0.001067784,0.01518623],"study_design_scores_gemma":[0.0005357941,0.00009562647,0.002576509,0.00002935737,0.00003034755,0.00001065617,0.00006306764,0.001876562,0.0002304435,0.9898412,0.004454089,0.0002563454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9745559,0.0002066185,0.01065778,0.0009290566,0.001626099,0.001323598,0.000006069541,0.0003772536,0.01031763],"genre_scores_gemma":[0.9869584,0.00001200892,0.01256516,0.0001436534,0.0001487743,0.00001270101,0.000003451479,0.00002602265,0.0001298002],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01492989,"threshold_uncertainty_score":0.9994118,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03560432321952448,"score_gpt":0.3152638023033849,"score_spread":0.2796594790838604,"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."}}