{"id":"W4400596706","doi":"10.55016/ojs/cdm.v13i2.62416","title":"A lower bound on the hypergraph Ramsey number R(4,5;3)","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Ramsey's theorem; Hypergraph; Combinatorics; Mathematics; Set (abstract data type); Element (criminal law); Upper and lower bounds; Discrete mathematics; Graph; Computer science","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0009478863,0.0003525303,0.0004112595,0.00009833877,0.001383312,0.0001720267,0.0006859472,0.0001650873,0.001492394],"category_scores_gemma":[0.003612046,0.0002103328,0.0002830861,0.0005564941,0.0005411584,0.00008169685,0.0002765485,0.0003178117,0.000871426],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009220697,"about_ca_system_score_gemma":0.0000473788,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003810273,"about_ca_topic_score_gemma":0.00001258255,"domain_scores_codex":[0.9979026,0.0001377361,0.0005370801,0.0003470839,0.0004779446,0.0005975269],"domain_scores_gemma":[0.9962471,0.00151785,0.0001813327,0.001387159,0.0004595996,0.0002070194],"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.00003293524,0.0001228766,0.00002961176,0.00002083535,0.0001074866,0.000003789752,0.001439536,6.534803e-7,0.0001698084,0.9610115,0.03694591,0.0001150534],"study_design_scores_gemma":[0.0002926622,0.0001657638,0.00007229749,0.0001311447,0.0001130026,0.00002963159,0.0003607887,0.0002322643,0.001778581,0.9670452,0.02944112,0.0003375212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8056298,0.00004340301,0.04824854,0.007273042,0.001588549,0.00207105,0.0006461621,0.000464131,0.1340353],"genre_scores_gemma":[0.9890419,0.00000587659,0.006696882,0.001435421,0.0005582248,0.0001304841,0.000007603391,0.00006079214,0.002062874],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.183412,"threshold_uncertainty_score":0.9999167,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02286803183050485,"score_gpt":0.3238653703416144,"score_spread":0.3009973385111095,"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."}}