{"id":"W2021080064","doi":"10.1109/iccnc.2013.6504227","title":"A queueing theoretic model for opportunistic network coding","year":2013,"lang":"en","type":"article","venue":"2013 International Conference on Computing, Networking and Communications (ICNC)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Network packet; Linear network coding; Queueing theory; Computer network; Coding (social sciences); Markov process; Markov chain; Markovian arrival process; Point process; Discrete time and continuous time; Real-time computing; 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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008252144,0.0003075739,0.000302398,0.0001585253,0.001228977,0.0009908198,0.00357457,0.0001039232,0.00005527724],"category_scores_gemma":[0.0000779422,0.0003088586,0.0001065033,0.0002982953,0.0002371959,0.0003834789,0.001799922,0.0004677455,0.00004254013],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008946755,"about_ca_system_score_gemma":0.0001258018,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003166945,"about_ca_topic_score_gemma":0.00005111279,"domain_scores_codex":[0.9978505,0.0002703459,0.0005892616,0.0005268779,0.0002757544,0.0004873122],"domain_scores_gemma":[0.9961105,0.0008748868,0.0003766248,0.001776791,0.0006805734,0.0001806431],"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.000005217704,0.00005554636,0.0001197858,0.000006547258,0.00004332222,2.820912e-7,0.0005968541,0.004697541,0.0000436088,0.8987439,0.006287671,0.08939976],"study_design_scores_gemma":[0.0003315136,0.00005080063,0.0002015646,0.0003130155,0.00001116336,0.000008920275,0.00005701208,0.934812,0.000002391178,0.0545541,0.009334207,0.0003233011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.000835985,0.0006286373,0.9536414,0.01347926,0.0006556223,0.0006423519,0.000004754178,0.0003513296,0.02976067],"genre_scores_gemma":[0.9226769,0.005514456,0.06885776,0.001420732,0.0002951872,0.0001785899,0.00006341272,0.00002632116,0.0009667017],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9301144,"threshold_uncertainty_score":0.9999363,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1354324222664618,"score_gpt":0.330710470689993,"score_spread":0.1952780484235313,"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."}}