{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000733909,0.0001445053,0.0001392054,0.000189457,0.0005383721,0.0004499986,0.0007468617,0.000033579,0.00002920355],"category_scores_gemma":[0.00006425677,0.0001117405,0.00004342829,0.001064694,0.0008950596,0.0007045555,0.0001712091,0.00008674565,0.00002091864],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004311061,"about_ca_system_score_gemma":0.00005214638,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.43772e-7,"about_ca_topic_score_gemma":2.799561e-7,"domain_scores_codex":[0.9983203,0.00004454758,0.0001944477,0.0005915794,0.0004601371,0.0003889649],"domain_scores_gemma":[0.998872,0.0002737813,0.00006539879,0.0003229937,0.0003030622,0.0001627787],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004321122,0.00005830301,0.000009210024,0.00001148664,0.000004111403,0.000001819311,0.0003641605,0.01317295,0.0007611296,0.8406317,0.000107909,0.1448729],"study_design_scores_gemma":[0.000309346,0.0003962213,0.00008991492,0.00002532345,0.000004012583,0.00005954304,0.000003510193,0.9553248,0.003532662,0.03935725,0.0007170197,0.0001803879],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009555604,0.00004006236,0.9865281,0.001057156,0.0004870955,0.0003181004,0.000001524253,0.0002161828,0.001796201],"genre_scores_gemma":[0.7114623,0.000002647531,0.2881168,0.0002119852,0.0001406642,0.00002423458,0.000001142013,0.000004466434,0.00003583705],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9421518,"threshold_uncertainty_score":0.4556646,"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."}}