{"id":"W4225486508","doi":"10.1109/tcomm.2022.3168280","title":"Sparse and Low-Rank Optimization for Pliable Index Coding via Alternating Projection","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"National Natural Science Foundation of China; Natural Science Foundation of Shanghai","keywords":"Coding (social sciences); Computer science; Mathematical optimization; Greedy algorithm; Algorithm; Convergence (economics); Sparse matrix; Theoretical computer science; 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.001626041,0.001485043,0.00113232,0.0005741647,0.0005058376,0.001188072,0.001291744,0.001129398,0.002640402],"category_scores_gemma":[0.006236757,0.0005519839,0.0006684972,0.001360254,0.001708241,0.002004844,0.002167761,0.002648616,0.0007232819],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009236011,"about_ca_system_score_gemma":0.001755937,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002199959,"about_ca_topic_score_gemma":0.002289733,"domain_scores_codex":[0.9986882,0.0005711188,0.00004786952,0.0001921548,0.0003468173,0.0001539073],"domain_scores_gemma":[0.9968491,0.002202574,0.0002651893,0.0002620635,0.0002998307,0.0001211587],"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.0002347196,0.0001242411,0.000572541,0.0002230583,0.00006275858,0.0002287054,0.0001966779,0.7111025,0.007875398,0.1736474,0.004405081,0.1013268],"study_design_scores_gemma":[0.00001231674,0.00003856685,0.0000293815,0.000007162606,0.000004105575,0.00003428039,0.00001228663,0.9794704,0.0008087199,0.01909182,0.0004832316,0.000007797502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004620871,0.0001219672,0.9935336,0.0001461215,0.00001571979,0.00002876183,0.00003223077,0.00007293204,0.00142779],"genre_scores_gemma":[0.4257608,0.0009381903,0.565305,0.0003370011,0.0001355552,0.00045707,0.0003456165,0.0001392993,0.00658146],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002640402,"threshold_uncertainty_score":0.008832991,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05500643778611547,"score_gpt":0.2958758289469535,"score_spread":0.240869391160838,"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."}}