{"id":"W1546598357","doi":"10.37236/4053","title":"On the Hyperbolicity of Random Graphs","year":2014,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Graph; Binomial (polynomial); Random graph; Discrete mathematics; Statistics","routes":{"ca_aff":true,"ca_fund":true,"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.004902955,0.0001175611,0.0002636544,0.0001368272,0.000183777,0.00003683123,0.002602854,0.00003624322,0.000004914282],"category_scores_gemma":[0.0006534857,0.00005762341,0.0001889601,0.0008250931,0.0001686267,0.0001608665,0.0001358475,0.0009050358,0.000005283589],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007803205,"about_ca_system_score_gemma":0.0001884246,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002176888,"about_ca_topic_score_gemma":8.860846e-7,"domain_scores_codex":[0.9976234,0.0007293043,0.0003466062,0.0001046003,0.0007258186,0.0004702366],"domain_scores_gemma":[0.9961339,0.002418218,0.0004028535,0.0006770036,0.0003081006,0.00005997384],"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.00009563133,0.00007436793,0.00003331472,0.000002703202,0.00004095313,8.033962e-7,0.0001435691,0.0001719825,0.0004735307,0.9974638,0.0001485388,0.001350837],"study_design_scores_gemma":[0.001035204,0.0008258386,0.0001118824,0.00001478827,0.00001030494,0.00004712496,0.0000170485,0.0011169,0.006818378,0.9889429,0.0009978811,0.00006180234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5455131,0.001100439,0.4471173,0.003664393,0.0003678011,0.0001822009,2.34074e-7,0.00001797106,0.002036544],"genre_scores_gemma":[0.9993942,0.0002765379,0.00003550682,0.0001858683,0.00002895276,0.000002172889,3.52165e-8,0.000008787639,0.00006792357],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4538811,"threshold_uncertainty_score":0.4836794,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008707904971047311,"score_gpt":0.2435580862877829,"score_spread":0.2348501813167355,"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."}}