{"id":"W3196404297","doi":"10.1109/isit45174.2021.9518192","title":"Streaming Erasure Codes over Multi-Access Relay Networks","year":2021,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Relay; Computer science; Computer network; Concatenation (mathematics); Node (physics); Erasure; Online codes; Latency (audio); Set (abstract data type); Erasure code; Decoding methods; Distributed computing; Algorithm; Block code; Telecommunications; Linear code; Mathematics","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.0009071926,0.00083189,0.0006701231,0.0006620608,0.0004302633,0.0006754366,0.0007610545,0.0007295864,0.0007047027],"category_scores_gemma":[0.003081456,0.0002882616,0.0002909925,0.001034077,0.000933863,0.001393183,0.0009286543,0.0006585186,0.0002045543],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008606234,"about_ca_system_score_gemma":0.0004714963,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001335844,"about_ca_topic_score_gemma":0.001247862,"domain_scores_codex":[0.9993592,0.0002608684,0.00002991231,0.00008099897,0.0001746935,0.00009440938],"domain_scores_gemma":[0.9981609,0.001256991,0.0002100104,0.0001633782,0.0001539589,0.00005470053],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003460435,0.00004168658,0.0005170969,0.0002479558,0.00004893009,0.0006149017,0.0003758032,0.7522264,0.02466432,0.1788948,0.001080471,0.0409416],"study_design_scores_gemma":[0.00002503843,0.0001102088,0.0001724884,0.00001914976,0.00002603386,0.000217915,0.00004097975,0.9480765,0.006140931,0.0435179,0.001629812,0.00002304962],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1643315,0.003732957,0.8242201,0.0004088499,0.00008086181,0.0000602052,0.0001596776,0.0002985484,0.006707312],"genre_scores_gemma":[0.9544517,0.002255084,0.04061329,0.00006258908,0.0001058336,0.00007605241,0.00006213992,0.00002584983,0.002347442],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001335844,"threshold_uncertainty_score":0.006244242,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06163306429325758,"score_gpt":0.326903873062846,"score_spread":0.2652708087695884,"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."}}