{"id":"W4384918518","doi":"10.4230/lipics.icalp.2024.35","title":"A Spectral Approach to Approximately Counting Independent Sets in Dense Bipartite Graphs","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Enumeration; Bipartite graph; Combinatorics; Mathematics; Bounded function; Independent set; Subspace topology; Discrete mathematics; Dense graph; Maximal independent set; Cograph; Split graph; Counting problem; Pathwidth; Graph; Line graph","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007714789,0.0004657817,0.0005201221,0.001297658,0.0001971232,0.0003440398,0.002875141,0.0003153237,0.000007040288],"category_scores_gemma":[0.00004232058,0.0005766813,0.0002945947,0.002752967,0.0001133598,0.0003885532,0.00411159,0.001080968,0.0001555668],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002718937,"about_ca_system_score_gemma":0.0001854998,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00073841,"about_ca_topic_score_gemma":0.0004389521,"domain_scores_codex":[0.9964424,0.0001806118,0.0003757413,0.001915114,0.000264224,0.0008219372],"domain_scores_gemma":[0.9978509,0.0001135988,0.0002161108,0.001443158,0.0000935831,0.000282645],"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.0000428586,0.0003804952,0.01204334,0.0002076205,0.0001065234,0.001050618,0.001610211,0.3028397,0.00002178074,0.6808279,0.0002941966,0.0005747515],"study_design_scores_gemma":[0.000464122,0.0000399192,0.0153173,0.000149937,0.00002397602,0.00001594268,0.0001549624,0.7023039,0.00005176731,0.2806499,0.0001196037,0.000708607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6015309,0.00003132566,0.3935926,0.0001354515,0.0008651948,0.0006834298,0.00002830014,0.000635059,0.002497713],"genre_scores_gemma":[0.9825045,0.00005690789,0.01678068,0.0001138549,0.00005171803,0.000007811624,0.0000217638,0.00003437684,0.0004283233],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.400178,"threshold_uncertainty_score":0.9996685,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1275355481987362,"score_gpt":0.2162413506514921,"score_spread":0.08870580245275583,"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."}}