{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003914222,0.000433442,0.0008475073,0.001762552,0.001482871,0.001882613,0.0009440311,0.001160521,0.006997172],"category_scores_gemma":[0.006155585,0.0004172708,0.0005349108,0.001940006,0.001145806,0.002674209,0.001647642,0.0008858707,0.001032616],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001020994,"about_ca_system_score_gemma":0.001715085,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001324467,"about_ca_topic_score_gemma":0.002363421,"domain_scores_codex":[0.9994379,0.0001071937,0.00005309674,0.0001269054,0.0001516944,0.0001232594],"domain_scores_gemma":[0.9982855,0.0007618638,0.0001352659,0.0003571579,0.0002827298,0.0001773849],"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.001936343,0.0002243714,0.004073953,0.000909831,0.00007000708,0.0004333285,0.001254786,0.03093473,0.04268998,0.4992771,0.01711736,0.4010782],"study_design_scores_gemma":[0.0001182615,0.0003327123,0.00128492,0.0003395958,0.00006576985,0.0005183556,0.0006985086,0.1009529,0.0314953,0.8434088,0.02070748,0.00007737228],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6272511,0.001625321,0.3309616,0.001961613,0.0004041909,0.0003809812,0.002635847,0.001285053,0.03349435],"genre_scores_gemma":[0.8101431,0.0008494693,0.1725734,0.0004747403,0.00009162733,0.0003814916,0.002146635,0.0006649877,0.01267451],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006997172,"threshold_uncertainty_score":0.02340788,"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."}}