{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002902251,0.0002444666,0.0002764472,0.0001209196,0.0003033102,0.0002255026,0.0007168141,0.00008706292,0.000009797196],"category_scores_gemma":[0.0001058952,0.0002374209,0.0001068414,0.00074611,0.00003289522,0.0003543846,0.0005230426,0.0001899592,0.0001687706],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009037076,"about_ca_system_score_gemma":0.00006669998,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008110057,"about_ca_topic_score_gemma":0.000007827526,"domain_scores_codex":[0.9979389,0.00007737027,0.0002587629,0.0006277645,0.0005645254,0.0005327351],"domain_scores_gemma":[0.9982488,0.00005073295,0.00008868493,0.0009104837,0.0001982072,0.0005031031],"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.00004072291,0.0004893336,0.005036102,0.00003256712,0.00007723231,0.0005122807,0.01149736,0.000661372,0.01224139,0.8661636,0.1013977,0.001850446],"study_design_scores_gemma":[0.006950121,0.001664081,0.008493191,0.0006445835,0.00005490746,0.0004796398,0.0004450781,0.009766462,0.02958161,0.6826034,0.256556,0.002760906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.986498,0.00007094111,0.001817923,0.008896383,0.001735766,0.0004031339,0.000004806544,0.0002520118,0.000321024],"genre_scores_gemma":[0.9764498,0.00001305781,0.02060669,0.002019849,0.000005950469,0.0000569409,0.000002161348,0.00002336504,0.0008222218],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1835601,"threshold_uncertainty_score":0.9681745,"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."}}