{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002520628,0.0001644265,0.0003621064,0.0001223567,0.00003152544,0.00001716172,0.0002241212,0.0001503544,0.000006760745],"category_scores_gemma":[0.0004684566,0.0001524861,0.0001156191,0.0002272389,0.00006155398,0.0001747131,0.00001589813,0.0004085269,0.000005889332],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001050584,"about_ca_system_score_gemma":0.0000233346,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.587935e-7,"about_ca_topic_score_gemma":9.702021e-8,"domain_scores_codex":[0.998844,0.00003998058,0.0004793758,0.00008241583,0.0003081294,0.0002461215],"domain_scores_gemma":[0.9991496,0.000337151,0.0001689241,0.0001697056,0.00009381925,0.00008080023],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001280106,0.000201539,0.00009956641,0.00006124637,0.0001584151,0.00004693038,0.00004296712,0.08578689,0.6857397,0.211858,0.007186316,0.008690407],"study_design_scores_gemma":[0.0010511,0.0005859482,0.00004705741,0.0001252593,0.00002891657,0.0000195141,0.00002774619,0.0004100942,0.8067152,0.1891547,0.001629769,0.0002046872],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9287458,0.0009079165,0.06398567,0.00002051385,0.003670874,0.0001089885,0.000003150701,0.0001370199,0.002420074],"genre_scores_gemma":[0.9955644,0.0003173262,0.003974897,0.000008487579,0.00009554897,0.000001691901,2.697839e-7,0.00003478892,0.000002562263],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1209755,"threshold_uncertainty_score":0.6218202,"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."}}