{"id":"W2885945836","doi":"10.1016/j.disc.2018.07.010","title":"A framework for constructing de Bruijn sequences via simple successor rules","year":2018,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Guelph","funders":"","keywords":"De Bruijn sequence; Sequence (biology); Successor cardinal; Disjoint sets; Simple (philosophy); Mathematics; Correctness; De Bruijn graph; Discrete mathematics; Shift register; Combinatorics; 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":[],"consensus_categories":[],"category_scores_codex":[0.0005688578,0.0001522045,0.0001992126,0.00007455423,0.000305054,0.0002635803,0.0008453487,0.0000813755,0.00003574035],"category_scores_gemma":[0.0003092305,0.0001299251,0.0001254758,0.0002664255,0.0002558516,0.0002444095,0.0001623009,0.00009990376,0.00002518594],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001604067,"about_ca_system_score_gemma":0.00004140949,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005654441,"about_ca_topic_score_gemma":0.000005310631,"domain_scores_codex":[0.9989067,0.00004222817,0.0002557452,0.0002604304,0.0001615011,0.0003733588],"domain_scores_gemma":[0.9984411,0.000725251,0.0001676553,0.0004868532,0.00009197751,0.00008713463],"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.000004261488,0.00001843633,0.0001966669,0.00008031505,0.00002392778,0.000001752246,0.003283441,0.000001565228,0.0005743551,0.9898522,0.00006450278,0.005898538],"study_design_scores_gemma":[0.00009956866,0.00009698863,0.00001720279,0.00009273148,0.00001620527,0.00003604227,0.0005162355,0.0254377,0.006955871,0.9659761,0.0005677419,0.0001875997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1107935,0.00002566858,0.8868917,0.0002672152,0.0001568232,0.0001768084,0.00001135582,0.0001910482,0.001485957],"genre_scores_gemma":[0.4289579,0.000001940703,0.5707549,0.0001218533,0.0001221311,0.00002156016,0.000001499874,0.000009252467,0.000008966754],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3181644,"threshold_uncertainty_score":0.529819,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02825569551536327,"score_gpt":0.3082963769190016,"score_spread":0.2800406814036383,"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."}}