{"id":"W644593901","doi":"10.1017/cbo9781139034357","title":"Network-aware Source Coding and Communication","year":2011,"lang":"en","type":"book","venue":"Cambridge University Press eBooks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University; University of Regina","funders":"","keywords":"Linear network coding; Multiple description coding; Computer science; Fidelity; Coding (social sciences); Distributed computing; Computer network; Information theory; Lossy compression; Shannon–Fano coding; Distributed source coding; Variable-length code; Theoretical computer science; Source code; Lossless compression; Decoding methods; Telecommunications; Algorithm; Artificial intelligence; Data compression; Network packet; 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.000374521,0.001114447,0.0006956454,0.001068957,0.0005010341,0.001712169,0.000801443,0.00123438,0.01374752],"category_scores_gemma":[0.001107756,0.0004646498,0.0004415799,0.001914226,0.001416968,0.002121752,0.0009328058,0.002494836,0.006628934],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000821288,"about_ca_system_score_gemma":0.0009230923,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007296191,"about_ca_topic_score_gemma":0.0008521967,"domain_scores_codex":[0.9995974,0.00006107374,0.00001515558,0.0000550666,0.0002489465,0.00002242626],"domain_scores_gemma":[0.9995669,0.0002551101,0.00001606292,0.00005613856,0.00009164809,0.00001413656],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002552552,0.00002535407,0.00006744567,0.0006629211,0.00002826264,0.0001681595,0.0002960304,0.01196672,0.004585483,0.5507907,0.1131344,0.318249],"study_design_scores_gemma":[0.000007585466,0.00003344172,0.000147318,0.0003436778,0.000009722856,0.0004096562,0.00005796126,0.01176299,0.001448038,0.1845416,0.8012084,0.00002958385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.001552612,0.09275723,0.5125407,0.003167235,0.005181606,0.0001304283,0.0004114103,0.001197785,0.383061],"genre_scores_gemma":[0.04330473,0.1490091,0.2302915,0.002855012,0.002967336,0.0005902361,0.001095216,0.0007851662,0.5691017],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.01374752,"threshold_uncertainty_score":0.04598999,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04459499555015852,"score_gpt":0.2148636940127752,"score_spread":0.1702686984626166,"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."}}