{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001090248,0.0002499941,0.0005118516,0.001340965,0.00119599,0.001954166,0.000729884,0.0006868381,0.004709175],"category_scores_gemma":[0.0105408,0.0004621886,0.0003703824,0.0007979376,0.001565689,0.003455416,0.001407665,0.0008384315,0.0003817726],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001187386,"about_ca_system_score_gemma":0.0006148598,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001329577,"about_ca_topic_score_gemma":0.001051303,"domain_scores_codex":[0.9994947,0.0001439438,0.00002235817,0.000120106,0.00009028354,0.0001285488],"domain_scores_gemma":[0.9953957,0.002693328,0.0005540975,0.0004795414,0.0003117199,0.0005655012],"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.0006968223,0.00006773258,0.008677724,0.0002096884,0.00004513585,0.0001920429,0.0008066059,0.03209205,0.009362821,0.9037634,0.007319247,0.03676665],"study_design_scores_gemma":[0.00006777107,0.0001107115,0.005780526,0.00009472212,0.00005328394,0.0005442908,0.000382023,0.1480647,0.004732131,0.8325546,0.007554428,0.00006073661],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9300764,0.001250154,0.04385465,0.0009893228,0.0000521088,0.00003673507,0.0004051435,0.0002365728,0.02309895],"genre_scores_gemma":[0.9914584,0.0004054115,0.005845234,0.0001013359,0.00004080294,0.00006026553,0.0001393668,0.00004487344,0.001904364],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004709175,"threshold_uncertainty_score":0.01575381,"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."}}