{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004944567,0.001094305,0.001272641,0.001519222,0.001433074,0.002628538,0.002757043,0.001724948,0.03212607],"category_scores_gemma":[0.005092029,0.0007226989,0.001030448,0.002126339,0.0009158952,0.004296906,0.003495226,0.001623752,0.0157214],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007707513,"about_ca_system_score_gemma":0.001717811,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003035593,"about_ca_topic_score_gemma":0.007305419,"domain_scores_codex":[0.9983283,0.0002524334,0.0001036765,0.0004963744,0.0005804215,0.0002389068],"domain_scores_gemma":[0.9960456,0.0008904107,0.0001461607,0.002066126,0.0006606752,0.0001909316],"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.0004583359,0.0003067956,0.001651908,0.000301759,0.00004067213,0.0002040453,0.0002071165,0.02051139,0.03059067,0.03898578,0.0493814,0.8573601],"study_design_scores_gemma":[0.0001885156,0.000306538,0.002458204,0.00005532171,0.00009179545,0.001100088,0.0007604448,0.6831738,0.08831816,0.1537642,0.06967317,0.000109764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04236959,0.0003599172,0.9161922,0.0009201796,0.0002156451,0.0002672147,0.0008903599,0.01599882,0.02278605],"genre_scores_gemma":[0.2378599,0.0002637309,0.7347919,0.0002420803,0.000142067,0.0001757703,0.003764299,0.001235927,0.0215244],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03212607,"threshold_uncertainty_score":0.1074724,"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."}}