{"id":"W4320917315","doi":"10.1002/rsa.21145","title":"Approximately counting independent sets in bipartite graphs via graph containers","year":2023,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"York University","funders":"National Science Foundation","keywords":"Bipartite graph; Mathematics; Combinatorics; Complete bipartite graph; Discrete mathematics; Cograph; Maximal independent set; Partition (number theory); Line graph; Graph; 1-planar graph","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.002858264,0.00104018,0.001447516,0.001850916,0.0008025703,0.002425675,0.003474603,0.001513098,0.004861227],"category_scores_gemma":[0.01334347,0.0008790001,0.001304002,0.002398828,0.00233539,0.006772387,0.003381273,0.002735795,0.0006468231],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003016964,"about_ca_system_score_gemma":0.001882253,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002730702,"about_ca_topic_score_gemma":0.002589969,"domain_scores_codex":[0.9980337,0.0007154032,0.00007266909,0.0004377063,0.0004692597,0.0002712636],"domain_scores_gemma":[0.9917957,0.005889406,0.0005006303,0.001084466,0.0004328433,0.000296997],"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.0003528256,0.0001384412,0.001458225,0.0001670021,0.0000702878,0.00009035216,0.0001700795,0.5475065,0.003715965,0.3881822,0.005848436,0.05229967],"study_design_scores_gemma":[0.00001869273,0.00001672681,0.0000770839,0.00001079747,0.000006728293,0.00002143999,0.00001939256,0.8826057,0.001056204,0.1155551,0.0006041317,0.000008168415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08022983,0.0002386379,0.9117041,0.000667446,0.00006142515,0.0001319253,0.000258366,0.001277886,0.005430478],"genre_scores_gemma":[0.5392058,0.0002111422,0.4550589,0.0002166135,0.00007940603,0.0004561763,0.0005594992,0.0004218306,0.003790637],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004861227,"threshold_uncertainty_score":0.02188969,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02499974722125604,"score_gpt":0.2925942349959278,"score_spread":0.2675944877746718,"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."}}