{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006387467,0.000411725,0.0006803307,0.0006849274,0.0002099005,0.0002910679,0.001977862,0.0002081893,0.00001541236],"category_scores_gemma":[0.0001001348,0.000401351,0.0002953396,0.001266869,0.0004345413,0.001289637,0.0009292848,0.0004436765,0.00001987784],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001576725,"about_ca_system_score_gemma":0.0001440944,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001007173,"about_ca_topic_score_gemma":0.0002808813,"domain_scores_codex":[0.9968035,0.00006354704,0.00145111,0.0003828072,0.0005005044,0.0007985526],"domain_scores_gemma":[0.9977181,0.0002438918,0.0004932758,0.001129008,0.0002775421,0.0001382099],"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.0001540685,0.003534581,0.02516665,0.003911237,0.0003833764,0.00001216679,0.02330869,0.001212528,0.0007134675,0.8526258,0.005907991,0.08306946],"study_design_scores_gemma":[0.01039933,0.001111172,0.01091688,0.002225006,0.00007226683,0.00005365091,0.00301291,0.7183742,0.01137737,0.1688376,0.07182772,0.001791861],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2877148,0.0001517836,0.6802511,0.002073417,0.002088367,0.002473165,0.0005142828,0.000382079,0.02435102],"genre_scores_gemma":[0.9033978,0.00002546344,0.09532414,0.000566758,0.00005045553,0.00009925381,0.0001359223,0.00002292486,0.0003772853],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7171617,"threshold_uncertainty_score":0.9998438,"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."}}