{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001565748,0.0002306165,0.0002810303,0.0001821213,0.0001859727,0.00008170423,0.00162231,0.00007786461,0.00002069268],"category_scores_gemma":[0.00006068579,0.0001473972,0.0001425971,0.0007099073,0.0003266601,0.0001727334,0.0003742269,0.0002961113,0.00008336861],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002692722,"about_ca_system_score_gemma":0.00003615004,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.783807e-7,"about_ca_topic_score_gemma":0.000001593672,"domain_scores_codex":[0.9978338,0.0000261121,0.0004571294,0.000347526,0.0007959771,0.0005394202],"domain_scores_gemma":[0.9971603,0.0009357405,0.0002191478,0.001500994,0.00007170213,0.0001121828],"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.00002361086,0.0001223223,0.000005626162,0.0000459352,0.00002496228,0.000008070166,0.001041666,0.00002432728,0.004642955,0.9921572,0.0002629062,0.001640416],"study_design_scores_gemma":[0.0002771904,0.0001138597,0.00006732528,0.00003875383,0.000007669963,0.000005115314,0.0004378455,0.001296349,0.02026248,0.9762977,0.000974195,0.0002215321],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1057856,0.00006826314,0.8548144,0.0003091699,0.0003477698,0.0008115293,0.00001420072,0.0001960828,0.03765299],"genre_scores_gemma":[0.9366483,0.00002205141,0.06240426,0.0005826688,0.00006949662,0.00005103895,0.000003746604,0.00004106015,0.0001773547],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8308627,"threshold_uncertainty_score":0.6010684,"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."}}