{"id":"W1982293579","doi":"10.1109/isit.2012.6283957","title":"On densifying coding opportunities in instantly decodable network coding graphs","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Linear network coding; Coding (social sciences); Computer science; Shannon–Fano coding; Computer network; Variable-length code; Theoretical computer science; Decoding methods; Telecommunications; 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.001575046,0.0008432146,0.0006046197,0.0009115288,0.0005607225,0.0008673328,0.001144049,0.0007553927,0.001054757],"category_scores_gemma":[0.007856157,0.000476691,0.000314339,0.0006830146,0.00217664,0.002450782,0.001405532,0.001023508,0.0001457384],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001524447,"about_ca_system_score_gemma":0.0009040611,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001744323,"about_ca_topic_score_gemma":0.001843151,"domain_scores_codex":[0.9992695,0.0003082193,0.00001869508,0.00009394602,0.0001844039,0.0001252114],"domain_scores_gemma":[0.9945565,0.004095937,0.0004407059,0.0003116663,0.0003909585,0.0002041158],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009021352,0.00002728285,0.0004237004,0.000073441,0.00002480302,0.0001137135,0.0001780591,0.7313927,0.006523726,0.2440004,0.0005284127,0.01662353],"study_design_scores_gemma":[0.00001878409,0.00006505058,0.0002474417,0.0000239103,0.00001502721,0.00009312583,0.00006107824,0.8722197,0.002474967,0.1237169,0.001036412,0.0000275191],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09574961,0.000564371,0.8983588,0.0003927804,0.00002631894,0.00004710176,0.00004445383,0.0001302825,0.00468626],"genre_scores_gemma":[0.9152985,0.0007727534,0.08055459,0.0001672237,0.00003840824,0.0001285089,0.00004848935,0.00007515465,0.002916431],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001744323,"threshold_uncertainty_score":0.01106071,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1289542820507901,"score_gpt":0.3014449118161415,"score_spread":0.1724906297653514,"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."}}