{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007864909,0.000113205,0.0002555595,0.0001328253,0.00008602042,0.00005160532,0.0002221817,0.00008005079,0.00004953595],"category_scores_gemma":[0.00005343688,0.0001039801,0.0001503729,0.0001661781,0.00002381964,0.0001972131,0.000009700337,0.0002264672,0.00003353268],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003698626,"about_ca_system_score_gemma":0.0000258999,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000118552,"about_ca_topic_score_gemma":6.425524e-7,"domain_scores_codex":[0.9989563,0.0001455223,0.0004242944,0.00005885168,0.0002319166,0.0001830642],"domain_scores_gemma":[0.9992965,0.0001757291,0.0001144849,0.0001453452,0.0001313654,0.0001365177],"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.0001948428,0.0002346713,0.0006447621,0.00009809131,0.0003003515,0.00005427393,0.0003876477,0.03304914,0.07556556,0.8704258,0.0172447,0.001800205],"study_design_scores_gemma":[0.005046319,0.001526084,0.00255749,0.0003749486,0.0002033652,0.0005303214,0.0001182774,0.01040305,0.02924834,0.8216088,0.1276236,0.0007593257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8362324,0.0005755363,0.09795132,0.0001083932,0.01924928,0.0001872995,0.000005074794,0.0001925522,0.04549813],"genre_scores_gemma":[0.9984155,0.00001392158,0.0007200345,0.00001989441,0.0007668085,0.000002257659,8.165155e-7,0.00002325265,0.00003755053],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.162183,"threshold_uncertainty_score":0.4240186,"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."}}