{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001386624,0.0007720359,0.0009568553,0.0009572,0.0006135894,0.001151312,0.001517093,0.00130462,0.009146158],"category_scores_gemma":[0.008860871,0.0007748987,0.0007726254,0.00136533,0.0008087823,0.00212331,0.002195899,0.001610703,0.002273098],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006630531,"about_ca_system_score_gemma":0.0006217328,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008848487,"about_ca_topic_score_gemma":0.001450686,"domain_scores_codex":[0.9987676,0.0005031389,0.00004822244,0.0001965391,0.0003999354,0.00008455147],"domain_scores_gemma":[0.9951036,0.003558953,0.0001660121,0.0006274647,0.0004072734,0.0001367715],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001449582,0.0001120621,0.0003659351,0.0001966825,0.000054508,0.0001543076,0.0002295201,0.4107173,0.00622902,0.3757832,0.00828198,0.1977306],"study_design_scores_gemma":[0.0000216268,0.00001494262,0.00003684843,0.000008802133,0.000005939265,0.00005520348,0.00001023336,0.8435899,0.0009074722,0.1536428,0.001697802,0.000008407276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007329564,0.00009345407,0.9890149,0.00009599124,0.00004339557,0.0000523438,0.00007333937,0.0005994283,0.00269751],"genre_scores_gemma":[0.2394048,0.0002426163,0.7518435,0.0001202836,0.0001162576,0.0003954007,0.0004189063,0.0004528168,0.007005458],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009146158,"threshold_uncertainty_score":0.03059691,"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."}}