{"id":"W1532852577","doi":"10.46298/dmtcs.482","title":"On edge-intersection graphs of k-bend paths in grids","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Pathwidth; 1-planar graph; Indifference graph; Chordal graph; Planar graph; Outerplanar graph; Longest path problem; Discrete mathematics; Grid; Clique-sum; Lattice graph; Line graph; Graph; Voltage graph; Geometry","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002723555,0.0002692772,0.000369942,0.0007809208,0.0002096465,0.0002422988,0.00327377,0.0000944437,0.00005834557],"category_scores_gemma":[0.0004762653,0.000212765,0.0001407981,0.002288467,0.003553834,0.0006653706,0.001047341,0.0006941771,0.00004010502],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003879797,"about_ca_system_score_gemma":0.0001021176,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002765224,"about_ca_topic_score_gemma":0.000005365926,"domain_scores_codex":[0.9966176,0.0001184016,0.0005667405,0.0008081004,0.001165496,0.0007237158],"domain_scores_gemma":[0.9969517,0.0008517355,0.0001613103,0.001527904,0.0002370322,0.0002703431],"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.00001297708,0.0001824083,0.00005051714,0.00003116683,0.000003793442,0.00001133221,0.001189235,0.00008939843,0.009273616,0.9840255,0.000007455507,0.005122632],"study_design_scores_gemma":[0.0002003581,0.0002510778,0.0001888626,0.000069421,0.000001890662,0.00002116293,0.00003312339,0.3039213,0.01154626,0.6835895,0.000004272826,0.0001727795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2878269,0.000003778567,0.706123,0.0001653504,0.0005846893,0.0002486719,0.000002715363,0.0000802463,0.004964645],"genre_scores_gemma":[0.8116301,0.0000018368,0.1882358,0.00006917187,0.00002864726,0.00001440477,6.059317e-7,0.00001331019,0.000006090165],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5238032,"threshold_uncertainty_score":0.9991579,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01211023971228042,"score_gpt":0.2889517041416278,"score_spread":0.2768414644293474,"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."}}