{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0005870255,0.0002420399,0.0002492889,0.000190724,0.002435456,0.0006811095,0.002690737,0.0001108904,0.0001113371],"category_scores_gemma":[0.000034018,0.0002590115,0.000148835,0.0008874408,0.0001628028,0.001556176,0.00004248825,0.0004663461,0.0001177139],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001545051,"about_ca_system_score_gemma":0.0003148548,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004484124,"about_ca_topic_score_gemma":0.0003799325,"domain_scores_codex":[0.9981039,0.0003545047,0.0005456734,0.0003724257,0.0001978081,0.0004257274],"domain_scores_gemma":[0.9945217,0.001132492,0.0002078205,0.003325228,0.000597993,0.0002148191],"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.00001440991,0.0005371994,0.00001977649,0.00002929009,0.0001283605,3.85478e-7,0.001673662,0.01760429,0.005437946,0.739955,0.009886073,0.2247136],"study_design_scores_gemma":[0.0007962028,0.0001596244,0.0003526569,0.000169617,0.00004833336,0.00001353802,0.0008215153,0.9313633,0.002016482,0.02129785,0.04227553,0.0006853033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0005155793,0.0002751533,0.9834281,0.006372391,0.0003624457,0.0009459875,0.00001202223,0.000449458,0.007638907],"genre_scores_gemma":[0.897875,0.003024423,0.09662972,0.0008420689,0.00003718759,0.0009917585,0.00002205992,0.00002527493,0.0005525312],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9137591,"threshold_uncertainty_score":0.9999862,"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."}}