{"id":"W2071925009","doi":"10.1016/j.jda.2007.04.002","title":"Computing the throughput of Concatenation State Machines","year":2007,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University; Université du Québec en Outaouais","funders":"","keywords":"Concatenation (mathematics); Infimum and supremum; Combinatorics; Alphabet; Graph; Mathematics; Path (computing); Throughput; Enhanced Data Rates for GSM Evolution; Algorithm; Discrete mathematics; Minimum weight; Function (biology); Computer science; 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.002769261,0.0001513162,0.0002952749,0.0001580315,0.0001603282,0.0001027218,0.00101645,0.00004122538,0.000005392057],"category_scores_gemma":[0.00014219,0.00008823349,0.0001841793,0.0004489989,0.00009831317,0.0004307868,0.0001738407,0.0004446364,0.000003936963],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003214787,"about_ca_system_score_gemma":0.00007693543,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007980058,"about_ca_topic_score_gemma":0.00001015829,"domain_scores_codex":[0.9979851,0.0001381369,0.0007960132,0.0001556975,0.0006406934,0.0002843692],"domain_scores_gemma":[0.9979866,0.0003726587,0.000884219,0.0002841118,0.0003769108,0.00009545673],"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.00003555792,0.0001058402,0.004508806,0.00003762668,0.0001858454,0.0001126674,0.00467793,0.00995958,0.001468498,0.005160251,0.0006574731,0.9730899],"study_design_scores_gemma":[0.001750804,0.0008641216,0.06571546,0.0001878065,0.00005460189,0.0007629981,0.0004290193,0.9093999,0.007429516,0.008122887,0.004876503,0.0004063826],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05747339,0.0005878508,0.9385056,0.00168917,0.0009258743,0.00007490672,0.000002265399,0.00002869105,0.0007122171],"genre_scores_gemma":[0.8779505,0.00005101512,0.1211687,0.0001963461,0.0004784106,2.095489e-7,0.000001172253,0.00001275037,0.0001408034],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9726835,"threshold_uncertainty_score":0.3598057,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009754639617023692,"score_gpt":0.2875480098930345,"score_spread":0.2777933702760108,"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."}}