{"id":"W2963044105","doi":"10.1017/jpr.2016.44","title":"Longest paths in random Apollonian networks and largest <i>r</i>-ary subtrees of random <i>d</i>-ary recursive trees","year":2016,"lang":"en","type":"article","venue":"Journal of Applied Probability","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Conjecture; Random graph; Planar graph; Bounded function; Discrete mathematics; Tree (set theory); 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":[],"consensus_categories":[],"category_scores_codex":[0.002320627,0.000271706,0.001071229,0.0001077906,0.00005600678,0.00002227284,0.0002799746,0.0001938017,0.00006913398],"category_scores_gemma":[0.003163761,0.0001693695,0.000151434,0.000204901,0.000238097,0.0001363881,0.00009516483,0.0003547511,0.000001214536],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008147236,"about_ca_system_score_gemma":0.0002177982,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008739302,"about_ca_topic_score_gemma":0.000123053,"domain_scores_codex":[0.9974698,0.0001351558,0.001311078,0.0002986673,0.0004139734,0.0003713253],"domain_scores_gemma":[0.9939685,0.004322874,0.0008428573,0.000305407,0.0002644729,0.0002958558],"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.06515198,0.005521509,0.01604729,0.003407115,0.000881217,0.0002929245,0.004205872,0.0006219212,0.006970907,0.7183037,0.003274818,0.1753207],"study_design_scores_gemma":[0.01351702,0.0004889784,0.001748406,0.0005190077,0.0001712606,0.00005689303,0.0001349365,0.0004997042,0.001270241,0.9811791,0.0001398738,0.0002745688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.529793,0.001781742,0.4633184,0.001244908,0.0004488956,0.00168582,0.0001432164,0.0000406327,0.001543371],"genre_scores_gemma":[0.9815824,0.0004152263,0.01773832,0.00006731822,0.0001355563,0.00002577203,0.000001179858,0.00002632642,0.000007888187],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4517894,"threshold_uncertainty_score":0.6906689,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02007556880898699,"score_gpt":0.2597187467386132,"score_spread":0.2396431779296262,"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."}}