{"id":"W2042502099","doi":"10.1017/s0963548308009097","title":"On the Maximum Degree of a Random Planar Graph","year":2008,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":36,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Planar graph; Random regular graph; Degree (music); Random graph; Vertex (graph theory); Graph; Discrete mathematics; Planar; 1-planar graph; Outerplanar graph; Independent set; Chordal graph; Pathwidth; Line graph; Computer science; Physics","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":[],"consensus_categories":[],"category_scores_codex":[0.001594393,0.0002305426,0.0004400971,0.00008736229,0.0007307311,0.00001231625,0.0006148842,0.0001147451,0.00001889326],"category_scores_gemma":[0.002166248,0.0001493699,0.0002425925,0.000446386,0.0004207324,0.000036515,0.000200955,0.0004076293,0.000002273458],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000545113,"about_ca_system_score_gemma":0.00004591021,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009501488,"about_ca_topic_score_gemma":0.000001241349,"domain_scores_codex":[0.9979888,0.0003610124,0.0005637979,0.0003209474,0.0004453437,0.0003201654],"domain_scores_gemma":[0.9943497,0.00420139,0.0003012376,0.0008880423,0.0001927138,0.00006687265],"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.00007669261,0.0002247635,0.003251365,0.0001177251,0.00004810827,0.000006051359,0.001765018,0.00002873223,0.00001654061,0.9932721,0.0006909649,0.0005019391],"study_design_scores_gemma":[0.001006245,0.0001240223,0.001843596,0.00005529795,0.00002069108,0.00002295879,0.00005869566,0.0003711779,0.0004948102,0.9957899,0.00004851571,0.0001640681],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9865431,0.00008749656,0.004851475,0.0001426525,0.000564273,0.000605008,0.000004291136,0.0001098157,0.007091869],"genre_scores_gemma":[0.9977632,0.000006876902,0.002057121,0.00008549263,0.00003499691,0.000006370517,0.000001140685,0.00002236541,0.00002250468],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01122001,"threshold_uncertainty_score":0.609113,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07886002661000079,"score_gpt":0.270923936666516,"score_spread":0.1920639100565152,"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."}}