{"id":"W4404848320","doi":"10.1109/focs61266.2024.00120","title":"Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality","year":2024,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"National Science Foundation","keywords":"Duality (order theory); Flow (mathematics); Computer science; Algorithm; Mathematics; Mathematical optimization; Discrete mathematics; Geometry","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.002139481,0.001897232,0.001703016,0.001717559,0.0009753086,0.003560054,0.003837661,0.001831452,0.007149711],"category_scores_gemma":[0.008859305,0.001057209,0.002306796,0.002294352,0.001659329,0.006541868,0.003016038,0.003948087,0.001607604],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003475226,"about_ca_system_score_gemma":0.002652783,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004101407,"about_ca_topic_score_gemma":0.004489586,"domain_scores_codex":[0.9975574,0.0005399655,0.0001239942,0.0007586547,0.0005324134,0.0004875535],"domain_scores_gemma":[0.9947655,0.002666746,0.0005586211,0.001298475,0.0004346527,0.0002760334],"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.001138292,0.0006822456,0.002482154,0.0007407377,0.0001558145,0.000232408,0.0005280394,0.3887147,0.01007478,0.286923,0.02053174,0.2877961],"study_design_scores_gemma":[0.0001130221,0.0000957653,0.0003332496,0.00004229853,0.00004679052,0.0001830046,0.00008594865,0.7206575,0.005597409,0.2678184,0.004991239,0.00003531112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03894728,0.0006217569,0.9467178,0.001475653,0.00008802307,0.000192676,0.0006086339,0.003366267,0.007981983],"genre_scores_gemma":[0.3036317,0.0004264674,0.6859822,0.0007329958,0.0001508974,0.000317266,0.001938049,0.001032076,0.00578827],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007149711,"threshold_uncertainty_score":0.02521461,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02647731292047804,"score_gpt":0.2952327137554567,"score_spread":0.2687554008349787,"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."}}