{"id":"W4221140426","doi":"10.4230/lipics.swat.2022.19","title":"An Optimal Algorithm for Product Structure in Planar Graphs","year":2022,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa; Carleton University","funders":"","keywords":"Mathematics; Combinatorics; Planar graph; Product (mathematics); Planar; Graph; Path (computing); Discrete mathematics; Time complexity; Treewidth; Algorithm; Pathwidth; Computer science; Geometry; Line graph","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.0007434708,0.002246758,0.001502091,0.00215648,0.001229039,0.002236489,0.003105193,0.002005047,0.03080301],"category_scores_gemma":[0.003737827,0.001304268,0.002149264,0.003282997,0.001144043,0.006189504,0.004648193,0.002153317,0.01136961],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001546687,"about_ca_system_score_gemma":0.002010402,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002458339,"about_ca_topic_score_gemma":0.003315002,"domain_scores_codex":[0.9986449,0.0001591613,0.0001064775,0.0004521269,0.0003939747,0.0002435179],"domain_scores_gemma":[0.9978758,0.0007716024,0.0001108896,0.0006668527,0.0004450206,0.000129898],"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.0007967812,0.0003877949,0.00127198,0.0008257659,0.0001143053,0.0002405562,0.0003752396,0.03237746,0.02238547,0.06530039,0.06618987,0.8097344],"study_design_scores_gemma":[0.0008776977,0.000489368,0.001328743,0.0001399821,0.0002905965,0.001179093,0.000504375,0.5011726,0.0310494,0.3940031,0.06882516,0.0001398748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02271936,0.0004663293,0.9490615,0.0006653817,0.0001246718,0.0003508251,0.001361479,0.01088268,0.01436784],"genre_scores_gemma":[0.1021846,0.0003485755,0.8784311,0.0002662737,0.00008543708,0.0004638788,0.006636065,0.001862667,0.009721412],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03080301,"threshold_uncertainty_score":0.1030463,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01942881719409548,"score_gpt":0.3105806399749501,"score_spread":0.2911518227808546,"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."}}