{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000879876,0.0001681731,0.0002478274,0.0001136816,0.0001672413,0.00006688259,0.0008473075,0.00005686322,0.00002539161],"category_scores_gemma":[0.0001449327,0.0001182998,0.0001409278,0.0005507297,0.0001686675,0.0001467637,0.0001501216,0.0001505914,0.00002041121],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001352246,"about_ca_system_score_gemma":0.00003565219,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000211627,"about_ca_topic_score_gemma":0.000002543697,"domain_scores_codex":[0.9986507,0.00004002163,0.0003767858,0.0002645415,0.0003251026,0.0003428848],"domain_scores_gemma":[0.9978303,0.001005428,0.0001974238,0.0007540032,0.0001441652,0.00006865386],"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.00000637194,0.00007335778,0.000001662204,0.00008905968,0.00005109005,6.286842e-7,0.0008909409,0.00002246908,0.001220634,0.8859209,0.00008050601,0.1116423],"study_design_scores_gemma":[0.0004259329,0.00007549741,0.000006476182,0.00002101371,0.00002270428,0.000006354058,0.0009302694,0.05048544,0.02008929,0.9268503,0.0009297311,0.0001570017],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002142456,0.00005038275,0.9930312,0.00004199125,0.00005616748,0.0008404681,0.00003377845,0.00006901244,0.003734567],"genre_scores_gemma":[0.1268005,0.00002802623,0.8725408,0.00008580471,0.00001909292,0.0003855764,0.00001737988,0.00003564742,0.00008711382],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1246581,"threshold_uncertainty_score":0.4824126,"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."}}