{"id":"W2066342920","doi":"10.1016/j.jda.2014.06.003","title":"The lexicographically smallest universal cycle for binary strings with minimum specified weight","year":2014,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Guelph","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Lexicographical order; Aperiodic graph; Mathematics; Binary number; Combinatorics; Discrete mathematics; Prefix; Simple (philosophy); Amortized analysis; Set (abstract data type); Order (exchange); Arithmetic; Computer science; Data structure","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.0007478328,0.0002064152,0.0002871028,0.000146379,0.0004461165,0.0003087034,0.001640495,0.00007591378,0.00000549805],"category_scores_gemma":[0.00004735962,0.0001124824,0.0001998673,0.0003466961,0.0001549259,0.000691239,0.0002652247,0.0003066513,0.000002793416],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003257986,"about_ca_system_score_gemma":0.0001130663,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001004505,"about_ca_topic_score_gemma":0.000005532242,"domain_scores_codex":[0.9982228,0.00008724495,0.0004555813,0.0002774958,0.0005724353,0.000384493],"domain_scores_gemma":[0.9979424,0.0004437153,0.0005194944,0.0005353508,0.0003262197,0.0002328452],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00318639,0.0008214459,0.001789783,0.0001297378,0.001165714,0.0005181902,0.001731683,0.002947123,0.0034061,0.1969397,0.04171513,0.745649],"study_design_scores_gemma":[0.007407724,0.007000153,0.009629517,0.0003842622,0.0001437082,0.0005316672,0.0004531881,0.5637683,0.001514133,0.02232191,0.3858919,0.0009534886],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01198353,0.0004121298,0.9823497,0.003510324,0.0007097916,0.0001931643,0.00001386992,0.00003521894,0.0007922966],"genre_scores_gemma":[0.4482381,0.0007403524,0.5482251,0.0003270725,0.001915229,0.00001165673,0.0000125874,0.00005558278,0.0004743003],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7446955,"threshold_uncertainty_score":0.4586898,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008251096188583884,"score_gpt":0.2237018775093222,"score_spread":0.2154507813207383,"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."}}