{"id":"W2290281988","doi":"10.37236/5517","title":"Generalizing the Classic Greedy and Necklace Constructions of de Bruijn Sequences and Universal Cycles","year":2016,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Necklace; Concatenation (mathematics); Combinatorics; Mathematics; De Bruijn sequence; Lexicographical order; Morphism; Alphabet; Integer (computer science); Class (philosophy); Intersection (aeronautics); Suffix; Word (group theory); String (physics); Discrete mathematics; Computer science","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.0006269072,0.00007309105,0.0001214538,0.00004827025,0.0002014571,0.00004888443,0.0005590794,0.00002913627,0.000001270754],"category_scores_gemma":[0.00003103029,0.00003285989,0.00003073339,0.000164626,0.0002372239,0.000369181,0.0001639388,0.0001973191,1.870062e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008016562,"about_ca_system_score_gemma":0.0003040179,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002717769,"about_ca_topic_score_gemma":0.000005726987,"domain_scores_codex":[0.9992002,0.0001330647,0.0001767104,0.00008214082,0.000186188,0.000221648],"domain_scores_gemma":[0.9991382,0.0002698829,0.0002576575,0.0001901941,0.00009599328,0.00004808736],"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.000008499348,0.00001333981,0.001006223,0.000002954725,0.00003207736,0.000002814223,0.0002851826,0.00001241825,0.003451078,0.9810708,0.0001749784,0.01393968],"study_design_scores_gemma":[0.001068472,0.0004995284,0.004040822,0.0001005316,0.00005466508,0.001585261,0.0004456714,0.005054657,0.004020416,0.9791018,0.003891486,0.0001366244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.679338,0.005670181,0.3099997,0.004627482,0.0002177481,0.00005038276,0.000001314664,0.000009572243,0.00008562086],"genre_scores_gemma":[0.996361,0.0030314,0.0004937314,0.00003042712,0.00003854763,3.146938e-7,4.092302e-8,0.000003299997,0.00004127424],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3170229,"threshold_uncertainty_score":0.1549465,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00749060686263108,"score_gpt":0.2175543029906053,"score_spread":0.2100636961279742,"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."}}