{"id":"W2012661148","doi":"10.1145/1798596.1798598","title":"An explicit universal cycle for the ( <i>n</i> -1)-permutations of an <i>n</i> -set","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":43,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Cycle basis; Combinatorics; Permutation (music); Hamiltonian path; Eulerian path; Set (abstract data type); Recursion (computer science); Discrete mathematics; Directed graph; Graph; Algorithm; Lagrangian; Computer science; Pure mathematics; Line 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002748205,0.0003901802,0.0002952424,0.0005389104,0.0009748803,0.0006059897,0.0006879102,0.0004749994,0.006772544],"category_scores_gemma":[0.001336097,0.0002887881,0.0005059022,0.0005365299,0.001039888,0.001339872,0.001122971,0.0005736767,0.001103687],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007417183,"about_ca_system_score_gemma":0.000902986,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00157258,"about_ca_topic_score_gemma":0.002797771,"domain_scores_codex":[0.9997193,0.00005235943,0.00001839501,0.00007747395,0.00005867922,0.00007386082],"domain_scores_gemma":[0.9996294,0.0001121168,0.00004907186,0.00009597492,0.00007079676,0.00004267334],"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.0000935865,0.00005682347,0.001172861,0.0001800756,0.00001809025,0.0002776703,0.0006053732,0.017614,0.01700111,0.8598439,0.00295289,0.1001836],"study_design_scores_gemma":[0.00004920402,0.0001525677,0.0007212455,0.0001155105,0.00004446985,0.0006042962,0.0002420727,0.1108944,0.04436292,0.782814,0.05993075,0.00006841309],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1340927,0.0002208024,0.8309003,0.000310643,0.00008015569,0.0002084723,0.0003488706,0.0008611741,0.03297698],"genre_scores_gemma":[0.5329524,0.000240145,0.4462284,0.0001803378,0.00002247088,0.0002576497,0.0005142016,0.0002787378,0.0193256],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006772544,"threshold_uncertainty_score":0.02265644,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01335900375409101,"score_gpt":0.279052694683911,"score_spread":0.26569369092982,"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."}}