{"id":"W1990242495","doi":"10.1016/j.dam.2003.07.001","title":"A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":102,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Interval graph; Mathematics; Graph; Algorithm; Interval (graph theory); Simple (philosophy); Unit interval; SIMPLE algorithm; Combinatorics; Simple graph; Unit (ring theory); Line graph; Pathwidth","routes":{"ca_aff":true,"ca_fund":true,"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.0003015749,0.0009794305,0.001074767,0.00170815,0.0006962522,0.001489582,0.001802908,0.0009842686,0.01763727],"category_scores_gemma":[0.001666793,0.0004412841,0.0007722965,0.001714002,0.000459577,0.002182706,0.001745549,0.001044735,0.004835544],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005930255,"about_ca_system_score_gemma":0.0009605881,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003545494,"about_ca_topic_score_gemma":0.005022977,"domain_scores_codex":[0.9995565,0.00004997322,0.00003753566,0.000132413,0.0001386023,0.00008496191],"domain_scores_gemma":[0.9993768,0.0001854218,0.00003922669,0.0002242637,0.0001118668,0.00006243891],"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.0003435613,0.0001347471,0.0007291074,0.0001406839,0.00002621376,0.00007490614,0.0001023779,0.01040356,0.02384428,0.007320208,0.008638451,0.9482418],"study_design_scores_gemma":[0.0004133493,0.0004047113,0.002673235,0.0000940976,0.0001022978,0.0006716209,0.0005285235,0.7926595,0.06197916,0.09043214,0.04990394,0.0001374449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03777791,0.0003312301,0.9423311,0.0001751373,0.00007734213,0.0001731667,0.0006244164,0.01158648,0.006923102],"genre_scores_gemma":[0.1378931,0.0001728178,0.8529311,0.0001098266,0.00004723647,0.0002065712,0.002131248,0.000633878,0.005874169],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01763727,"threshold_uncertainty_score":0.05900258,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04505282759936129,"score_gpt":0.3107119446623994,"score_spread":0.2656591170630381,"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."}}