{"id":"W4318303117","doi":"10.1142/s0129054122460029","title":"Graph Algorithm Based Submodular Function for Sparsest Cut Problem","year":2023,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of New Brunswick","funders":"Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Submodular set function; Mathematics; Minimum cut; Combinatorics; Subroutine; Graph partition; Maximum flow problem; Maximum cut; Partition (number theory); Graph; Weight function; Cut; Discrete mathematics; Minimum weight; Algorithm; Segmentation; Computer science; Image segmentation; Artificial intelligence","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.001547986,0.001427813,0.001925421,0.001108582,0.0008172616,0.001552564,0.00187526,0.001660587,0.004399914],"category_scores_gemma":[0.003993312,0.0004006743,0.0009730092,0.002032606,0.001066284,0.00326623,0.001756932,0.002286414,0.0007989423],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001406542,"about_ca_system_score_gemma":0.001911588,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001990306,"about_ca_topic_score_gemma":0.001982472,"domain_scores_codex":[0.9990419,0.0003493049,0.00003215473,0.0002530635,0.0001755374,0.0001480221],"domain_scores_gemma":[0.9984496,0.001003535,0.0001214416,0.0001370923,0.0001855047,0.0001027652],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002699675,0.0003786435,0.001098994,0.0004840476,0.00008475874,0.000129673,0.0002349317,0.6505513,0.00479045,0.1042253,0.01849245,0.2192595],"study_design_scores_gemma":[0.00004025917,0.0001014801,0.0001611854,0.00001875717,0.00001464432,0.0000827636,0.0000499042,0.9236578,0.0008765789,0.07296831,0.002016365,0.00001210579],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03453886,0.0005762354,0.9577848,0.000619525,0.00006958615,0.0001701824,0.0003052353,0.0005792564,0.00535635],"genre_scores_gemma":[0.4010428,0.0009204024,0.5884243,0.0006316582,0.0001352183,0.0006755252,0.001477894,0.0003677426,0.006324552],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004399914,"threshold_uncertainty_score":0.01471919,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03254517234860851,"score_gpt":0.3020471426313973,"score_spread":0.2695019702827888,"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."}}