{"id":"W3101685628","doi":"10.1016/j.tcs.2020.11.018","title":"Revisiting the Prefer-same and Prefer-opposite de Bruijn sequence constructions","year":2020,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"De Bruijn sequence; Lexicographical order; Sequence (biology); Combinatorics; Mathematics; Representation (politics); Construct (python library); Greedy algorithm; Simple (philosophy); Discrete mathematics; Algorithm; Computer science","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001481861,0.0001827153,0.0001866531,0.0001011055,0.0009717121,0.0008398357,0.002263636,0.00003697716,0.00002416669],"category_scores_gemma":[0.0001504941,0.0001304827,0.0000687674,0.001901344,0.003615588,0.0006341774,0.001358673,0.0003395774,0.0000210536],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002728124,"about_ca_system_score_gemma":0.0001129632,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003392298,"about_ca_topic_score_gemma":5.035159e-7,"domain_scores_codex":[0.9978104,0.0002655755,0.000241738,0.0007242033,0.0004172428,0.0005408141],"domain_scores_gemma":[0.9982726,0.0005176141,0.00007427129,0.0006248268,0.0001155577,0.0003951323],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000631828,0.000005180983,0.0004366649,0.00001042842,0.000004610431,0.000004352682,0.001458275,0.00004958052,0.001733446,0.9321043,0.00001204387,0.06417474],"study_design_scores_gemma":[0.0001930478,0.0001713668,0.002779368,0.00006731159,0.00001665137,0.0002150879,0.00004025033,0.5201316,0.003088602,0.4724756,0.0005025665,0.0003185688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09373164,0.00006528509,0.8896894,0.01342728,0.0001645137,0.0001653971,0.000002201453,0.0002815714,0.002472721],"genre_scores_gemma":[0.909018,0.000009991637,0.08735502,0.003366462,0.0002346376,0.000007076952,2.29895e-7,0.000006036785,0.000002567092],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8152863,"threshold_uncertainty_score":0.999096,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02492197415689523,"score_gpt":0.2510284939185019,"score_spread":0.2261065197616067,"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."}}