{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001587345,0.0001288821,0.0001956501,0.001647015,0.0002566385,0.0004456222,0.003029573,0.00003366049,0.00000915595],"category_scores_gemma":[0.00009374308,0.0001223045,0.0002303777,0.002011511,0.000371657,0.001873952,0.0002916254,0.0001285228,0.00001014431],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007988448,"about_ca_system_score_gemma":0.0005894788,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009113349,"about_ca_topic_score_gemma":0.000003431096,"domain_scores_codex":[0.9974748,0.0000371532,0.0006421134,0.0003028154,0.001286455,0.000256654],"domain_scores_gemma":[0.9958621,0.0002848812,0.00057224,0.0003426061,0.002824873,0.0001132727],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003652849,0.0003638321,0.0004486516,0.00002163788,0.0001423322,0.00002276826,0.000336852,0.03878653,0.001758559,0.177409,0.002243332,0.7784299],"study_design_scores_gemma":[0.0007560627,0.0004028968,0.005109477,0.00008741727,0.00001267256,0.00006845995,0.00001088986,0.8775856,0.002284993,0.107001,0.006524959,0.0001555579],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005050615,0.00001737416,0.9878244,0.002129044,0.004659262,0.0001576789,0.0000143065,0.00006459496,0.00008269521],"genre_scores_gemma":[0.2458355,0.00001323933,0.7535205,0.0001997439,0.000383499,0.000009202051,0.000009330371,0.000006698604,0.0000222346],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8387991,"threshold_uncertainty_score":0.5629752,"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."}}