{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001637295,0.0007891377,0.00128412,0.002027583,0.0008541755,0.001410649,0.001375764,0.001574861,0.002731266],"category_scores_gemma":[0.008963333,0.0007384096,0.0008492165,0.001862138,0.001894125,0.002188522,0.002663817,0.001570527,0.001373684],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009167722,"about_ca_system_score_gemma":0.001653499,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004636138,"about_ca_topic_score_gemma":0.0004681009,"domain_scores_codex":[0.9983206,0.0003839258,0.0001407996,0.0002290598,0.0006285646,0.0002969667],"domain_scores_gemma":[0.9968575,0.001184574,0.0002286628,0.0008073455,0.0007986274,0.0001233537],"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.0005755407,0.0001086876,0.0008435611,0.0004635942,0.00006200387,0.0002406326,0.0004237188,0.1168115,0.03906681,0.5515429,0.005640684,0.2842204],"study_design_scores_gemma":[0.0001206375,0.0001651651,0.0002885175,0.0001411784,0.00006485805,0.0003457905,0.0001232862,0.5156054,0.08524286,0.3845832,0.01321939,0.00009971687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07945046,0.0004664785,0.9100866,0.0002274217,0.00008066087,0.00010991,0.0001842148,0.0009822205,0.008411993],"genre_scores_gemma":[0.2952397,0.0007240442,0.6950447,0.000244165,0.00006458935,0.0002851811,0.0005603047,0.0006260647,0.007211275],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002731266,"threshold_uncertainty_score":0.009136975,"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."}}