{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001169585,0.0005499861,0.0006654419,0.000900868,0.0008306464,0.002538023,0.001273296,0.001176379,0.0127572],"category_scores_gemma":[0.00858247,0.0006716413,0.0005701606,0.001182706,0.001125338,0.003822736,0.001395835,0.001411896,0.001910275],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001492414,"about_ca_system_score_gemma":0.001940596,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0014036,"about_ca_topic_score_gemma":0.004182695,"domain_scores_codex":[0.998562,0.0005088255,0.00008869264,0.0001862306,0.0003839219,0.0002703393],"domain_scores_gemma":[0.995928,0.002697608,0.0003311206,0.0005713155,0.0003142515,0.0001576974],"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.0004605613,0.0001635582,0.001139319,0.0004293673,0.00004569129,0.0003074901,0.0001854366,0.1160408,0.00999894,0.7924302,0.01281366,0.06598505],"study_design_scores_gemma":[0.00008367198,0.00006716503,0.0003326256,0.0001080114,0.00003734132,0.0003101752,0.0001626365,0.1881397,0.007786857,0.7853273,0.01761375,0.00003074424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07095589,0.0005896194,0.8483362,0.001322629,0.0001899374,0.0002652625,0.002360613,0.00131786,0.07466209],"genre_scores_gemma":[0.585604,0.000733626,0.3924142,0.0004135124,0.0001035921,0.0002646169,0.001924102,0.0006159243,0.01792646],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0127572,"threshold_uncertainty_score":0.0426771,"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."}}