{"id":"W108436809","doi":"","title":"Lexicographically Optimum Traffic Trees with Maximum Degree Constraints.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Lexicographical order; Mathematics; Degree (music); Statistics; Combinatorics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006117994,0.000237534,0.0002391928,0.0001888187,0.0001790105,0.0001676446,0.001252527,0.0001268093,0.00003388612],"category_scores_gemma":[0.00007853465,0.0002068583,0.00008160315,0.001108385,0.0004042218,0.0006619864,0.0001228604,0.0002761073,0.00006722767],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004770585,"about_ca_system_score_gemma":0.00009631645,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006644549,"about_ca_topic_score_gemma":0.000007658326,"domain_scores_codex":[0.998095,0.0001613982,0.0003077062,0.0005225097,0.0004491777,0.0004641451],"domain_scores_gemma":[0.998455,0.0001159436,0.0001436372,0.0009411629,0.0001587083,0.0001855636],"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.00002789526,0.0001745965,0.001276975,0.000005815927,0.0000295351,0.00005583874,0.0002031,0.0001502525,0.0001658436,0.8771831,0.0001727862,0.1205542],"study_design_scores_gemma":[0.007793983,0.003371618,0.07938302,0.0002183742,0.00009458265,0.001384113,0.0003534413,0.084469,0.003891771,0.8004235,0.01607577,0.002540804],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7374475,0.0001281808,0.2384659,0.0009723602,0.002043821,0.0004623235,0.000002174097,0.0008498287,0.01962787],"genre_scores_gemma":[0.7625278,0.00002973096,0.2371836,0.0001386593,0.00000839479,0.00002834567,0.000002551915,0.00001661589,0.00006432867],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1180134,"threshold_uncertainty_score":0.8435439,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02972746397389642,"score_gpt":0.2646956364620376,"score_spread":0.2349681724881412,"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."}}