{"id":"W7109957065","doi":"10.4230/lipics.itcs.2025.43","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Institute for the Theory of Computing, University of California Berkeley; National Science Foundation","keywords":"Upper and lower bounds; Minimum cut; Graph; Streaming algorithm; Time complexity; Space (punctuation); Data stream mining; Cut; Matching (statistics)","routes":{"ca_aff":true,"ca_fund":true,"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.002361916,0.001337598,0.001670897,0.0009268629,0.001083784,0.003704952,0.002992,0.002079979,0.006580894],"category_scores_gemma":[0.01672945,0.0007521692,0.001560242,0.00212198,0.001297063,0.007697978,0.002494426,0.002952471,0.001098348],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001977262,"about_ca_system_score_gemma":0.00176426,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002657002,"about_ca_topic_score_gemma":0.003466326,"domain_scores_codex":[0.996969,0.0006458784,0.0002598558,0.0008777745,0.0008622301,0.0003852522],"domain_scores_gemma":[0.9877446,0.008972505,0.0007634215,0.001389339,0.0007078712,0.0004221884],"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.001684882,0.0004256868,0.003774285,0.001014957,0.0001988155,0.0003542083,0.0006337639,0.7289475,0.01413679,0.07892165,0.00823579,0.1616718],"study_design_scores_gemma":[0.00008422963,0.00008404917,0.0002942919,0.00002484723,0.00002930387,0.0001247913,0.0001132858,0.9044859,0.004499192,0.08886652,0.001378418,0.00001508851],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1554367,0.001133496,0.8296772,0.002249849,0.0001119575,0.0003584295,0.001584213,0.003123054,0.006325128],"genre_scores_gemma":[0.5228822,0.0008801105,0.4668427,0.0003431391,0.0001591506,0.0005611523,0.00296136,0.0006202925,0.004749907],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006580894,"threshold_uncertainty_score":0.02201527,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03389015576445151,"score_gpt":0.2651883697432718,"score_spread":0.2312982139788202,"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."}}