{"id":"W2050946959","doi":"10.1016/j.disc.2008.01.016","title":"Directed cyclic Hamiltonian cycle systems of the complete symmetric digraph","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Lethbridge","funders":"Illinois State University","keywords":"Digraph; Mathematics; Combinatorics; Hamiltonian path; Hamiltonian (control theory); Vertex (graph theory); Directed graph; Prime (order theory); Discrete mathematics; Graph","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.0001823309,0.0002124334,0.0004045614,0.000153644,0.0001493382,0.00002190225,0.0004022787,0.00008296645,0.00001078148],"category_scores_gemma":[0.00005107917,0.000146884,0.0002069247,0.0009121231,0.0001409039,0.00006505307,0.0000439545,0.0001464336,0.00003257032],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002276023,"about_ca_system_score_gemma":0.000008051096,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002887239,"about_ca_topic_score_gemma":0.000006144442,"domain_scores_codex":[0.9987103,0.00007202306,0.0005063037,0.0001303485,0.0003099466,0.0002711001],"domain_scores_gemma":[0.9989642,0.0001498557,0.0001319408,0.0006417999,0.00004294265,0.00006929692],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003842925,0.0007553283,0.03781227,0.01422449,0.002455408,0.00008894826,0.04035472,0.07041193,0.07285661,0.7529746,0.007321494,0.0007057289],"study_design_scores_gemma":[0.002731755,0.0001982406,0.1071313,0.003003306,0.0005397758,0.0009421697,0.005663473,0.8268335,0.01578521,0.02541112,0.008918439,0.002841769],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9732313,0.000987479,0.001593966,0.000008659196,0.0006306935,0.0004465211,0.00007984485,0.000427938,0.02259366],"genre_scores_gemma":[0.9993516,0.0000441141,0.0002672609,0.000005570506,0.00003842092,0.00003098483,0.000005506422,0.00004877059,0.0002077841],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7564216,"threshold_uncertainty_score":0.5989756,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01461553194267548,"score_gpt":0.1934105058455442,"score_spread":0.1787949739028687,"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."}}