{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00483688,0.001112474,0.00125588,0.002442981,0.001352062,0.003332335,0.002687781,0.001864451,0.00557991],"category_scores_gemma":[0.04131841,0.0008595187,0.001482089,0.001220376,0.005082142,0.01049955,0.005049279,0.005355876,0.0007637831],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002205531,"about_ca_system_score_gemma":0.0007470858,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001335396,"about_ca_topic_score_gemma":0.001370327,"domain_scores_codex":[0.9971626,0.001238899,0.00009540505,0.0005315322,0.0006761593,0.0002952577],"domain_scores_gemma":[0.9378428,0.05166603,0.003014867,0.004134782,0.001720161,0.001621319],"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.00003199765,0.00002416849,0.0009004551,0.00007880792,0.00002071246,0.0001639099,0.0002106422,0.03619407,0.001589452,0.9542921,0.001417227,0.005076519],"study_design_scores_gemma":[0.00001111784,0.00002178628,0.0003041778,0.00002713923,0.00001409081,0.0001340836,0.00004688926,0.2626734,0.001050655,0.7330321,0.002664705,0.00002000288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05697443,0.001232681,0.9216262,0.001647932,0.00009729456,0.00005532179,0.0001687442,0.0004161209,0.01778132],"genre_scores_gemma":[0.8961468,0.001351521,0.09522354,0.0007419825,0.0003453331,0.0002345681,0.0002079744,0.0003995108,0.005348738],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00557991,"threshold_uncertainty_score":0.02558023,"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."}}