{"id":"W4234861332","doi":"10.1002/jgt.20324","title":"On highly ramsey infinite graphs","year":2008,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"Thompson Rivers University; University of Victoria","keywords":"Combinatorics; Mathematics; Ramsey's theorem; Ramsey theory; Graph; Constant (computer programming); Discrete mathematics; 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.0007308268,0.0004542875,0.0006475744,0.00112182,0.00123476,0.001269444,0.0008971568,0.0007837919,0.003786277],"category_scores_gemma":[0.004084984,0.0003945048,0.0004496449,0.0005364302,0.002061474,0.003515059,0.001983045,0.001067209,0.0003521944],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007821375,"about_ca_system_score_gemma":0.0003471751,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006837629,"about_ca_topic_score_gemma":0.0009961966,"domain_scores_codex":[0.9992712,0.0003062006,0.00003202918,0.0001524645,0.0001378116,0.000100279],"domain_scores_gemma":[0.9970804,0.001493823,0.000400713,0.0003811023,0.0002333239,0.0004106894],"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.000401326,0.0001364197,0.002583007,0.0002703974,0.00004966612,0.0007434784,0.001225453,0.0159532,0.02011657,0.944008,0.002418197,0.0120943],"study_design_scores_gemma":[0.00004886002,0.00008420728,0.0009144067,0.00003552459,0.00002457904,0.0006349554,0.0003214282,0.04305366,0.004495242,0.9475495,0.00281358,0.00002407153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9298268,0.0007292501,0.04795469,0.000545446,0.00004509677,0.0000342946,0.000101353,0.0002241086,0.02053891],"genre_scores_gemma":[0.990195,0.000165155,0.006976352,0.00008337831,0.00002690944,0.00002951869,0.00009850822,0.0000251887,0.00239996],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003786277,"threshold_uncertainty_score":0.01266634,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03080851922434943,"score_gpt":0.2758785608208873,"score_spread":0.2450700415965379,"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."}}