{"id":"W2963943201","doi":"10.1016/j.tcs.2018.06.039","title":"Constructing de Bruijn sequences by concatenating smaller universal cycles","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Guelph","funders":"","keywords":"De Bruijn sequence; Sequence (biology); Disjoint sets; De Bruijn graph; Set (abstract data type); Combinatorics; Mathematics; Discrete mathematics; Algorithm; Computer science","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":["sts"],"consensus_categories":[],"category_scores_codex":[0.001957605,0.000188728,0.0001785857,0.00017653,0.0008827592,0.0006177855,0.002793784,0.00005960395,0.00007663255],"category_scores_gemma":[0.0001088743,0.0001640013,0.00006810018,0.001303443,0.00933404,0.0007872583,0.0009723115,0.0002096042,0.00004661098],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000882635,"about_ca_system_score_gemma":0.0001852838,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001158784,"about_ca_topic_score_gemma":0.000001598376,"domain_scores_codex":[0.9976366,0.0001918985,0.0002324873,0.0007079742,0.0004744879,0.0007565428],"domain_scores_gemma":[0.9984623,0.0004146881,0.00009491158,0.0005043802,0.0002276894,0.0002960862],"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.000005540205,0.0000171935,0.000425831,0.000002621985,0.000005038321,0.000007860001,0.0007527521,0.000003817678,0.002637966,0.9301869,0.00007293524,0.06588151],"study_design_scores_gemma":[0.0003030762,0.0004092751,0.0002407326,0.00005819763,0.000007226088,0.0001608829,0.0002088287,0.3841257,0.04111141,0.5726906,0.000245246,0.0004387856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.175996,0.00001708225,0.8104346,0.0007114745,0.0004479893,0.00006827425,0.000001676171,0.0002958183,0.01202706],"genre_scores_gemma":[0.8207243,0.00000149514,0.1785402,0.0005704137,0.0001509488,0.000001621289,3.701665e-7,0.000005683828,0.000005016107],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6447283,"threshold_uncertainty_score":0.993362,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01024452300472329,"score_gpt":0.2417172559699828,"score_spread":0.2314727329652595,"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."}}