{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009582156,0.0003626904,0.0006207192,0.0004803131,0.0003620378,0.00010417,0.0002474283,0.0002061242,0.00005857403],"category_scores_gemma":[0.0001634503,0.0002741801,0.0001703744,0.0007040447,0.0002025326,0.0001478125,0.0001826677,0.0003800474,0.000002325891],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000212292,"about_ca_system_score_gemma":0.00001739229,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009142156,"about_ca_topic_score_gemma":0.00006020232,"domain_scores_codex":[0.9977524,0.0001490777,0.0005543382,0.0004913519,0.0004360374,0.0006167647],"domain_scores_gemma":[0.998772,0.000524624,0.0001854348,0.0003227449,0.00005709559,0.0001381298],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001695602,0.0001235529,0.0361411,0.001190025,0.0007861241,0.0006942638,0.01524484,0.0003103203,0.005927874,0.8427499,0.002335544,0.09280088],"study_design_scores_gemma":[0.00598595,0.00004618209,0.01157014,0.00005531703,0.00004848387,0.00007847745,0.0007149518,0.004465833,0.0008991662,0.9754576,0.0002567348,0.0004211751],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.996388,0.0004603299,0.0009663156,0.00008716479,0.0006410274,0.0005746581,0.00004117373,0.0002395677,0.0006017262],"genre_scores_gemma":[0.9968826,0.0002999728,0.002433065,0.0001227274,0.00009898755,0.00004419838,0.0000258263,0.00005070079,0.0000419273],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1327077,"threshold_uncertainty_score":0.999971,"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."}}