{"id":"W2897704917","doi":"10.1137/1.9781611975482.37","title":"Finding Maximal Sets of Laminar 3-Separators in Planar Graphs in Linear Time","year":2019,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Laminar flow; Disjoint sets; Combinatorics; Mathematics; Planar graph; Vertex (graph theory); Graph; Discrete mathematics; Planar; Computer science; Physics; Mechanics","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.000976792,0.0003816089,0.0008380612,0.0002485407,0.00007192864,0.00003995703,0.0006475696,0.0007615745,0.000007583963],"category_scores_gemma":[0.00002168298,0.0003676145,0.0003269577,0.00009182838,0.0002315612,0.00006094476,0.0002798989,0.0007858941,0.00001214301],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000701094,"about_ca_system_score_gemma":0.0001903422,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001746226,"about_ca_topic_score_gemma":0.000002625961,"domain_scores_codex":[0.9979386,0.00001035665,0.0006911781,0.0005300686,0.0003891641,0.000440665],"domain_scores_gemma":[0.9984536,0.000563758,0.0003895976,0.0004663105,0.00004284164,0.00008386622],"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.0000528772,0.00003499222,0.000004075028,0.0003192274,0.00007403547,0.000003021353,0.00166716,0.00001831252,0.0005631967,0.9921446,0.0003787233,0.00473976],"study_design_scores_gemma":[0.002519452,0.0001937909,9.240796e-7,0.0005749129,0.00003076246,0.000005119512,0.0001881871,0.00338013,0.0012639,0.9882722,0.003022411,0.0005481811],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.0857731,0.0005398124,0.03610136,0.0002500043,0.001125565,0.02038382,0.00121361,0.000451816,0.8541609],"genre_scores_gemma":[0.03252307,0.0002118696,0.5375803,0.0002964839,0.000701552,0.0007721444,0.0002770901,0.0007106261,0.4269269],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.5014789,"threshold_uncertainty_score":0.9998776,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05912181164447611,"score_gpt":0.2845468274974068,"score_spread":0.2254250158529307,"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."}}