{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001672416,0.0002618364,0.0005119967,0.0007212819,0.0004087117,0.00001981745,0.0005360869,0.0001604265,0.000208454],"category_scores_gemma":[0.0008615757,0.0001782108,0.0006252782,0.0004025178,0.0004195754,0.0001801028,0.00006340776,0.0006739463,0.000009453048],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002425028,"about_ca_system_score_gemma":0.00005198077,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.10387e-7,"about_ca_topic_score_gemma":4.406496e-7,"domain_scores_codex":[0.9977659,0.0004125464,0.0007640143,0.0001597332,0.0005870259,0.0003107972],"domain_scores_gemma":[0.9965232,0.001900093,0.0007079692,0.0004491735,0.0002359594,0.0001836199],"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.0005907575,0.0001446698,0.0005971529,0.00002317436,0.0002298459,0.0002172384,0.001480354,0.00001089919,0.0002030356,0.9881105,0.007302884,0.001089465],"study_design_scores_gemma":[0.0009490551,0.0004945424,0.001842916,0.00009283068,0.00007907925,0.0008109423,0.0001402932,0.000001316828,0.0008286436,0.9929857,0.001565285,0.0002093903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9823478,0.000490219,0.001184875,0.00009647191,0.0012087,0.0001057086,0.000006924033,0.00004515906,0.01451409],"genre_scores_gemma":[0.9957621,0.0003524852,0.002520392,0.0006828164,0.0002193639,0.000001777446,5.255475e-7,0.00004320651,0.0004173394],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01409675,"threshold_uncertainty_score":0.7267224,"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."}}