{"id":"W2046038780","doi":"10.1109/icuwb.2015.7324411","title":"A Set Cover Based Efficient Solution for the Complementary Index Coding Problem","year":2015,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Pfizer (Canada); University of Toronto","funders":"","keywords":"Linear network coding; Computer science; Network packet; Coding (social sciences); Relay; Channel state information; Optimization problem; Set cover problem; Mathematical optimization; Wireless; Algorithm; Set (abstract data type); Computer network; Mathematics; Telecommunications","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.0008160305,0.001012344,0.001138172,0.001224858,0.0007773594,0.001296283,0.001864902,0.001979634,0.004932901],"category_scores_gemma":[0.00432038,0.0004320024,0.001075889,0.00189599,0.000831651,0.001819812,0.001730226,0.001850755,0.0007075469],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001445096,"about_ca_system_score_gemma":0.00214152,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002479065,"about_ca_topic_score_gemma":0.002656174,"domain_scores_codex":[0.9991453,0.0002075118,0.0000270799,0.0001346596,0.0003360767,0.0001493332],"domain_scores_gemma":[0.9983578,0.001112145,0.0001179053,0.0001528578,0.0001840607,0.00007503734],"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.000272893,0.0003265176,0.0006359612,0.0004315491,0.0000868325,0.0003789389,0.0002975356,0.6590667,0.009043789,0.1129891,0.01817382,0.1982964],"study_design_scores_gemma":[0.00004353156,0.0001030507,0.0001399475,0.00003206417,0.00001787534,0.0002666741,0.00006212803,0.9562249,0.001897231,0.03795822,0.003238909,0.00001542672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02046244,0.0003609243,0.9696881,0.0005779213,0.00008521559,0.000188686,0.0002576198,0.0002709931,0.008108051],"genre_scores_gemma":[0.2851465,0.0006523379,0.7051771,0.0003319472,0.0001347402,0.0005364905,0.0008692171,0.0001472251,0.007004477],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004932901,"threshold_uncertainty_score":0.0165022,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.130043313637515,"score_gpt":0.3242830064190353,"score_spread":0.1942396927815203,"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."}}