{"id":"W1537569686","doi":"10.1109/pacrim.2005.1517260","title":"Selection in multimode coding for multiple constraints","year":2005,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Multi-mode optical fiber; Coding (social sciences); Computer science; Decoding methods; Encoding (memory); Selection (genetic algorithm); Channel code; Constraint (computer-aided design); Cascade; Algorithm; Theoretical computer science; Artificial intelligence; Mathematics; Telecommunications; Engineering; Optical fiber","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.0001332564,0.00005506599,0.00006462538,0.00005878828,0.00006079298,0.00005093056,0.0002065292,0.00003092955,0.00002103889],"category_scores_gemma":[0.00003435582,0.00004759058,0.00001984487,0.0001048787,0.00001307286,0.0004808448,0.00006839744,0.0000465885,0.00001592472],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003397337,"about_ca_system_score_gemma":0.00002026306,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005585083,"about_ca_topic_score_gemma":0.0001755972,"domain_scores_codex":[0.99945,0.00001135227,0.0001172198,0.0001974818,0.00006912342,0.0001547766],"domain_scores_gemma":[0.9997235,0.000094682,0.00002411539,0.00009630332,0.00002715588,0.00003425284],"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.00001096436,0.0001299729,0.002793166,0.000008166228,0.000004016013,0.000001038188,0.0002977389,0.002638261,0.01174433,0.02962716,0.002835044,0.9499102],"study_design_scores_gemma":[0.0005858395,0.00001606876,0.001987644,0.000008820606,3.862791e-7,0.000003553591,0.000009569578,0.986057,0.0061983,0.0002179407,0.004843623,0.00007130023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005805781,0.000007181765,0.9928374,0.0002613427,0.00007007735,0.0001542402,0.000003073198,0.00009156035,0.0007693427],"genre_scores_gemma":[0.5683905,0.000001648143,0.4313696,0.0001034415,0.00003769902,0.00001165491,0.000002072449,0.000001848181,0.00008143764],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9834187,"threshold_uncertainty_score":0.1940688,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02314587946194829,"score_gpt":0.2741299716712371,"score_spread":0.2509840922092889,"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."}}