{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009006106,0.0002567056,0.0002536897,0.0001843689,0.0005307515,0.0008429455,0.002373717,0.00004168669,0.00004109053],"category_scores_gemma":[0.00005319622,0.0001701335,0.00004326179,0.001455283,0.001069046,0.0008753745,0.0009627478,0.0001736772,0.0001381975],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005529629,"about_ca_system_score_gemma":0.0001852613,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007745698,"about_ca_topic_score_gemma":8.025379e-7,"domain_scores_codex":[0.9969185,0.0001343379,0.0002580076,0.001025281,0.0009069678,0.0007569256],"domain_scores_gemma":[0.9977837,0.0001095956,0.00006242235,0.00113028,0.0003023688,0.0006116232],"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.000006955252,0.00006674977,0.00003589527,0.000002191385,0.000004262618,0.00003164982,0.0002534732,0.000392153,0.0009212425,0.8625577,0.0001723228,0.1355554],"study_design_scores_gemma":[0.000689255,0.001006246,0.0008825142,0.00007594449,0.000006715179,0.0002052002,0.00002970234,0.9492595,0.02766224,0.01700768,0.002515783,0.0006592812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01579187,0.00002935394,0.9810132,0.0005779869,0.0005571247,0.0002482009,0.000004235551,0.0001923806,0.001585663],"genre_scores_gemma":[0.2869845,0.000002121638,0.7117454,0.00113227,0.00007165815,0.0000136548,8.30588e-7,0.000008331033,0.00004119318],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9488673,"threshold_uncertainty_score":0.8128542,"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."}}