{"id":"W7126101570","doi":"10.1109/comcomap68359.2025.11353181","title":"Heuristic-Guided Iterative Compression for Efficient Graph Bipartization","year":2025,"lang":"","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Scalability; Bipartite graph; Graph; Heuristic; Compression (physics); Iterative method; Comparability 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.0006589876,0.001116819,0.001001811,0.001225403,0.0007824737,0.0009103302,0.001249692,0.0008477329,0.004105265],"category_scores_gemma":[0.004006912,0.0004315756,0.0008235313,0.001402545,0.0008487061,0.001481683,0.00143394,0.001232346,0.0008773332],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000782439,"about_ca_system_score_gemma":0.001481859,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002950222,"about_ca_topic_score_gemma":0.005022684,"domain_scores_codex":[0.9994085,0.0001676378,0.00002866035,0.00009985918,0.0001841676,0.0001111829],"domain_scores_gemma":[0.9982298,0.001056915,0.0001143703,0.000297904,0.0002257861,0.00007532632],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002972591,0.000218425,0.001871892,0.0003159877,0.00005845074,0.0003397264,0.0004042978,0.6498111,0.01681244,0.02762766,0.01045471,0.291788],"study_design_scores_gemma":[0.00003896263,0.0000574465,0.0001821931,0.00002119525,0.00001500302,0.00009034001,0.0001121208,0.9730237,0.004030748,0.02005042,0.002368359,0.000009679731],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08829546,0.0006689403,0.8996879,0.0004863195,0.0000909257,0.0002788114,0.0003609244,0.002228861,0.007901924],"genre_scores_gemma":[0.4246133,0.0003230739,0.5699534,0.000257276,0.00004896353,0.0003816951,0.001226204,0.0005505556,0.002645535],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004105265,"threshold_uncertainty_score":0.01373351,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03637757582799904,"score_gpt":0.317448350087059,"score_spread":0.2810707742590599,"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."}}