{"id":"W1949878150","doi":"10.1137/1.9781611973730.114","title":"Forbidden structure characterization of circular-arc graphs and a certifying recognition algorithm","year":2014,"lang":"en","type":"preprint","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Chordal graph; Intersection graph; Split graph; Algorithm; Interval graph; Block graph; Time complexity; Discrete mathematics; Arc (geometry); Mathematics; Graph; Indifference graph; Line graph; 1-planar graph; Geometry","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.001009131,0.0005735201,0.0007581233,0.001004097,0.001041325,0.002317355,0.00172273,0.001408792,0.003468074],"category_scores_gemma":[0.009445002,0.0004632315,0.00133048,0.001237436,0.002932621,0.004463716,0.002857125,0.003872605,0.001190908],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00133829,"about_ca_system_score_gemma":0.001494023,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001148372,"about_ca_topic_score_gemma":0.0008171829,"domain_scores_codex":[0.997533,0.0003160122,0.0001874533,0.0008871804,0.0007075412,0.0003689146],"domain_scores_gemma":[0.9869332,0.006575579,0.001433112,0.003206036,0.001263057,0.0005890544],"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.0004390093,0.0003053107,0.006249558,0.0004430821,0.00005363387,0.000669207,0.001213441,0.06093543,0.02541512,0.748663,0.01079957,0.1448137],"study_design_scores_gemma":[0.00005223347,0.0001204111,0.001032333,0.00004806254,0.0000468889,0.0009067595,0.0002887266,0.1509562,0.02849122,0.8044151,0.01356116,0.00008077559],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1476512,0.0002603551,0.8317817,0.001369679,0.0001459939,0.0001543452,0.0006070706,0.003033834,0.01499585],"genre_scores_gemma":[0.7910792,0.0002428096,0.1990712,0.0004108758,0.0001494855,0.0001487524,0.001969539,0.000469008,0.006459121],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003468074,"threshold_uncertainty_score":0.01160187,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03502330776170659,"score_gpt":0.2828926462636801,"score_spread":0.2478693385019735,"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."}}