{"id":"W2058249343","doi":"10.1109/glocom.2012.6503366","title":"Opportunistic network and erasure coding for asynchronous two-way relay networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Erasure; Relay; Computer network; Asynchronous communication; Linear network coding; Erasure code; Coding (social sciences); Distributed computing; Decoding methods; Telecommunications; Power (physics); Sociology; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001622402,0.0005769012,0.0004253833,0.0006436267,0.0005716567,0.000911438,0.0007686771,0.0005387469,0.0009031094],"category_scores_gemma":[0.005176215,0.0002581698,0.0003238555,0.0005783328,0.001149767,0.001215498,0.001005578,0.0006478467,0.0001261814],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001253568,"about_ca_system_score_gemma":0.0009747437,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002070206,"about_ca_topic_score_gemma":0.002550612,"domain_scores_codex":[0.9991723,0.0003424932,0.00002794197,0.00008341853,0.0002447644,0.000129084],"domain_scores_gemma":[0.9961361,0.002794918,0.0003903239,0.0003245051,0.0002699152,0.00008415581],"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.0002105278,0.00004682615,0.0006599406,0.0001149139,0.00002991688,0.0002358003,0.000211849,0.7658173,0.009701414,0.1961082,0.0008245152,0.02603876],"study_design_scores_gemma":[0.00001124496,0.00007954495,0.0002021666,0.00001028019,0.00001399572,0.00009782264,0.00003666117,0.9702457,0.001753529,0.02639127,0.001143501,0.00001441201],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08030426,0.001300054,0.9100304,0.0002683268,0.00005950261,0.00005469251,0.00007137679,0.0001275212,0.007783864],"genre_scores_gemma":[0.9581584,0.0009131787,0.03847169,0.00004803186,0.00004647636,0.00009596534,0.0000299477,0.00001924973,0.002216986],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002070206,"threshold_uncertainty_score":0.009095371,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05412027862464628,"score_gpt":0.2918108702636802,"score_spread":0.2376905916390339,"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."}}