{"id":"W4319835964","doi":"10.1002/rsa.21127","title":"The number of perfect matchings, and the nesting properties, of random regular graphs","year":2023,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Random graph; Discrete mathematics; Asymptotically optimal algorithm; Nesting (process); Graph; Mathematical optimization","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.0009999594,0.000155125,0.0004801728,0.00002470946,0.0003191835,0.00004947495,0.000148987,0.00005544997,0.000005747587],"category_scores_gemma":[0.001855097,0.00006732743,0.00008299671,0.0001835554,0.000396577,0.00003092637,0.0001002789,0.0001383023,2.926259e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002858202,"about_ca_system_score_gemma":0.00002169503,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007138809,"about_ca_topic_score_gemma":0.000004220683,"domain_scores_codex":[0.9988462,0.0001140297,0.0003943355,0.000167433,0.0002713825,0.0002065581],"domain_scores_gemma":[0.9966859,0.002792978,0.0001967924,0.000188658,0.00009064563,0.00004503958],"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.002528754,0.00001303896,0.0000534416,0.0009088971,0.000211028,0.000005318174,0.002441645,0.00001310214,0.0009914441,0.9439532,0.0001936797,0.04868647],"study_design_scores_gemma":[0.009828702,0.00003051976,0.00007817861,0.0001370621,0.0001344144,0.00006209008,0.0006703346,0.02817785,0.001125872,0.9595964,0.00005218612,0.0001064246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9187404,0.005663341,0.07245702,0.000850175,0.0004303195,0.001440407,0.00007035131,0.00009957744,0.000248448],"genre_scores_gemma":[0.9947767,0.0006747566,0.004337867,0.00001892632,0.00005305225,0.00002810278,0.000001569039,0.0000202102,0.00008881693],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.07603633,"threshold_uncertainty_score":0.2745533,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02206476095417288,"score_gpt":0.2798621348979656,"score_spread":0.2577973739437928,"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."}}