{"id":"W3192514715","doi":"10.48550/arxiv.1907.02333","title":"Randomized sequential importance sampling for estimating the number of\\n perfect matchings in bipartite graphs","year":2019,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Bipartite graph; Combinatorics; Sampling (signal processing); Limit (mathematics); Discrete mathematics; Graph; Computer science","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007242113,0.0009612949,0.001212,0.001516611,0.000732938,0.001289403,0.003057199,0.001478405,0.001845386],"category_scores_gemma":[0.04129071,0.0009067813,0.0006649709,0.001438211,0.003004093,0.002908712,0.001816925,0.002041641,0.0002896617],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001804669,"about_ca_system_score_gemma":0.001525871,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003883631,"about_ca_topic_score_gemma":0.004581319,"domain_scores_codex":[0.9968452,0.001826966,0.0000875012,0.0004944736,0.0005324826,0.0002134364],"domain_scores_gemma":[0.9695338,0.02601007,0.00138308,0.001694698,0.0007695354,0.0006088613],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006696892,0.0002516978,0.004822204,0.0003520907,0.0001817243,0.000124415,0.000160575,0.6660128,0.004176478,0.261983,0.002931816,0.05833362],"study_design_scores_gemma":[0.00002289445,0.00002060949,0.0001502997,0.000008165282,0.000007631341,0.00001135839,0.000004549174,0.9618658,0.0004663042,0.03725344,0.0001832014,0.000005728974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03218604,0.0004463116,0.9654295,0.0003795608,0.00006908039,0.00007391565,0.00007313112,0.0003025831,0.001039991],"genre_scores_gemma":[0.6655793,0.0007468141,0.3295837,0.0003486705,0.0003512727,0.0003621627,0.0004794995,0.0001711842,0.002377392],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007242113,"threshold_uncertainty_score":0.0383004,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1280888965388046,"score_gpt":0.2911100654733356,"score_spread":0.163021168934531,"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."}}