{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003451768,0.0001905501,0.0002223977,0.0001043337,0.0001003989,0.00002093208,0.0004563694,0.0001995325,0.00003255038],"category_scores_gemma":[0.00001300731,0.0001657674,0.000136167,0.0001107674,0.00004819875,0.0001193156,0.00004479259,0.0002587368,0.00001290916],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003391952,"about_ca_system_score_gemma":0.00002334652,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009859692,"about_ca_topic_score_gemma":0.00008287189,"domain_scores_codex":[0.9991523,0.00004610616,0.0002646791,0.0002204232,0.0001024134,0.0002140547],"domain_scores_gemma":[0.9989523,0.0001452101,0.00007495486,0.0006857738,0.00006545049,0.00007636094],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001632059,0.000270117,0.04273777,0.001224628,0.0009923929,0.0000250477,0.01937699,0.8546169,0.0238057,0.04947238,0.0006193702,0.006695481],"study_design_scores_gemma":[0.003587227,0.0008560026,0.3405008,0.0008361147,0.001219934,0.00004183113,0.04166793,0.4781636,0.06574789,0.03736876,0.02645188,0.003558015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9743938,0.0001860459,0.02278535,0.00001890667,0.0007143117,0.000453624,0.0001662826,0.0001994207,0.001082247],"genre_scores_gemma":[0.9992704,0.00002160045,0.0001635742,0.00001968334,0.0002161188,0.00006681784,0.0001355946,0.00005007474,0.00005609079],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3764533,"threshold_uncertainty_score":0.67598,"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."}}