{"id":"W2136721967","doi":"10.1002/rsa.20648","title":"Justifying the small‐world phenomenon via random recursive trees","year":2016,"lang":"en","type":"preprint","venue":"Random Structures and Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Monash University","keywords":"Logarithm; Random graph; Combinatorics; Upper and lower bounds; Mathematical proof; Mathematics; Simple (philosophy); Computer science; Graph; Discrete mathematics","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.001170391,0.0006512144,0.00092416,0.0003626525,0.0007242035,0.0006500139,0.002470872,0.0002346384,0.00005420596],"category_scores_gemma":[0.0001412239,0.0003586472,0.0003343565,0.0003366655,0.0005361188,0.0002341965,0.002513032,0.001189737,0.000008756305],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007814799,"about_ca_system_score_gemma":0.0001169309,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004452518,"about_ca_topic_score_gemma":0.00005442524,"domain_scores_codex":[0.9960525,0.0006534001,0.0005487387,0.001280418,0.0006318184,0.0008331098],"domain_scores_gemma":[0.9959011,0.001741544,0.0003972443,0.001508086,0.0001971565,0.0002548831],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001120355,0.00002587533,0.00005182232,0.0001696353,0.0004085649,0.00007032244,0.001852347,0.0007298493,0.0004562121,0.09514233,0.0003156101,0.8996571],"study_design_scores_gemma":[0.009758369,0.00006703596,0.0003808431,0.000194259,0.00006986571,0.00005879276,0.00006701847,0.01106723,0.0008507274,0.9714617,0.00535402,0.0006701343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002077532,0.008086613,0.9818169,0.002322792,0.00193487,0.001578749,0.00007370942,0.0002036125,0.001905145],"genre_scores_gemma":[0.8231622,0.005888477,0.1579985,0.001032487,0.005292155,0.0009736941,0.00008222864,0.0002803042,0.005289911],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8989869,"threshold_uncertainty_score":0.9998866,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02561507019261646,"score_gpt":0.2863814753473121,"score_spread":0.2607664051546956,"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."}}