{"id":"W2148837681","doi":"10.1016/s0304-3975(03)00049-5","title":"A fast algorithm to generate necklaces with fixed content","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Alphabet; Amortized analysis; Algorithm; Mathematics; Fixed point; Constant (computer programming); Simple (philosophy); Symbol (formal); Construct (python library); Bounding overwatch; Listing (finance); Combinatorics; Content (measure theory); Computer science; Data structure; Artificial intelligence","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097123,0.00145864,0.0008009097,0.002173779,0.001015103,0.001096113,0.001293017,0.001461345,0.01202235],"category_scores_gemma":[0.004569463,0.0006233622,0.0008900075,0.001841953,0.001035057,0.001675281,0.002954715,0.001427244,0.00484326],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007092445,"about_ca_system_score_gemma":0.001071876,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001084305,"about_ca_topic_score_gemma":0.001848364,"domain_scores_codex":[0.9990754,0.00009306795,0.00006911421,0.0001370146,0.0005454139,0.00008000678],"domain_scores_gemma":[0.9976852,0.0006991167,0.0001509652,0.0007644751,0.0005922868,0.0001080114],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006797907,0.000146101,0.0005070459,0.0003568749,0.00006911681,0.0003206062,0.000365347,0.01760635,0.08201431,0.0551654,0.01745989,0.8253092],"study_design_scores_gemma":[0.0004961659,0.0006837628,0.0009196381,0.0001684683,0.0001744221,0.002066605,0.0002872961,0.5491254,0.2752033,0.09510413,0.07559809,0.0001727679],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009111247,0.0001749094,0.9846795,0.0001102038,0.0001155141,0.0002523283,0.000210577,0.002505353,0.002840302],"genre_scores_gemma":[0.03684996,0.0001201716,0.9575428,0.00004968442,0.00003712691,0.0002487289,0.0004472208,0.0004308823,0.004273414],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01202235,"threshold_uncertainty_score":0.04021877,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01539035791598602,"score_gpt":0.2322057604252404,"score_spread":0.2168154025092544,"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."}}