{"id":"W2023544465","doi":"10.1109/tcomm.2011.091911.100189","title":"Binary Soliton-Like Rateless Coding for the Y-Network","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Fountain code; Computer science; Luby transform code; Linear network coding; Decoding methods; Binary erasure channel; Computer network; Binary number; Variable-length code; Coding (social sciences); Theoretical computer science; Algorithm; Block code; Linear code; Channel (broadcasting); Channel capacity; Mathematics; Network packet","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":["sts"],"consensus_categories":[],"category_scores_codex":[0.0006033827,0.0001786915,0.0001644995,0.00007455696,0.002766798,0.0001297766,0.004262974,0.00006914351,0.00005284716],"category_scores_gemma":[0.000008725238,0.0001471338,0.0001650154,0.0007512537,0.0002176386,0.0003499131,0.00005382209,0.0004368328,0.00006191685],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006248393,"about_ca_system_score_gemma":0.00009255766,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001753127,"about_ca_topic_score_gemma":0.0002301275,"domain_scores_codex":[0.9986269,0.0003092856,0.0003385434,0.0002655963,0.0001384709,0.0003212278],"domain_scores_gemma":[0.9939957,0.001437243,0.0001124038,0.00414314,0.0002265029,0.00008497737],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009359742,0.001392874,0.00003730983,0.00002330911,0.0004362949,0.000001553366,0.01042408,0.01636936,0.001053944,0.5245544,0.01415524,0.431458],"study_design_scores_gemma":[0.0009480194,0.0002558653,0.000685929,0.0001287589,0.0001031566,0.0000192704,0.0003989307,0.8544086,0.003261144,0.004284606,0.1348557,0.0006500569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00008513412,0.001022057,0.9894071,0.003671128,0.0008117235,0.0005820383,0.000008868911,0.000276388,0.00413562],"genre_scores_gemma":[0.9322009,0.00612159,0.05923602,0.0009565312,0.00004409982,0.0007080531,0.000004468017,0.00002145413,0.0007068702],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9321158,"threshold_uncertainty_score":0.9985315,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1408034872508833,"score_gpt":0.3115664331947468,"score_spread":0.1707629459438635,"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."}}