{"id":"W2022319070","doi":"10.1002/rsa.20488","title":"For most graphs<i>H</i>, most<i>H</i>‐free graphs have a linear homogeneous set","year":2013,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"Engineering and Physical Sciences Research Council","keywords":"Combinatorics; Mathematics; Split graph; Conjecture; Cograph; Graph; Induced subgraph; Discrete mathematics; Homogeneous; Random regular graph; Chordal graph; 1-planar graph","routes":{"ca_aff":true,"ca_fund":false,"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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004152014,0.0006334558,0.0009101983,0.0002396757,0.000888049,0.0001973945,0.0006277813,0.0003412825,0.0002006553],"category_scores_gemma":[0.0005095518,0.0004560705,0.0003864498,0.0002874829,0.0003832865,0.0002030114,0.0002922387,0.0003711657,0.000002056909],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001805163,"about_ca_system_score_gemma":0.0000381822,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001633437,"about_ca_topic_score_gemma":0.00003018668,"domain_scores_codex":[0.9972274,0.0001363298,0.0006934071,0.00071747,0.0004328218,0.0007925626],"domain_scores_gemma":[0.9971959,0.00101777,0.0002790024,0.0009198494,0.0002609519,0.0003265138],"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.001555421,0.0001873353,0.001862893,0.001155478,0.001874649,0.00008435528,0.006958556,0.0001037914,0.002544458,0.7518519,0.08912159,0.1426996],"study_design_scores_gemma":[0.008771922,0.0002034255,0.000348174,0.00003662505,0.0001951375,0.0001864886,0.0003604034,0.002620036,0.001700657,0.9796368,0.005279483,0.0006608542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9720534,0.003322071,0.01351724,0.0006463534,0.001948007,0.004827171,0.00146313,0.0004768727,0.001745766],"genre_scores_gemma":[0.8601611,0.0009570627,0.133913,0.001721311,0.0009795465,0.0006500487,0.0001715009,0.0002682761,0.001178231],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2277849,"threshold_uncertainty_score":0.9997891,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02067114998214117,"score_gpt":0.2743805863062095,"score_spread":0.2537094363240683,"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."}}