{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002197799,0.0001542257,0.0004988329,0.00007683768,0.00007531959,0.00001728427,0.0002495146,0.00007524154,0.00005890079],"category_scores_gemma":[0.0005080756,0.0001222332,0.0003200708,0.0003032871,0.00009421998,0.0001288788,0.00007574142,0.0001508613,5.593303e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004327737,"about_ca_system_score_gemma":0.00003448489,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008263908,"about_ca_topic_score_gemma":0.00004993528,"domain_scores_codex":[0.9988174,0.0002547096,0.0003162132,0.0003037472,0.00006164036,0.0002462846],"domain_scores_gemma":[0.9971066,0.00210826,0.0002971844,0.0003674769,0.00007882938,0.00004171234],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.008038568,0.00009512571,0.04218223,0.0005013746,0.0001687002,0.00001474772,0.00167675,0.006776066,0.002171002,0.9380497,0.00005913547,0.0002666027],"study_design_scores_gemma":[0.06331388,0.00003717796,0.00008109314,0.0002616655,0.0002607406,0.0000096372,0.000879177,0.5836126,0.001292728,0.3497505,0.00008193948,0.0004188832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8254448,0.00001267255,0.1719676,0.00002098865,0.0001791381,0.0006996495,0.000005485872,0.00002895625,0.001640756],"genre_scores_gemma":[0.950884,0.00001078117,0.04850269,0.00003263258,0.00002764046,0.000004411778,0.000002662426,0.0000211891,0.0005139483],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5882992,"threshold_uncertainty_score":0.4984525,"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."}}