{"id":"W2907596805","doi":"10.1109/tsipn.2018.2890231","title":"Graph-Based Compression for Distributed Particle Filters","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Signal and Information Processing over Networks","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Exploit; Overhead (engineering); Particle filter; Laplacian matrix; ENCODE; Graph; Algorithm; Theoretical computer science; Distributed computing; Filter (signal processing)","routes":{"ca_aff":true,"ca_fund":true,"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.000113452,0.0001685125,0.0001559227,0.00009598421,0.0003319178,0.0002662489,0.0002126234,0.00009336605,0.00002059816],"category_scores_gemma":[0.000001326028,0.0001461887,0.00007973175,0.0004834339,0.00004728797,0.003691476,0.000003111101,0.0002028969,0.000007341448],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002304809,"about_ca_system_score_gemma":0.00002827065,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001746743,"about_ca_topic_score_gemma":6.259377e-7,"domain_scores_codex":[0.9989586,0.00002370006,0.0003158638,0.0002064906,0.0002059146,0.0002894564],"domain_scores_gemma":[0.9993017,0.0001390901,0.0001605246,0.0001866957,0.0001056051,0.0001063297],"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.0001099556,0.00003264048,0.00004021014,0.00004246818,0.000007542548,1.702908e-7,0.00007105571,0.8361898,0.00009665215,0.0003952567,0.0002232624,0.162791],"study_design_scores_gemma":[0.001048036,0.0001778273,0.0002751641,0.0001073814,0.00000951337,0.000002295428,0.0000136443,0.9929901,0.003323312,0.0004179085,0.001437495,0.0001972853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008232418,0.00005226903,0.9905754,0.000188419,0.0003202716,0.0003658969,0.00001686514,0.0001980493,0.00005045866],"genre_scores_gemma":[0.9930407,0.00001394969,0.005385843,0.001427255,0.00002002205,0.0000603643,0.00002289283,0.000007508521,0.00002148775],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9851895,"threshold_uncertainty_score":0.5961402,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008885015688578418,"score_gpt":0.2240665093562346,"score_spread":0.2151814936676562,"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."}}