{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004357923,0.001075822,0.0007476321,0.0004808607,0.0004850356,0.001196159,0.001204168,0.0006759217,0.01031398],"category_scores_gemma":[0.002428136,0.0005945652,0.0007278704,0.001122745,0.0007075372,0.003576642,0.001620402,0.001643025,0.001856875],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009408676,"about_ca_system_score_gemma":0.001004738,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002205619,"about_ca_topic_score_gemma":0.002850055,"domain_scores_codex":[0.9995754,0.00006464054,0.00001917364,0.0001289084,0.0001549698,0.0000568164],"domain_scores_gemma":[0.9993997,0.00034834,0.00004730072,0.0001250671,0.00005153365,0.0000280475],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003759247,0.0001291279,0.000715644,0.0006915724,0.00004803545,0.0001514204,0.000344104,0.2316111,0.01508274,0.1992629,0.0175818,0.5340056],"study_design_scores_gemma":[0.00007013918,0.0001300942,0.0002593953,0.0000381594,0.0000211137,0.0001930207,0.00007919589,0.7698113,0.007167937,0.202395,0.01981348,0.00002099691],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.02426,0.000227265,0.9618429,0.000371606,0.00003806017,0.0001100921,0.0002979196,0.0009797247,0.01187239],"genre_scores_gemma":[0.1177401,0.0003533401,0.8699102,0.0001347752,0.00004685487,0.0001934064,0.0008448847,0.0003725491,0.01040396],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.01031398,"threshold_uncertainty_score":0.0345037,"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."}}