{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008302242,0.0008522941,0.002019182,0.003479309,0.001288781,0.002736654,0.00257556,0.002185313,0.003450923],"category_scores_gemma":[0.06484288,0.001036472,0.0008041752,0.002105835,0.007677185,0.006918883,0.002707534,0.002115957,0.0006231875],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002279043,"about_ca_system_score_gemma":0.0006415662,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001631123,"about_ca_topic_score_gemma":0.001123558,"domain_scores_codex":[0.9958813,0.002296038,0.00009468804,0.0007800597,0.0005689177,0.0003789288],"domain_scores_gemma":[0.9279466,0.06059746,0.003520939,0.004930258,0.00149643,0.001508383],"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.000773975,0.00007535025,0.00822165,0.0003023446,0.0001451709,0.0004361591,0.0005859892,0.2203577,0.005176772,0.7411538,0.004375116,0.01839595],"study_design_scores_gemma":[0.0001993123,0.0001721573,0.003523505,0.0001357638,0.00008194413,0.000571825,0.0001938045,0.5255501,0.002494974,0.4646042,0.002360116,0.0001124243],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6529448,0.001746184,0.3234487,0.006125655,0.0001364828,0.0002029229,0.001086022,0.0005556734,0.01375357],"genre_scores_gemma":[0.9801768,0.001227451,0.01396952,0.0003858394,0.0002490625,0.0003235649,0.0004140392,0.0001242038,0.003129515],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008302242,"threshold_uncertainty_score":0.04390699,"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."}}