{"id":"W2017528090","doi":"10.1155/s1048953304311032","title":"A deterministic discretisation‐step upper bound for state estimation via Clark transformations","year":2004,"lang":"en","type":"article","venue":"International Journal of Stochastic Analysis","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Upper and lower bounds; Discretization; Smoothing; Applied mathematics; State (computer science); A priori and a posteriori; Transformation (genetics); Markov chain; Grid; Stability (learning theory); Markov process; Mathematical optimization; Algorithm; Mathematical analysis; Statistics; Computer science; Geometry","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.0003967868,0.0001412546,0.0002696754,0.0007202397,0.0001574318,0.0003402688,0.0008681776,0.00005126354,0.00002809779],"category_scores_gemma":[0.000167567,0.0001239755,0.0003819751,0.0005175836,0.00005534916,0.0009090705,0.00004398138,0.0001534245,0.00001153641],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001760885,"about_ca_system_score_gemma":0.0001339184,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002867077,"about_ca_topic_score_gemma":0.00002832511,"domain_scores_codex":[0.9981203,0.00003113324,0.0007897451,0.0001871084,0.0006892619,0.0001824181],"domain_scores_gemma":[0.9980761,0.0002732571,0.0005409379,0.0002121444,0.0007799244,0.0001176534],"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.0000602957,0.0001019821,0.00005298936,0.000005039913,0.001003875,0.00001596617,0.0009199866,0.9533006,0.00008514338,0.01251145,0.0001336121,0.03180907],"study_design_scores_gemma":[0.001069332,0.0001226634,0.001093826,0.00005811507,0.0004904967,0.0001299343,0.00004460803,0.9471038,0.00006033522,0.04946316,0.0001934004,0.0001703162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006895619,0.00005346804,0.9904396,0.001623801,0.000751223,0.0001069741,0.00006401858,0.0000287479,0.00003657414],"genre_scores_gemma":[0.8272858,0.000009544394,0.17233,0.0001407192,0.0001392171,0.000008075752,0.00005747074,0.000007262121,0.0000219378],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8203902,"threshold_uncertainty_score":0.5055575,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00933430757979468,"score_gpt":0.2731855753862911,"score_spread":0.2638512678064964,"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."}}