{"id":"W2073677433","doi":"10.1002/rsa.20416","title":"Asymptotic enumeration of strongly connected digraphs by vertices and edges","year":2012,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Digraph; Combinatorics; Enumeration; Mathematics; Strongly connected component; 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":[],"consensus_categories":[],"category_scores_codex":[0.000257476,0.0002121577,0.0004024431,0.00007350921,0.00022541,0.0000418879,0.00008897598,0.0001162917,0.00005211876],"category_scores_gemma":[0.000179268,0.0001493285,0.00006604855,0.00008673273,0.0002220171,0.0001983961,0.00006194412,0.0001258228,1.286857e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005393589,"about_ca_system_score_gemma":0.000006783283,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002166075,"about_ca_topic_score_gemma":0.000002494166,"domain_scores_codex":[0.9989198,0.0001105848,0.0003083734,0.0001913108,0.0001930656,0.0002768548],"domain_scores_gemma":[0.9989225,0.000562282,0.000161569,0.0001753832,0.00005158212,0.0001267113],"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.001346263,0.0002446551,0.05070612,0.001175814,0.00129644,0.000004032367,0.02390863,0.00001096168,0.02252631,0.7600877,0.003494571,0.1351985],"study_design_scores_gemma":[0.01555257,0.0004335085,0.09113844,0.0001297819,0.0007435116,0.0001281702,0.001643583,0.001425672,0.03533602,0.8501966,0.002190343,0.00108177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9908822,0.006155638,0.002068971,0.00003102683,0.0003269054,0.0002506974,0.00006091994,0.00003684235,0.000186775],"genre_scores_gemma":[0.9954867,0.0003064171,0.003943498,0.00002757588,0.0001573379,0.000007091214,0.00001339201,0.00001919001,0.0000387354],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1341167,"threshold_uncertainty_score":0.6089439,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01617367823140158,"score_gpt":0.2666530916957399,"score_spread":0.2504794134643383,"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."}}