{"id":"W2112800816","doi":"10.1002/jcd.21404","title":"Orthogonally Resolvable Cycle Decompositions","year":2014,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University; Discovery Centre; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Lexicographical order; Graph; Vertex (graph theory); Cycle basis; Discrete mathematics; Graph power; Line graph","routes":{"ca_aff":true,"ca_fund":true,"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.0003415792,0.0002981997,0.0003016778,0.001023185,0.0006998692,0.0008887575,0.000469832,0.0003817933,0.003690007],"category_scores_gemma":[0.00144748,0.0002702657,0.0004980161,0.0006444883,0.0007239321,0.0009639164,0.001066856,0.0006827803,0.0003668759],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004715158,"about_ca_system_score_gemma":0.0004437801,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008224862,"about_ca_topic_score_gemma":0.001231177,"domain_scores_codex":[0.9994469,0.00009231505,0.00003731398,0.0001251234,0.0001558267,0.0001424938],"domain_scores_gemma":[0.9989607,0.0002267776,0.0001871002,0.0002334456,0.0002408858,0.0001510108],"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.0002397283,0.000125513,0.003092466,0.0001473888,0.00005621251,0.0005762568,0.0004725668,0.01646125,0.04060039,0.8729196,0.00296218,0.06234643],"study_design_scores_gemma":[0.00007990273,0.0002165344,0.002826113,0.0001133143,0.00006639741,0.001715281,0.0007674661,0.1458092,0.04220163,0.7687625,0.03735418,0.00008746222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6447684,0.0004236352,0.3186575,0.0002316611,0.00006990641,0.0001120609,0.0004300105,0.0002847188,0.03502204],"genre_scores_gemma":[0.9091669,0.0001768084,0.08143579,0.000133529,0.00002948329,0.0001044285,0.0006823802,0.00006434028,0.008206289],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003690007,"threshold_uncertainty_score":0.0123443,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00810714327679006,"score_gpt":0.2069411607007807,"score_spread":0.1988340174239906,"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."}}