{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002098231,0.0001646642,0.0002427686,0.0001146321,0.0001124878,0.00008644981,0.0008803196,0.00005725083,0.00002276997],"category_scores_gemma":[0.00002055033,0.0001233266,0.00007292293,0.000318231,0.00006542337,0.0001870908,0.0001768347,0.0001188206,0.00003061034],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001023627,"about_ca_system_score_gemma":0.00002044149,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006139606,"about_ca_topic_score_gemma":0.00000217772,"domain_scores_codex":[0.9987307,0.000009416095,0.0002838512,0.0002788784,0.0004498386,0.0002473801],"domain_scores_gemma":[0.9987208,0.0001988746,0.000148993,0.0008118657,0.00003220126,0.00008722117],"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.000008738044,0.0002267778,0.000004984252,0.00008069249,0.00001452597,0.000002975015,0.001252796,0.00008884737,0.001824982,0.9697892,0.0004998108,0.02620569],"study_design_scores_gemma":[0.001007618,0.0005809488,0.001889677,0.0004075129,0.00003897581,0.00001302004,0.000384419,0.1645599,0.03615924,0.7927166,0.00154475,0.0006972972],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03372013,0.00008197719,0.9358148,0.0005215125,0.00006730043,0.0003429357,0.00002030441,0.0002008576,0.0292302],"genre_scores_gemma":[0.8198683,0.00002956166,0.1798871,0.0001348638,0.0000226652,0.000009477844,0.000009131013,0.000008524303,0.00003035818],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7861481,"threshold_uncertainty_score":0.5029113,"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."}}