{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002337216,0.0002307675,0.0002335358,0.0001552577,0.0005857994,0.0003077864,0.00114492,0.0002141274,0.00000970979],"category_scores_gemma":[0.00002716154,0.000168944,0.00009060762,0.000750131,0.0003211388,0.0001875985,0.0001337817,0.0003759558,0.00003079706],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004439794,"about_ca_system_score_gemma":0.00009190264,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005352832,"about_ca_topic_score_gemma":0.00006484499,"domain_scores_codex":[0.9984314,0.00004753642,0.0002945051,0.0005397582,0.0001940253,0.0004927355],"domain_scores_gemma":[0.9986917,0.0001345107,0.0001604294,0.000642035,0.0003227105,0.00004860939],"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.00003520225,0.0001939646,0.0002586557,0.00002875535,0.000121859,0.0001307188,0.0001568965,0.04570882,0.01678212,0.685649,0.005393658,0.2455404],"study_design_scores_gemma":[0.0007361057,0.0001746192,0.00008603969,0.00004191324,0.00002534746,0.0002381325,0.00009235343,0.9184461,0.0265428,0.0101273,0.04314956,0.0003396889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008063923,0.0001580807,0.9860026,0.003766411,0.0003819463,0.0005323219,0.0000102033,0.0006462608,0.0004382969],"genre_scores_gemma":[0.9744956,0.00001484037,0.02426135,0.0001781064,0.0001417873,0.000199254,0.000006539052,0.00001396813,0.0006885697],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9664317,"threshold_uncertainty_score":0.6889338,"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."}}