{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002058132,0.0001739139,0.0001307189,0.00007034304,0.0002871278,0.00003041679,0.0006298171,0.0001493688,0.00007083928],"category_scores_gemma":[0.00002098081,0.0001482335,0.0001406296,0.0001549245,0.0001156818,0.00002179917,0.000008446247,0.0001823483,0.000007347158],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009039606,"about_ca_system_score_gemma":0.0000681164,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007998425,"about_ca_topic_score_gemma":0.0002567083,"domain_scores_codex":[0.9989853,0.00003959058,0.0002028277,0.000359477,0.0001669577,0.0002458515],"domain_scores_gemma":[0.9984941,0.00006379013,0.00007288498,0.001103744,0.0001468905,0.000118588],"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.0001288363,0.0005728822,0.00003082782,0.00001361459,0.0001753427,0.000001282852,0.0004136819,0.00489992,0.7948488,0.0001787769,0.0001208064,0.1986152],"study_design_scores_gemma":[0.003652107,0.003179076,0.001600194,0.0000105155,0.0003421878,0.00004364421,0.003087934,0.02871901,0.901488,0.001397594,0.05569243,0.0007873089],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4239958,0.00004548696,0.5732768,0.0005453539,0.0005728403,0.0007331449,0.0006075092,0.00004626764,0.0001768485],"genre_scores_gemma":[0.9611092,0.00005953931,0.03783332,0.000189322,0.0002198012,0.0001551648,0.0001993575,0.00004592017,0.0001884226],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5371134,"threshold_uncertainty_score":0.6044788,"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."}}