{"id":"W2027783832","doi":"10.1016/s0304-3975(01)00408-x","title":"Embedding problems for paths with direction constrained edges","year":2002,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Consiglio Nazionale delle Ricerche; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Reachability; Embedding; Planar graph; Graph embedding; Path (computing); Mathematics; Book embedding; Graph; Planar; Context (archaeology); Characterization (materials science); Combinatorics; Algorithm; Computer science; Topology (electrical circuits); Discrete mathematics; Artificial intelligence; Pathwidth; Line graph","routes":{"ca_aff":true,"ca_fund":true,"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.001182569,0.001742921,0.001498714,0.001349553,0.0007660792,0.002152613,0.002312327,0.00345044,0.007255221],"category_scores_gemma":[0.009798901,0.001382375,0.001039593,0.001402799,0.001824971,0.006582493,0.004103876,0.003903377,0.0007639705],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009632261,"about_ca_system_score_gemma":0.0006764663,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002012781,"about_ca_topic_score_gemma":0.001620795,"domain_scores_codex":[0.9992571,0.0002499392,0.00004288567,0.000224874,0.0001490269,0.00007617084],"domain_scores_gemma":[0.9952784,0.003530207,0.0003817104,0.0002635828,0.0002514592,0.0002947961],"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.0002568535,0.0001831022,0.0007450154,0.0005395033,0.00007124124,0.0002496339,0.0004140447,0.3796042,0.00253955,0.5403616,0.006672326,0.06836306],"study_design_scores_gemma":[0.00003989254,0.00006644963,0.000140967,0.00005336277,0.00002147621,0.0001126585,0.0001307859,0.4705451,0.0007170006,0.5240726,0.004077564,0.00002212204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06271102,0.0008636583,0.9266706,0.0009588898,0.0001015656,0.00008556645,0.0003498667,0.0001636745,0.00809528],"genre_scores_gemma":[0.5113872,0.002442555,0.443783,0.000342432,0.000357414,0.0003718734,0.00204505,0.0006101821,0.03866028],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007255221,"threshold_uncertainty_score":0.02427113,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01763098016179185,"score_gpt":0.2455291094341967,"score_spread":0.2278981292724049,"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."}}