{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005955499,0.0004230753,0.0004813585,0.0006230455,0.001205653,0.0007959454,0.001153463,0.0001685305,0.0001218389],"category_scores_gemma":[0.0002256657,0.0003933693,0.0003427313,0.002294885,0.0002931838,0.000273872,0.0007044175,0.000228359,0.00002610656],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007767208,"about_ca_system_score_gemma":0.0002284864,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003405267,"about_ca_topic_score_gemma":0.00001029168,"domain_scores_codex":[0.9966718,0.0002353489,0.0008976214,0.001107593,0.0004276512,0.0006599922],"domain_scores_gemma":[0.9972519,0.00068349,0.0002375031,0.0009141754,0.0007457741,0.0001671523],"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.00006285909,0.0006835042,0.0001492564,0.000220438,0.00009973197,0.000003673397,0.001163721,0.01821963,0.0005195385,0.8945446,0.02421134,0.06012173],"study_design_scores_gemma":[0.001282813,0.0001807282,0.0006640049,0.0004240694,0.00005321912,0.000002991023,0.0000615414,0.9065505,0.00870491,0.07094827,0.01073608,0.0003908723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002290993,0.0007476668,0.979699,0.002511955,0.004378161,0.001445124,0.00004579964,0.0002244705,0.008656808],"genre_scores_gemma":[0.8481543,0.00009153796,0.1431625,0.001824521,0.000206317,0.0001959411,0.00004570697,0.00002225673,0.006296929],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8883309,"threshold_uncertainty_score":0.9998518,"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."}}