{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001100132,0.0001704386,0.0002031127,0.000214645,0.0003892389,0.0001911923,0.0007241531,0.00004634567,0.000083903],"category_scores_gemma":[0.00007260786,0.0001601123,0.00005149256,0.0007410891,0.00003961206,0.0009438689,0.0004451071,0.0002609972,0.0000387382],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009262609,"about_ca_system_score_gemma":0.00004730411,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008925112,"about_ca_topic_score_gemma":0.00006948387,"domain_scores_codex":[0.998423,0.0002184857,0.0003220882,0.000225397,0.0002015785,0.00060945],"domain_scores_gemma":[0.9986128,0.0004870552,0.0000843056,0.0005931477,0.00006590537,0.0001567886],"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.000004038339,0.0000397233,0.005453986,0.000004289313,0.00000675572,0.000005424391,0.000645342,0.000431371,0.0001023986,0.9705794,0.002310519,0.02041679],"study_design_scores_gemma":[0.003936982,0.000410512,0.0382145,0.002205399,0.00003157896,0.0001648825,0.002983881,0.7893424,0.004562826,0.05486276,0.09943233,0.003851914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1777605,0.003700001,0.5595326,0.002751492,0.002130381,0.0005867396,0.000001104283,0.000869177,0.2526679],"genre_scores_gemma":[0.9842182,0.001772396,0.01137292,0.002084726,0.00006754023,0.00001719076,0.000002272262,0.0000118141,0.0004528876],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9157166,"threshold_uncertainty_score":0.6529189,"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."}}