{"id":"W2030386826","doi":"10.1109/bsc.2008.4563194","title":"Capacity of random network coding under a probabilistic error model","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Probabilistic logic; Linear network coding; Network packet; Probability of error; Upper and lower bounds; Coding (social sciences); Algorithm; Computer science; Channel capacity; Limiting; Mathematics; Statistics; 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.0003188881,0.00009573741,0.000189529,0.00003516632,0.0002470654,0.00002100888,0.0006617689,0.00003342668,0.00002753383],"category_scores_gemma":[0.00005305414,0.00008056661,0.00006133305,0.000374683,0.0001070281,0.0002040722,0.0002842025,0.0001135455,0.000008549215],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000030855,"about_ca_system_score_gemma":0.00008120076,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005203014,"about_ca_topic_score_gemma":0.00003927887,"domain_scores_codex":[0.9990985,0.000115071,0.0002484802,0.0001922678,0.0001550961,0.0001905645],"domain_scores_gemma":[0.9989175,0.0001921055,0.00007621662,0.0006040684,0.00014977,0.00006030997],"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.0000128632,0.00006399271,0.0002164557,0.000008074243,0.00001588005,8.718397e-7,0.0009683614,0.2797078,0.0005433498,0.7143857,0.002593326,0.001483358],"study_design_scores_gemma":[0.0005163202,0.00001622018,0.0005062327,0.00002016024,0.000002696548,0.000009017495,0.000004849302,0.9906795,0.0001818003,0.007819161,0.0001400841,0.0001039823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02473696,0.0001255271,0.9644592,0.0006445171,0.00007012258,0.0001679482,3.461565e-7,0.0001096901,0.009685735],"genre_scores_gemma":[0.9061704,0.0001566779,0.09275577,0.0003689302,0.00002283565,0.00001208451,6.43289e-7,0.000004395479,0.0005082619],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8814334,"threshold_uncertainty_score":0.3285411,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1288256952206653,"score_gpt":0.2846156130954367,"score_spread":0.1557899178747714,"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."}}