{"id":"W2949707381","doi":"10.48550/arxiv.1005.1285","title":"Asymptotic enumeration of strongly connected digraphs by vertices and edges","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Digraph; Combinatorics; Enumeration; Mathematics; Strongly connected component; Discrete mathematics","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001745451,0.0002654491,0.0003920235,0.0001660507,0.0001562173,0.00003411447,0.0003686221,0.0004180502,0.00007051502],"category_scores_gemma":[0.0001718552,0.0002642728,0.0001326273,0.0001462055,0.0003211101,0.0001191259,0.000447727,0.0005446365,0.000001114767],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002179566,"about_ca_system_score_gemma":0.00004120935,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005018272,"about_ca_topic_score_gemma":0.00005001872,"domain_scores_codex":[0.9988858,0.0001209706,0.0002294638,0.0004895616,0.00007808417,0.0001961554],"domain_scores_gemma":[0.9984616,0.0003975136,0.0003357595,0.0005677444,0.0001431223,0.00009426871],"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.0001264539,0.0001297546,0.01065579,0.0005507643,0.0004038943,0.0000162552,0.001205194,0.0005431167,0.002183686,0.9833072,0.000518806,0.0003590802],"study_design_scores_gemma":[0.0007822081,0.000100264,0.003115321,0.0001360161,0.000528804,0.000003201392,0.0003218511,0.007419981,0.003633952,0.9832651,0.0002059119,0.0004873797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9925304,0.0001532858,0.005496609,0.00001371147,0.0003791979,0.0002551558,0.00008279862,0.00007132303,0.001017528],"genre_scores_gemma":[0.998955,0.0001684165,0.0004668177,0.00001061512,0.00004046272,6.018641e-7,0.00002827266,0.00002301375,0.0003067987],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007540471,"threshold_uncertainty_score":0.9999809,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0529623142124644,"score_gpt":0.2020388490285372,"score_spread":0.1490765348160729,"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."}}