{"id":"W1550738266","doi":"10.25596/jalc-2004-217","title":"State Complexity of Shuffle on Trajectories","year":2004,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Nondeterministic algorithm; Upper and lower bounds; State (computer science); String (physics); Mathematics; Computational complexity theory; Constant (computer programming); Trajectory; Combinatorics; Time complexity; Discrete mathematics; Computer science; Algorithm; Mathematical analysis; Physics","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.00006274151,0.00005934994,0.00008826454,0.00003148837,0.00004405021,0.00002897817,0.0003968535,0.00001353295,0.00003181637],"category_scores_gemma":[0.000006209716,0.00004306111,0.00002504893,0.0001259306,0.00005871439,0.0002430574,0.0001340502,0.00004466651,0.00006141957],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001466789,"about_ca_system_score_gemma":0.00003360674,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001570977,"about_ca_topic_score_gemma":0.00002554533,"domain_scores_codex":[0.9994451,0.0000108745,0.0001103086,0.0001546248,0.0001731033,0.0001059843],"domain_scores_gemma":[0.9995194,0.00001910053,0.00003589283,0.0003537599,0.00003158475,0.00004027999],"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.00001126084,0.0001927423,0.0001041749,0.000009804342,0.000007145338,0.00000637996,0.0004539952,0.000981848,0.00110584,0.9772664,0.002346866,0.01751349],"study_design_scores_gemma":[0.002295651,0.001199064,0.04048166,0.00011951,0.000004605768,0.00001492518,0.0000654683,0.0249572,0.252301,0.6535855,0.02436369,0.0006117237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03112458,0.00001328977,0.9575746,0.0004213923,0.0001850172,0.00005551691,0.00001078279,0.0001008629,0.01051396],"genre_scores_gemma":[0.8160031,0.000005975009,0.1833059,0.0001947884,0.00002033345,0.000001761186,0.000005167301,0.000003342571,0.0004595436],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7848786,"threshold_uncertainty_score":0.1755981,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04238509054814154,"score_gpt":0.2690829022559006,"score_spread":0.226697811707759,"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."}}