{"id":"W2077647439","doi":"10.1109/icc.2013.6654748","title":"NBP: An efficient network-coding based backpressure algorithm","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Linear network coding; Computer science; Network packet; Queue; Algorithm; Coding (social sciences); Scheduling (production processes); Computer network; Mathematical optimization; 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.0006929382,0.0005236856,0.0005497691,0.0005312065,0.0005732559,0.0005865524,0.001363399,0.0005809469,0.000999946],"category_scores_gemma":[0.002749487,0.0002042012,0.0001993551,0.0004195433,0.0006586604,0.001136755,0.001256293,0.001192986,0.0002894524],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005675729,"about_ca_system_score_gemma":0.001545976,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002717,"about_ca_topic_score_gemma":0.002003985,"domain_scores_codex":[0.9994179,0.0001160752,0.00002631095,0.00005997899,0.0003102846,0.00006944751],"domain_scores_gemma":[0.9993167,0.000291953,0.00005817593,0.00007913171,0.0001982655,0.00005585635],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003989341,0.0001956942,0.001198311,0.000134183,0.00004763087,0.0001829682,0.0002196784,0.4085905,0.02998275,0.06056311,0.007554807,0.4909315],"study_design_scores_gemma":[0.00002156546,0.00004072441,0.00006754982,0.000005172184,0.000005330298,0.00004547015,0.00000813815,0.990362,0.00317564,0.004866812,0.001392955,0.000008606517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008923257,0.0001912233,0.9887372,0.0001612936,0.0001060183,0.00005355008,0.00001869432,0.0004313832,0.001377246],"genre_scores_gemma":[0.5133457,0.0004230948,0.4823116,0.0003077851,0.0001528153,0.0002764516,0.0001277941,0.0001260308,0.00292876],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002717,"threshold_uncertainty_score":0.005402386,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02744633871262434,"score_gpt":0.2597783190792147,"score_spread":0.2323319803665904,"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."}}