{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:XNK7ORPPUWSGZKXLZT6BFV74ER","short_pith_number":"pith:XNK7ORPP","schema_version":"1.0","canonical_sha256":"bb55f745efa5a46caaebccfc12d7fc245e5dc33e2240823b6a4b86f05ffc360e","source":{"kind":"arxiv","id":"1511.05121","version":2},"attestation_state":"computed","paper":{"title":"Deep Kalman Filters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"David Sontag, Rahul G. Krishnan, Uri Shalit","submitted_at":"2015-11-16T20:46:38Z","abstract_excerpt":"Kalman Filters are one of the most influential models of time-varying phenomena. They admit an intuitive probabilistic interpretation, have a simple functional form, and enjoy widespread adoption in a variety of disciplines. Motivated by recent variational methods for learning deep generative models, we introduce a unified algorithm to efficiently learn a broad spectrum of Kalman filters. Of particular interest is the use of temporal generative models for counterfactual inference. We investigate the efficacy of such models for counterfactual inference, and to that end we introduce the \"Healing"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1511.05121","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-11-16T20:46:38Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"28786c0274cc5f9554def71c0171e07d20bcd8ce389f2afb83722d78861048ba","abstract_canon_sha256":"6cee2c4a0cceda7a7675e383eba0602d17971937445002e6d8b8e2b4a4574159"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:02.374915Z","signature_b64":"nal2h3DhuQbNaiSYW3lNWhKlLxUZIuUDhiN/psMbUQPE+mxhVII4epwcKsGLqTw11dQHjYxQo1UqmVSkO2qTBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb55f745efa5a46caaebccfc12d7fc245e5dc33e2240823b6a4b86f05ffc360e","last_reissued_at":"2026-05-18T01:26:02.374328Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:02.374328Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deep Kalman Filters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"David Sontag, Rahul G. Krishnan, Uri Shalit","submitted_at":"2015-11-16T20:46:38Z","abstract_excerpt":"Kalman Filters are one of the most influential models of time-varying phenomena. They admit an intuitive probabilistic interpretation, have a simple functional form, and enjoy widespread adoption in a variety of disciplines. Motivated by recent variational methods for learning deep generative models, we introduce a unified algorithm to efficiently learn a broad spectrum of Kalman filters. Of particular interest is the use of temporal generative models for counterfactual inference. We investigate the efficacy of such models for counterfactual inference, and to that end we introduce the \"Healing"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05121","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1511.05121","created_at":"2026-05-18T01:26:02.374421+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.05121v2","created_at":"2026-05-18T01:26:02.374421+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05121","created_at":"2026-05-18T01:26:02.374421+00:00"},{"alias_kind":"pith_short_12","alias_value":"XNK7ORPPUWSG","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"XNK7ORPPUWSGZKXL","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"XNK7ORPP","created_at":"2026-05-18T12:29:50.041715+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":16,"internal_anchor_count":10,"sample":[{"citing_arxiv_id":"2407.07368","citing_title":"Semi-Supervised Model-Free Bayesian State Estimation from Compressed Measurements","ref_index":18,"is_internal_anchor":true},{"citing_arxiv_id":"2605.19376","citing_title":"Generative Recursive Reasoning","ref_index":35,"is_internal_anchor":true},{"citing_arxiv_id":"2605.21108","citing_title":"Efficient Learning of Deep State Space Models via Importance Smoothing","ref_index":7,"is_internal_anchor":true},{"citing_arxiv_id":"2605.16398","citing_title":"Support-Safe Variational Hybrid Filtering for Contact-Mode and Sparse-Law Recovery","ref_index":9,"is_internal_anchor":true},{"citing_arxiv_id":"2605.16682","citing_title":"Identify Then Project: Contrastive Learning of Latent Dynamics from Partial Observations with Port-Hamiltonian Structure","ref_index":12,"is_internal_anchor":true},{"citing_arxiv_id":"2605.17091","citing_title":"Mechanism Learning: Prototype-Anchored Mechanism Inference for Scientific Forecasting","ref_index":7,"is_internal_anchor":true},{"citing_arxiv_id":"2605.19376","citing_title":"Generative Recursive Reasoning","ref_index":35,"is_internal_anchor":true},{"citing_arxiv_id":"2509.04154","citing_title":"Robust Filter Attention: Self-Attention as Precision-Weighted State Estimation","ref_index":49,"is_internal_anchor":true},{"citing_arxiv_id":"2510.27503","citing_title":"pDANSE: Particle-based Data-driven Nonlinear State Estimation from Nonlinear Measurements","ref_index":19,"is_internal_anchor":true},{"citing_arxiv_id":"2010.02193","citing_title":"Mastering Atari with Discrete World Models","ref_index":34,"is_internal_anchor":true},{"citing_arxiv_id":"2604.02441","citing_title":"Adaptive Learned State Estimation based on KalmanNet","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11007","citing_title":"RT-Transformer: The Transformer Block as a Spherical State Estimator","ref_index":53,"is_internal_anchor":false},{"citing_arxiv_id":"1912.01603","citing_title":"Dream to Control: Learning Behaviors by Latent Imagination","ref_index":29,"is_internal_anchor":false},{"citing_arxiv_id":"2604.22428","citing_title":"CognitiveTwin: Robust Multi-Modal Digital Twins for Predicting Cognitive Decline in Alzheimer's Disease","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04194","citing_title":"Coupled-NeuralHP: Directional Temporal Coupling Between AI Innovation Exposure and Public Response","ref_index":27,"is_internal_anchor":false},{"citing_arxiv_id":"2604.08130","citing_title":"Cognitive Flexibility as a Latent Structural Operator for Bayesian State Estimation","ref_index":21,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XNK7ORPPUWSGZKXLZT6BFV74ER","json":"https://pith.science/pith/XNK7ORPPUWSGZKXLZT6BFV74ER.json","graph_json":"https://pith.science/api/pith-number/XNK7ORPPUWSGZKXLZT6BFV74ER/graph.json","events_json":"https://pith.science/api/pith-number/XNK7ORPPUWSGZKXLZT6BFV74ER/events.json","paper":"https://pith.science/paper/XNK7ORPP"},"agent_actions":{"view_html":"https://pith.science/pith/XNK7ORPPUWSGZKXLZT6BFV74ER","download_json":"https://pith.science/pith/XNK7ORPPUWSGZKXLZT6BFV74ER.json","view_paper":"https://pith.science/paper/XNK7ORPP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.05121&json=true","fetch_graph":"https://pith.science/api/pith-number/XNK7ORPPUWSGZKXLZT6BFV74ER/graph.json","fetch_events":"https://pith.science/api/pith-number/XNK7ORPPUWSGZKXLZT6BFV74ER/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XNK7ORPPUWSGZKXLZT6BFV74ER/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XNK7ORPPUWSGZKXLZT6BFV74ER/action/storage_attestation","attest_author":"https://pith.science/pith/XNK7ORPPUWSGZKXLZT6BFV74ER/action/author_attestation","sign_citation":"https://pith.science/pith/XNK7ORPPUWSGZKXLZT6BFV74ER/action/citation_signature","submit_replication":"https://pith.science/pith/XNK7ORPPUWSGZKXLZT6BFV74ER/action/replication_record"}},"created_at":"2026-05-18T01:26:02.374421+00:00","updated_at":"2026-05-18T01:26:02.374421+00:00"}