{"id":"W2050872937","doi":"10.1007/s00453-013-9745-8","title":"Practical and Efficient Circle Graph Recognition","year":2013,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Ackermann function; Circle graph; Lexicographical order; Combinatorics; Mathematics; Algorithm; Theory of computation; Computer science; Graph; Pathwidth; Discrete mathematics; Inverse; Line 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":[],"consensus_categories":[],"category_scores_codex":[0.0002317299,0.00008295905,0.00009093557,0.0001194844,0.0001229188,0.000163606,0.0002454812,0.00004482696,0.0000533092],"category_scores_gemma":[0.0001213459,0.00008142792,0.00003039565,0.0003677814,0.0001224895,0.0005053179,0.0002194191,0.0001738922,0.0005529139],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001511684,"about_ca_system_score_gemma":0.00003120014,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003712891,"about_ca_topic_score_gemma":0.000001024551,"domain_scores_codex":[0.9988842,0.00009348342,0.0001228507,0.0003504238,0.0002436865,0.0003053777],"domain_scores_gemma":[0.9990922,0.0002522225,0.00003594613,0.0003378231,0.0001234713,0.0001583851],"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.000004069644,0.0001117536,0.0000280955,0.000008719798,0.00001495547,0.00002085411,0.0001807051,0.000007779839,0.001769025,0.02921938,0.001034763,0.9675999],"study_design_scores_gemma":[0.0008420591,0.0003072925,0.00643661,0.00003078645,0.00000923815,0.0002454989,0.0001470575,0.1778426,0.01373702,0.7983711,0.001501897,0.0005288343],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05286086,0.0000592057,0.9409474,0.003969684,0.0001401958,0.0003223767,0.000002076971,0.0001634504,0.001534822],"genre_scores_gemma":[0.5495178,0.00002400138,0.4498179,0.0003311206,0.0000651441,0.00009180858,0.000003205629,0.00001367003,0.0001353819],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9670711,"threshold_uncertainty_score":0.7106774,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02781378277119005,"score_gpt":0.2996522708988027,"score_spread":0.2718384881276126,"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."}}