{"id":"W1973315577","doi":"10.1002/jcd.10040","title":"On DRC‐covering of K<sub>n</sub> by cycles","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of the Fraser Valley","funders":"","keywords":"Combinatorics; Mathematics; Disjoint sets; Vertex (graph theory); Path (computing); Enhanced Data Rates for GSM Evolution; Graph; Set (abstract data type); Discrete mathematics; Computer science; Computer network; Telecommunications","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005436779,0.0005139271,0.0007337421,0.0007044174,0.0005325531,0.0008932069,0.0004728707,0.0005186541,0.002776446],"category_scores_gemma":[0.002368598,0.0003277286,0.0004304732,0.001122572,0.0006079407,0.001070205,0.0009760491,0.0002809739,0.0002969891],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007791804,"about_ca_system_score_gemma":0.000503391,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002277377,"about_ca_topic_score_gemma":0.001425945,"domain_scores_codex":[0.9993604,0.000231047,0.0000263134,0.0001183643,0.0001084086,0.000155451],"domain_scores_gemma":[0.9985883,0.0007622166,0.0002152146,0.0001813722,0.0001228958,0.0001300175],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004272011,0.0001060694,0.002886603,0.0003227246,0.00009174549,0.0005071059,0.0002847056,0.7891433,0.0153683,0.09319779,0.005118258,0.0925462],"study_design_scores_gemma":[0.00004177769,0.0001676055,0.001277072,0.00004624351,0.00003638179,0.0004315517,0.0001686571,0.8953989,0.008923623,0.08477216,0.008713583,0.0000224549],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7477599,0.0007999985,0.2322818,0.0003266976,0.00003548603,0.000145608,0.0005625463,0.000218962,0.01786909],"genre_scores_gemma":[0.9113242,0.0006199675,0.08232828,0.0001116799,0.00004299895,0.0001355105,0.0008176464,0.000121923,0.004497841],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002776446,"threshold_uncertainty_score":0.009288132,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01033811752690011,"score_gpt":0.2172518668555552,"score_spread":0.2069137493286551,"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."}}