{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002765542,0.001229377,0.001352985,0.002060795,0.001315991,0.002847638,0.003857813,0.001725329,0.006117743],"category_scores_gemma":[0.01761274,0.0008835508,0.001302511,0.002801053,0.002475314,0.006724435,0.003752215,0.003437279,0.00207001],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002393818,"about_ca_system_score_gemma":0.002477363,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001972076,"about_ca_topic_score_gemma":0.002950128,"domain_scores_codex":[0.9971399,0.001022272,0.0001356133,0.0006316726,0.0007781148,0.0002923825],"domain_scores_gemma":[0.9909307,0.004679932,0.0006590393,0.002514139,0.0007954852,0.000420743],"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.0003002096,0.000299489,0.001891985,0.0002317653,0.00006904359,0.0000853196,0.0003283107,0.3609412,0.008399373,0.4968067,0.009609058,0.1210376],"study_design_scores_gemma":[0.0000192445,0.00003419703,0.0001098334,0.00001863554,0.000009358348,0.00005202443,0.00004251937,0.8198107,0.002428157,0.1753184,0.002138246,0.00001849138],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01047147,0.00006292859,0.9853735,0.0003124202,0.00003940976,0.00006776649,0.0001329623,0.0008728471,0.002666665],"genre_scores_gemma":[0.2150733,0.0001486548,0.779075,0.0003267392,0.0001062448,0.0003393602,0.0005970139,0.0005583773,0.003775391],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006117743,"threshold_uncertainty_score":0.02046585,"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."}}