{"id":"W60887568","doi":"","title":"How close to regular must a multipartite tournament be to secure a given path covering number","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Multipartite; Tournament; Mathematics; Path (computing); Discrete mathematics; Combinatorics; Computer science; Computer network; Quantum mechanics; Quantum; Physics","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.0036395,0.00067548,0.001289911,0.0009616786,0.002293507,0.006227484,0.00144862,0.003100475,0.0059745],"category_scores_gemma":[0.02498674,0.0004754676,0.0009752788,0.0007842892,0.002649944,0.008570028,0.003672505,0.003382963,0.001253441],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002409445,"about_ca_system_score_gemma":0.002094613,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001516443,"about_ca_topic_score_gemma":0.001627111,"domain_scores_codex":[0.995944,0.001231241,0.0002141467,0.001010075,0.000607766,0.0009927419],"domain_scores_gemma":[0.9845951,0.009180821,0.0008347633,0.002884769,0.0008475423,0.00165705],"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.004136258,0.0006505401,0.01205006,0.0003536105,0.0004653532,0.0003871024,0.0009830461,0.1858741,0.02064057,0.6388968,0.01931035,0.1162523],"study_design_scores_gemma":[0.0001636002,0.0005182924,0.001229824,0.00006224481,0.0001136627,0.0005362419,0.0007384529,0.362565,0.008410864,0.6182915,0.007312295,0.00005818145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6578054,0.0008539152,0.2840106,0.009682363,0.0006223532,0.0002044729,0.0005386465,0.001795919,0.04448626],"genre_scores_gemma":[0.9647014,0.0001723443,0.02982485,0.000537114,0.00008908594,0.00006228685,0.000238019,0.0001421427,0.00423273],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006227484,"threshold_uncertainty_score":0.01998669,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01579000519708357,"score_gpt":0.2280167388470498,"score_spread":0.2122267336499663,"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."}}