{"id":"W3035441431","doi":"10.1109/isit44484.2020.9174225","title":"Streaming Erasure Codes over Multi-hop Relay Network","year":2020,"lang":"en","type":"preprint","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Erasure; Computer science; Header; Upper and lower bounds; Network packet; Erasure code; Relay; Linear network coding; Computer network; Binary erasure channel; Topology (electrical circuits); Decoding methods; Algorithm; Channel (broadcasting); Mathematics; Channel capacity; Combinatorics","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.0007645419,0.0005804202,0.0005482056,0.0006677817,0.0003590856,0.0005215143,0.0006338182,0.0005980264,0.000818633],"category_scores_gemma":[0.00291505,0.0001786281,0.000258776,0.0007343664,0.000666899,0.0008491526,0.0008086397,0.0006229984,0.0002059444],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007799771,"about_ca_system_score_gemma":0.0005072506,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001201466,"about_ca_topic_score_gemma":0.00102132,"domain_scores_codex":[0.9994817,0.0001583493,0.00003397712,0.00008606871,0.0001621984,0.00007781498],"domain_scores_gemma":[0.9976534,0.001346336,0.0002980585,0.0003432717,0.0002784746,0.00008043493],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006304972,0.0000671364,0.0009451164,0.0003810615,0.00007440625,0.001548908,0.0006198414,0.6204959,0.09449778,0.2002648,0.002151308,0.07832331],"study_design_scores_gemma":[0.00002428384,0.0001263215,0.0002648167,0.00002814826,0.00002239322,0.0004090472,0.00004539138,0.9492968,0.01657617,0.03061161,0.002565511,0.00002959744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.181559,0.002091653,0.8086882,0.0004076402,0.00008322717,0.00007176622,0.0001877857,0.0007248504,0.006185859],"genre_scores_gemma":[0.9395658,0.001050973,0.05710449,0.00006086643,0.00004857947,0.00007002505,0.00008670249,0.00002904685,0.001983502],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001201466,"threshold_uncertainty_score":0.005659103,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08037223952893292,"score_gpt":0.3134102744640203,"score_spread":0.2330380349350874,"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."}}