{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003831208,0.0002361342,0.0003413242,0.0004208499,0.00008594684,0.0001560717,0.0007302061,0.0002709566,0.00002820418],"category_scores_gemma":[0.00005826074,0.0002231465,0.00009483296,0.0003112033,0.0001086246,0.0003634963,0.00122622,0.0004836984,0.000003190915],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002699408,"about_ca_system_score_gemma":0.00005926931,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001749827,"about_ca_topic_score_gemma":0.000002755679,"domain_scores_codex":[0.998081,0.000197789,0.0003439598,0.0006938333,0.0004082456,0.0002751456],"domain_scores_gemma":[0.9984728,0.00007805724,0.0002843368,0.0007538483,0.0003019366,0.0001090279],"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.00001404492,0.0000340846,0.0003493991,0.0006815639,0.00009447349,0.000006716597,0.0006994658,0.00002917604,0.1222392,0.01262431,0.00001202322,0.8632156],"study_design_scores_gemma":[0.0003116547,0.00006657092,0.004685453,0.0002185661,0.00001835976,0.00002821664,0.00001368187,0.1327804,0.03381342,0.8275837,0.00006716498,0.0004128107],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1998378,0.00004978273,0.799013,0.0001010521,0.0002305461,0.0004079873,0.00006253343,0.0001677008,0.0001295913],"genre_scores_gemma":[0.8540827,0.000163177,0.1452202,0.00009435785,0.00005307881,0.00003885259,0.0002772728,0.00002819385,0.00004213883],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8628027,"threshold_uncertainty_score":0.909965,"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."}}