{"id":"W3093330059","doi":"10.1145/3679015","title":"Efficient Constructions of the Prefer-Same and Prefer-Opposite de Bruijn Sequences","year":2024,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Guelph","funders":"","keywords":"De Bruijn sequence; Sequence (biology); Construct (python library); Combinatorics; Greedy algorithm; Mathematics; Space (punctuation); De Bruijn graph; Computer science; Algorithm; Discrete mathematics; Theoretical 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.0002424152,0.000122045,0.0001126633,0.0001618947,0.0002892256,0.0001306046,0.0006120063,0.00006153017,0.00002514293],"category_scores_gemma":[0.00001154578,0.00008899804,0.0001311857,0.000820415,0.0002270165,0.00011418,0.00002718095,0.0002472069,0.000005598341],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002811506,"about_ca_system_score_gemma":0.00008171945,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004648578,"about_ca_topic_score_gemma":0.00001855433,"domain_scores_codex":[0.9990326,0.000103179,0.0001689624,0.0003126115,0.0001962765,0.0001863541],"domain_scores_gemma":[0.9990079,0.000253211,0.00003163389,0.0006025209,0.00003714884,0.00006753347],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001997929,0.0002603222,0.0001784733,0.0001245249,0.0002724997,0.000007174541,0.00644837,0.01347353,0.005620364,0.1235709,0.00004883529,0.849975],"study_design_scores_gemma":[0.001167644,0.001061022,0.01429469,0.00111449,0.0005074019,0.001180714,0.001306113,0.5932626,0.1095002,0.2697234,0.005650623,0.001231153],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1516985,0.0003677486,0.8446991,0.001630932,0.0008123951,0.0001724457,0.00003083718,0.0002110343,0.000376986],"genre_scores_gemma":[0.9736339,0.00005238564,0.02605886,0.00008605188,0.00002221573,0.0000278644,2.548852e-7,0.000007516212,0.0001109242],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8487439,"threshold_uncertainty_score":0.3629235,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01474581128468498,"score_gpt":0.2426197850901976,"score_spread":0.2278739738055126,"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."}}