{"id":"W2158725698","doi":"10.1109/itwnit.2009.5158535","title":"Constructing optimal whole-bit recycling codes","year":2009,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval","funders":"","keywords":"Redundancy (engineering); Bit (key); Recipe; Computer science; Multiplicity (mathematics); Algorithm; Data compression; Mathematics; Computer network","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.0001513567,0.00008433515,0.000104727,0.00004251135,0.0001336972,0.0002143807,0.0005161192,0.00003617373,0.00002668396],"category_scores_gemma":[0.00002244754,0.00006765011,0.00003087402,0.0001454304,0.0000198267,0.0006429906,0.0001737446,0.0000988984,0.00005502466],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001578114,"about_ca_system_score_gemma":0.0000213744,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001297107,"about_ca_topic_score_gemma":0.000001178604,"domain_scores_codex":[0.9992028,0.00001936134,0.0001544203,0.0002668225,0.0001559482,0.0002006062],"domain_scores_gemma":[0.999437,0.00005079918,0.00004887414,0.0003560341,0.00003626099,0.00007104737],"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.000002430172,0.00002423025,0.0002167792,0.000001630858,0.00000336701,0.00001713702,0.00009970739,0.0001604516,0.002121125,0.1091535,0.002443868,0.8857558],"study_design_scores_gemma":[0.0005865693,0.0001599019,0.00110576,0.0000811517,0.000004810017,0.0001536224,0.0002651882,0.9505832,0.01161219,0.008920704,0.02607241,0.0004544865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009300888,0.00005712415,0.9711855,0.001228331,0.0002023589,0.00004473062,0.000002734453,0.0002538419,0.01772449],"genre_scores_gemma":[0.2087977,0.000004183136,0.7901696,0.0004757391,0.00009715797,7.723552e-7,0.000006622946,0.000002618992,0.0004456258],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9504228,"threshold_uncertainty_score":0.2758691,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01693023982062969,"score_gpt":0.2620274085568954,"score_spread":0.2450971687362657,"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."}}