{"id":"W2592011129","doi":"10.1002/rsa.20415","title":"Asymptotic enumeration of sparse 2‐connected graphs","year":2012,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo; Natural Sciences and Engineering Research Council of Canada; Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Mathematics; Enumeration; Social connectedness; Degree (music); Sequence (biology); Simple (philosophy); Discrete mathematics; Kernel (algebra); Wright; struct; Computer science; Physics","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.0009715891,0.0003050466,0.0005998857,0.001833094,0.0006144099,0.001585955,0.001250452,0.001022235,0.00297878],"category_scores_gemma":[0.01687362,0.000416079,0.0003239197,0.001006512,0.001536571,0.002963463,0.001417366,0.0008613446,0.0003026048],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00106181,"about_ca_system_score_gemma":0.0004105747,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004332319,"about_ca_topic_score_gemma":0.0007468149,"domain_scores_codex":[0.9990587,0.0002908692,0.00003604504,0.0001854864,0.0003145358,0.0001143739],"domain_scores_gemma":[0.99084,0.005937158,0.0009593256,0.000931401,0.0008525256,0.0004795747],"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.0004929296,0.000161028,0.01604025,0.0003740087,0.00005827544,0.0004522775,0.0006873361,0.07704505,0.02194896,0.8362297,0.006189092,0.04032112],"study_design_scores_gemma":[0.00003608871,0.00005729245,0.004240966,0.00004622371,0.00002005739,0.00061013,0.0001217363,0.4128729,0.005770445,0.5737852,0.002415607,0.00002327322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8275294,0.0003674663,0.1541394,0.0008523469,0.00004585593,0.0000378513,0.0003255248,0.0003966542,0.01630544],"genre_scores_gemma":[0.9775524,0.0001363305,0.01914451,0.0001130018,0.00005936968,0.00007988956,0.0003743361,0.00006837177,0.00247174],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00297878,"threshold_uncertainty_score":0.009965003,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02446267204941581,"score_gpt":0.280264280877933,"score_spread":0.2558016088285172,"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."}}