{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004388333,0.0001876077,0.0001585868,0.0001288962,0.0001290136,0.0005139222,0.0005596757,0.00004376464,0.00009162613],"category_scores_gemma":[0.00001148453,0.0001550371,0.00008775519,0.0003504473,0.00006113318,0.001087195,0.0004993381,0.00007488243,0.0001568037],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000211787,"about_ca_system_score_gemma":0.00001985471,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000343682,"about_ca_topic_score_gemma":0.000005897583,"domain_scores_codex":[0.9985497,0.00001983639,0.0002206822,0.0006223319,0.0002594444,0.0003279922],"domain_scores_gemma":[0.9993104,0.00008242628,0.00002475576,0.0004223848,0.00003670872,0.0001232706],"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.000007736862,0.0001027524,0.0000694801,0.0001269659,0.0001480452,0.0000619577,0.0003483854,0.000008623126,0.0004187277,0.01714869,0.07396732,0.9075913],"study_design_scores_gemma":[0.0003090699,0.00007116825,0.0001409891,0.00001927523,0.00002233287,0.0000134505,0.00003403941,0.9152126,0.0008550141,0.003252706,0.07983542,0.0002339136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001028908,0.0003040276,0.9931796,0.002136054,0.0006307241,0.0006501742,0.0001390058,0.0004369469,0.001494598],"genre_scores_gemma":[0.005470572,0.00007085282,0.9779735,0.001547185,0.0003484025,0.0001533458,0.0005033342,0.00003953657,0.01389322],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.915204,"threshold_uncertainty_score":0.6322228,"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."}}