{"id":"W2949574883","doi":"10.48550/arxiv.0710.1842","title":"An explicit universal cycle for the (n-1)-permutations of an n-set","year":2007,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Set (abstract data type); Combinatorics; Mathematics; Arithmetic; Computer science; Programming language","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.0002382315,0.0003743244,0.0002362243,0.0006349431,0.001368333,0.0008288409,0.0006538049,0.000642409,0.006010463],"category_scores_gemma":[0.001329564,0.000260836,0.0005425944,0.0005734562,0.001324101,0.001374606,0.001013624,0.0007510794,0.0009433989],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000838201,"about_ca_system_score_gemma":0.0007319633,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001800366,"about_ca_topic_score_gemma":0.003334437,"domain_scores_codex":[0.9997718,0.00005275178,0.00001405236,0.00005811285,0.00004962774,0.00005373745],"domain_scores_gemma":[0.9996946,0.0001122873,0.00004019678,0.0000721941,0.00004740686,0.00003336736],"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.00002207752,0.00001645986,0.0003613541,0.00005062692,0.00000442905,0.0001588564,0.000315136,0.003858397,0.003340079,0.9710804,0.0009393425,0.01985297],"study_design_scores_gemma":[0.00001412491,0.00004030322,0.0002571356,0.00005236702,0.00001501481,0.0003766706,0.0001204216,0.04137334,0.009533829,0.9236232,0.02456395,0.00002967754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1911995,0.0004226223,0.7460859,0.0005003085,0.0001562242,0.0001818397,0.0002783473,0.0005154978,0.06065982],"genre_scores_gemma":[0.709296,0.0003461924,0.265542,0.0001958623,0.00003849019,0.0001937289,0.0002877327,0.0002147629,0.02388525],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006010463,"threshold_uncertainty_score":0.02010703,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03431748821146258,"score_gpt":0.2731775099604899,"score_spread":0.2388600217490273,"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."}}