{"id":"W2086423153","doi":"10.1016/j.dam.2009.10.001","title":"On end-vertices of Lexicographic Breadth First Searches","year":2009,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vertex (graph theory); Lexicographical order; Combinatorics; Mathematics; Set (abstract data type); Computer science; Graph; Programming language","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.001348561,0.000928772,0.001682167,0.002833176,0.001520314,0.002849543,0.001844947,0.001778769,0.01157731],"category_scores_gemma":[0.01369507,0.0008649856,0.0008212391,0.004425234,0.002004057,0.004470222,0.003050132,0.001819509,0.002655678],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001387668,"about_ca_system_score_gemma":0.001250673,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002273098,"about_ca_topic_score_gemma":0.003670976,"domain_scores_codex":[0.9982997,0.0006173871,0.0000884193,0.0002080171,0.0005201406,0.000266351],"domain_scores_gemma":[0.9936465,0.00465286,0.0002744283,0.0007753451,0.0004653053,0.0001855855],"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.001834634,0.0002574222,0.001900577,0.0007454743,0.0001009548,0.0003566123,0.0008674075,0.1285213,0.007238229,0.4903867,0.02125021,0.3465406],"study_design_scores_gemma":[0.0001213903,0.00009900609,0.0003626018,0.0001788593,0.00005969843,0.0001999894,0.000256591,0.2493065,0.004601564,0.735885,0.008897293,0.00003156194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1494487,0.003042245,0.7674358,0.00147105,0.0001988,0.0003355005,0.001169352,0.001964715,0.07493385],"genre_scores_gemma":[0.4194726,0.001592292,0.5476708,0.0005477172,0.0001494404,0.0003041692,0.001731631,0.001154666,0.02737668],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01157731,"threshold_uncertainty_score":0.03872997,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01951648551427771,"score_gpt":0.2548718604261763,"score_spread":0.2353553749118986,"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."}}