{"id":"W2104648947","doi":"10.1109/vtcf.2006.293","title":"Cooperative Source Coding for the Two-Terminal Gaussian CEO Problem","year":2006,"lang":"en","type":"article","venue":"IEEE Vehicular Technology Conference","topic":"Distributed Sensor Networks and Detection Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Fusion center; Upper and lower bounds; Encoder; Distributed source coding; Linear network coding; Gaussian; Coding (social sciences); ENCODE; Terminal (telecommunication); Transmission (telecommunications); Decoding methods; Algorithm; Theoretical computer science; Channel code; Computer network; Wireless; Mathematics; Telecommunications; Cognitive radio; Network packet; Statistics","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.003854432,0.00127762,0.001685323,0.0008513928,0.0005398096,0.001309556,0.001641577,0.001972693,0.001870678],"category_scores_gemma":[0.01087845,0.0005078565,0.0006060795,0.001436275,0.002114931,0.002235292,0.002912894,0.002010624,0.0004482344],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00168674,"about_ca_system_score_gemma":0.001786029,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002242896,"about_ca_topic_score_gemma":0.001521859,"domain_scores_codex":[0.9982596,0.0007242472,0.00005909248,0.0002737844,0.0003973759,0.0002858748],"domain_scores_gemma":[0.9914547,0.00710932,0.0004795067,0.0002474849,0.0005233188,0.0001856548],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003005347,0.00008789296,0.0005339424,0.0002874499,0.00006673726,0.0004054499,0.000372315,0.7481344,0.002598121,0.2198286,0.00277948,0.02460507],"study_design_scores_gemma":[0.00006249388,0.00004456094,0.00009978574,0.00002656598,0.00001502166,0.00007559259,0.00005024552,0.9260898,0.0006312794,0.0721931,0.0006912883,0.0000202922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02539332,0.0008399902,0.9680805,0.0009121638,0.00005648959,0.00005288665,0.0001282135,0.0001168574,0.004419547],"genre_scores_gemma":[0.9028964,0.001244238,0.08882236,0.0003770685,0.0001627914,0.000288894,0.000309668,0.00007516561,0.005823432],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003854432,"threshold_uncertainty_score":0.02038449,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01289707718317511,"score_gpt":0.2382833362856805,"score_spread":0.2253862591025054,"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."}}