{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004344733,0.0006542132,0.0006248221,0.001320352,0.001619049,0.001763152,0.001107263,0.0007838596,0.008464288],"category_scores_gemma":[0.004224874,0.0005469293,0.0007947558,0.00272351,0.001788663,0.004731258,0.002028582,0.001639516,0.000726562],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001095731,"about_ca_system_score_gemma":0.0004781928,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002737728,"about_ca_topic_score_gemma":0.001783097,"domain_scores_codex":[0.9991357,0.0002571422,0.00004410754,0.0002059523,0.0001750778,0.000182126],"domain_scores_gemma":[0.9967772,0.001614599,0.000594456,0.0004216369,0.0003477962,0.0002442047],"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.0005155268,0.0001569319,0.003025627,0.0002669876,0.00005509679,0.0005985562,0.001296134,0.08346001,0.007039092,0.8434125,0.005199199,0.0549744],"study_design_scores_gemma":[0.00005964373,0.0001145915,0.001808299,0.0001213845,0.00004777422,0.0005276409,0.0009068626,0.115333,0.003285448,0.8621261,0.01562504,0.00004418831],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.605355,0.0006475612,0.3356128,0.001042402,0.00008236698,0.0001772544,0.001216736,0.0006021538,0.05526385],"genre_scores_gemma":[0.8896769,0.0009407453,0.097679,0.000363979,0.00007808508,0.0002018616,0.001933689,0.0002560695,0.008869625],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008464288,"threshold_uncertainty_score":0.02831584,"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."}}