{"id":"W2144433150","doi":"10.1109/glocom.2005.1578390","title":"On distributed space-time filtering","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Node (physics); Computer science; Channel (broadcasting); Relation (database); Filter (signal processing); Algorithm; Grassmannian; Upper and lower bounds; Optimization problem; Wireless; Topology (electrical circuits); Mathematical optimization; Control theory (sociology); Mathematics; Artificial intelligence; Telecommunications; Engineering; Data mining","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":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000543355,0.0005020528,0.0004960485,0.0001798973,0.001042963,0.0006925479,0.005718539,0.0001721471,0.0005335763],"category_scores_gemma":[0.0001537153,0.0005263648,0.0002055457,0.001259045,0.0002114295,0.0008712076,0.001286059,0.0006168733,0.002478251],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006864176,"about_ca_system_score_gemma":0.000354367,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003775183,"about_ca_topic_score_gemma":0.0005175264,"domain_scores_codex":[0.9966537,0.0005545281,0.000767148,0.0007003795,0.0004368823,0.0008873916],"domain_scores_gemma":[0.9940204,0.0003401991,0.0003165651,0.004494846,0.0004393476,0.0003886495],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00003143532,0.0009657928,0.0001625481,0.00001040657,0.0001537605,0.000007828577,0.0003202184,0.005561972,0.001327939,0.4178972,0.3137752,0.2597857],"study_design_scores_gemma":[0.001274946,0.0001753473,0.003094707,0.0001765319,0.00003105354,0.00008645906,0.00003165807,0.2928588,0.001068133,0.004250032,0.6958149,0.001137359],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02410904,0.001617483,0.6945829,0.07622015,0.001318899,0.00143155,0.0005047379,0.002533153,0.1976821],"genre_scores_gemma":[0.9340465,0.001995859,0.05969044,0.001962285,0.0001697466,0.0001231485,0.000237722,0.0000247414,0.001749526],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9099375,"threshold_uncertainty_score":0.9997188,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03322163927317642,"score_gpt":0.2843909355407304,"score_spread":0.2511692962675539,"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."}}