{"id":"W2066946142","doi":"10.1016/j.dam.2007.02.006","title":"Lower bounds on the pathwidth of some grid-like graphs","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Ottawa; University of Victoria","funders":"","keywords":"Mathematics; Pathwidth; Combinatorics; Upper and lower bounds; Vertex (graph theory); Chordal graph; Mathematical proof; Discrete mathematics; Matching (statistics); Grid; Graph; Line graph; Statistics","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.002024906,0.001741968,0.001574316,0.002993764,0.001696894,0.003542334,0.004112524,0.00179342,0.009138953],"category_scores_gemma":[0.01574606,0.001127826,0.001265718,0.003893369,0.002496133,0.007031804,0.00285475,0.005367833,0.001016099],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002459621,"about_ca_system_score_gemma":0.0009537765,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001668024,"about_ca_topic_score_gemma":0.002719687,"domain_scores_codex":[0.998659,0.0003373217,0.00005682508,0.0002848117,0.0003605182,0.0003015737],"domain_scores_gemma":[0.9756874,0.01927486,0.001338712,0.001621738,0.0008363876,0.001240861],"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.001910174,0.000440446,0.008649021,0.00143066,0.000350103,0.0005425505,0.001204725,0.2161213,0.02245892,0.6364169,0.03124342,0.07923178],"study_design_scores_gemma":[0.0001168181,0.0001355304,0.002356001,0.0001264054,0.000130684,0.0005663418,0.0003269133,0.2483073,0.003765953,0.7363285,0.007792798,0.00004678652],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5427961,0.009254667,0.3528488,0.01024075,0.0004106667,0.0001686052,0.004290728,0.001655079,0.07833462],"genre_scores_gemma":[0.869776,0.005276746,0.1088758,0.001438332,0.0005992354,0.0003090191,0.003350804,0.0008092537,0.009564899],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009138953,"threshold_uncertainty_score":0.03057283,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02064470322813984,"score_gpt":0.2783607390511457,"score_spread":0.2577160358230058,"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."}}