{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006516612,0.000600682,0.0005925535,0.0006469733,0.0003965516,0.0007591875,0.00106453,0.001170733,0.002138072],"category_scores_gemma":[0.003909714,0.0002703077,0.0004027902,0.0008668094,0.0007079388,0.001365993,0.001004437,0.001144266,0.0006175381],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000802641,"about_ca_system_score_gemma":0.0009121851,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003169301,"about_ca_topic_score_gemma":0.003334797,"domain_scores_codex":[0.9995059,0.00009852192,0.00002176584,0.00009341756,0.0002455736,0.00003484041],"domain_scores_gemma":[0.9986229,0.000713215,0.000104531,0.0002399719,0.0002755304,0.00004382868],"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.0001974028,0.00006067624,0.0006188073,0.0001277215,0.00004741274,0.0001526677,0.00009925885,0.693564,0.01415,0.0696281,0.005065538,0.2162884],"study_design_scores_gemma":[0.00001930443,0.00003005254,0.0001419423,0.000006749919,0.000005684814,0.00005589311,0.00001118406,0.9791566,0.003169621,0.0154513,0.001943188,0.000008588851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004898897,0.0001300784,0.9930789,0.0002024816,0.00005736103,0.00002245838,0.00003807715,0.0003145511,0.001257178],"genre_scores_gemma":[0.4707763,0.0005696186,0.5222436,0.0003714509,0.0001658921,0.0001933008,0.0003380799,0.0001730496,0.005168607],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003169301,"threshold_uncertainty_score":0.007152557,"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."}}