{"id":"W2500625161","doi":"10.1007/978-3-662-49529-2_39","title":"Generating Random Spanning Trees via Fast Matrix Multiplication","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Spanning tree; Matrix multiplication; Computer science; Random graph; Laplacian matrix; Minimum spanning tree; Kruskal's algorithm; Algorithm; Combinatorics; Graph; Mathematics; Theoretical computer science","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001607849,0.0004412819,0.0005948833,0.0004003308,0.0002385248,0.0001665627,0.0007582091,0.0003047599,0.00002224482],"category_scores_gemma":[0.000475454,0.0003271676,0.0001649517,0.0001557999,0.0003210627,0.0001591992,0.0003855783,0.0004303401,0.000001148355],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002026477,"about_ca_system_score_gemma":0.000129883,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001052215,"about_ca_topic_score_gemma":0.00009844081,"domain_scores_codex":[0.9974331,0.00006921653,0.0005671441,0.0009128532,0.0005630305,0.0004546136],"domain_scores_gemma":[0.9968205,0.001607044,0.0004040767,0.000844094,0.0002082355,0.0001160431],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001797769,0.00001346285,0.00001857835,0.00006692226,0.00001364019,0.00001604075,0.0006712499,0.00309662,0.008136927,0.006273709,0.00003140224,0.9816435],"study_design_scores_gemma":[0.001561738,0.0001086213,0.000008103139,0.001318679,0.0000439161,0.00007135821,6.629944e-7,0.8306846,0.006238498,0.1563949,0.002515751,0.001053193],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000288722,0.0003137977,0.994642,0.0002917128,0.0007543841,0.0004812234,0.000008928774,0.0001039699,0.003115219],"genre_scores_gemma":[0.02205427,0.00002960322,0.9728253,0.0003244041,0.001369174,0.00002118568,0.000003920581,0.00006851534,0.003303595],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9805903,"threshold_uncertainty_score":0.999918,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03671713926362286,"score_gpt":0.3227779818664565,"score_spread":0.2860608426028337,"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."}}