{"id":"W4206483022","doi":"10.1137/1.9781611977073.7","title":"Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time","year":2022,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Combinatorics; Planar graph; Flow (mathematics); Mathematics; Bounded function; Planar; Algorithm; Linear programming; Discrete mathematics; Computer science; Graph; Computer graphics (images); 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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000600456,0.0004797745,0.0006961159,0.0001162786,0.000458644,0.0001721351,0.0006505335,0.0006166326,0.0000677535],"category_scores_gemma":[0.00001459902,0.0004828229,0.0004842076,0.00007755324,0.0001666642,0.00007906018,0.00036639,0.0009109714,0.00001209609],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001150339,"about_ca_system_score_gemma":0.0001414641,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007895464,"about_ca_topic_score_gemma":0.000008436823,"domain_scores_codex":[0.9978322,0.000009833126,0.0006402269,0.0006706899,0.0004405403,0.0004064851],"domain_scores_gemma":[0.9986069,0.0003634527,0.0003514753,0.000508602,0.00004060109,0.0001289907],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004152847,0.00008826123,2.147469e-7,0.0002092059,0.0002203008,0.000007006029,0.003502623,0.00004793206,0.0001993661,0.9310852,0.005725591,0.05887277],"study_design_scores_gemma":[0.003877443,0.0003112419,5.681064e-7,0.0003687301,0.0002082449,0.0000555786,0.0003548578,0.07636303,0.0004033645,0.5864943,0.3300178,0.001544785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.00158093,0.0004228871,0.1546906,0.001486929,0.00370854,0.01727147,0.002015646,0.001550148,0.8172728],"genre_scores_gemma":[0.000621616,0.0001263449,0.7263153,0.0007920119,0.003558228,0.001893753,0.0009958545,0.000448329,0.2652486],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.5716246,"threshold_uncertainty_score":0.9997624,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0581106082261173,"score_gpt":0.2417714419108038,"score_spread":0.1836608336846865,"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."}}