{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00170541,0.0002637523,0.000655841,0.001736058,0.001383784,0.001559691,0.001533511,0.001168394,0.004083617],"category_scores_gemma":[0.01341428,0.0007366328,0.0007850085,0.0007614775,0.002467571,0.002069085,0.001232138,0.0009413066,0.0003336765],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00235582,"about_ca_system_score_gemma":0.0007555492,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003368829,"about_ca_topic_score_gemma":0.005181028,"domain_scores_codex":[0.9993772,0.0002178597,0.00003166666,0.0001659903,0.00008551157,0.0001217978],"domain_scores_gemma":[0.9899291,0.006775968,0.001452289,0.0005607206,0.0005329514,0.0007489187],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003579875,0.0000811645,0.01005003,0.0002674522,0.00009521907,0.0005380075,0.0008161314,0.2729542,0.007505576,0.6885427,0.004006184,0.01478537],"study_design_scores_gemma":[0.00009846265,0.0001126403,0.003478639,0.00008853795,0.00006659978,0.0003702383,0.0002931553,0.6123133,0.002599822,0.3774383,0.003088713,0.00005154773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8433689,0.0004408981,0.1473304,0.0007808136,0.0000304278,0.00006964727,0.0005144607,0.0002157846,0.007248525],"genre_scores_gemma":[0.972422,0.0003130938,0.02340073,0.0001322553,0.00002776322,0.0001696282,0.0004328542,0.0000866047,0.003015147],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004083617,"threshold_uncertainty_score":0.0170927,"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."}}