{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005033051,0.0009721132,0.00180434,0.001786878,0.001403952,0.003636104,0.001936704,0.001440678,0.004108842],"category_scores_gemma":[0.03523861,0.0008880668,0.0007929833,0.002010502,0.002043204,0.00805925,0.00232121,0.001869595,0.0007811628],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002557184,"about_ca_system_score_gemma":0.002303778,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002483106,"about_ca_topic_score_gemma":0.00249657,"domain_scores_codex":[0.9968624,0.0009696341,0.0002418907,0.0006372278,0.0007479811,0.0005408505],"domain_scores_gemma":[0.9627418,0.0284073,0.001372886,0.004567864,0.002038224,0.0008718723],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.004121684,0.0003481072,0.01777698,0.0002642893,0.0002780659,0.0002706141,0.0005569258,0.7356528,0.01200688,0.1181033,0.006141396,0.1044789],"study_design_scores_gemma":[0.00002491371,0.00007686809,0.0007951705,0.00001030088,0.00002541926,0.00002371045,0.00003704001,0.9403403,0.004098556,0.05425986,0.000292359,0.00001537486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6115496,0.0007662035,0.373867,0.001485936,0.0003360417,0.00008866328,0.0009743887,0.0042964,0.006635873],"genre_scores_gemma":[0.9699055,0.0001459065,0.02795398,0.00006241431,0.0001334295,0.00006150224,0.0005058313,0.0001721353,0.001059269],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005033051,"threshold_uncertainty_score":0.02661759,"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."}}