{"id":"W2169829403","doi":"10.1007/978-3-642-03367-4_34","title":"The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Chordal graph; Mathematics; Split graph; Cograph; Interval graph; Indifference graph; Bipartite graph; Pathwidth; Discrete mathematics; Vertex (graph theory); Comparability graph; Comparability; Graph; Line graph; 1-planar graph","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001635667,0.0003729746,0.0003671741,0.0004159896,0.0008739565,0.0008012385,0.002174486,0.0001721249,0.000001335374],"category_scores_gemma":[0.0004452494,0.0002833375,0.000110134,0.0006220189,0.001402138,0.0005948633,0.000533682,0.0005746093,0.000003397649],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001752165,"about_ca_system_score_gemma":0.0002387341,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007953944,"about_ca_topic_score_gemma":0.00007999717,"domain_scores_codex":[0.9964508,0.00008719676,0.0004886729,0.001488444,0.0008501033,0.0006347644],"domain_scores_gemma":[0.9937212,0.004133105,0.000262204,0.001226269,0.0005122761,0.0001449077],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003010862,0.00001544773,0.00002921632,0.00002396942,0.000006153614,0.000009529459,0.0004513739,0.04078645,0.0000964773,0.1089577,0.000005304652,0.8495883],"study_design_scores_gemma":[0.0001760468,0.0001850048,0.00007762398,0.00004875107,0.000003063438,0.00002438718,3.226379e-7,0.3888137,0.0002654184,0.6096304,0.0005661101,0.0002091821],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003314385,0.0005959083,0.9952071,0.001362865,0.0003232711,0.001480244,0.000005120591,0.000114146,0.0005799594],"genre_scores_gemma":[0.3958221,0.0002328224,0.6025402,0.000568585,0.0002018064,0.00008260522,0.00001256656,0.00003893474,0.0005003701],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8493791,"threshold_uncertainty_score":0.9999619,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02476913975142012,"score_gpt":0.3134125907609353,"score_spread":0.2886434510095152,"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."}}