{"id":"W1998050154","doi":"10.1109/tcomm.2013.102313.110741","title":"Coding Opportunity Densification Strategies for Instantly Decodable Network Coding","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Goodput; Linear network coding; Network packet; Erasure; Coding (social sciences); Computer science; Monotonic function; Theoretical computer science; Algorithm; Mathematical optimization; Mathematics; Computer network; Telecommunications; Wireless; Throughput","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.001495222,0.0008509885,0.0005750952,0.000813848,0.0005499607,0.0008233696,0.001394795,0.0005823488,0.001147363],"category_scores_gemma":[0.00758662,0.0003779814,0.0002605695,0.0005717833,0.001594799,0.002130761,0.0018081,0.001094777,0.0001372968],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001330839,"about_ca_system_score_gemma":0.001109455,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00147965,"about_ca_topic_score_gemma":0.002095963,"domain_scores_codex":[0.9991249,0.000262953,0.00003480897,0.0001422834,0.0002693123,0.0001657205],"domain_scores_gemma":[0.994932,0.003417765,0.0005351357,0.0004529807,0.0004750415,0.0001870978],"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.0002957376,0.0001082654,0.001005064,0.0001854417,0.00005163024,0.0002616994,0.0004556617,0.7392842,0.02647424,0.1642394,0.0009234765,0.0667152],"study_design_scores_gemma":[0.00002910266,0.0001531223,0.0003696074,0.00003549881,0.00002670921,0.0002087505,0.0001081893,0.9428834,0.01164902,0.04291372,0.001584698,0.00003814184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1010808,0.0005943545,0.8934268,0.0002036938,0.00003606632,0.00009284631,0.00004727221,0.000203526,0.004314614],"genre_scores_gemma":[0.9143293,0.0003173675,0.08310867,0.00007510522,0.00002138481,0.00009232966,0.00003413745,0.00003707183,0.001984649],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001495222,"threshold_uncertainty_score":0.009655952,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1163245033767396,"score_gpt":0.317877816346718,"score_spread":0.2015533129699785,"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."}}