{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:A5VZDP7KU7ORSGTTE77HEJ2HJ5","short_pith_number":"pith:A5VZDP7K","schema_version":"1.0","canonical_sha256":"076b91bfeaa7dd191a7327fe7227474f7455ea834d46d920f977e14d93f04568","source":{"kind":"arxiv","id":"1412.3501","version":1},"attestation_state":"computed","paper":{"title":"A Stable Particle Filter in High-Dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Ajay Jasra, Alex Beskos, Dan Crisan, Kengo Kamatani, Yan Zhou","submitted_at":"2014-12-11T00:03:57Z","abstract_excerpt":"We consider the numerical approximation of the filtering problem in high dimensions, that is, when the hidden state lies in $\\mathbb{R}^d$ with $d$ large. For low dimensional problems, one of the most popular numerical procedures for consistent inference is the class of approximations termed particle filters or sequential Monte Carlo methods. However, in high dimensions, standard particle filters (e.g. the bootstrap particle filter) can have a cost that is exponential in $d$ for the algorithm to be stable in an appropriate sense. We develop a new particle filter, called the \\emph{space-time pa"},"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":"1412.3501","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2014-12-11T00:03:57Z","cross_cats_sorted":[],"title_canon_sha256":"bc8831d2ee6cd1a1454cb7451a7f47aeba4d900786d0a7caf291bb63623b6c6b","abstract_canon_sha256":"1c0f90a65a4415f9700037f3d7e2f73e219432dfba3ec55a6a5a1d13cc5592ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:36.425021Z","signature_b64":"b4eKw1QcBiik25Ts0uZhNr/DOmTh9BBfPv3iqItITDnq70Umq2ZE8RIKg1VjfRbwZabQ+D2XtnBJvP1jEFBvBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"076b91bfeaa7dd191a7327fe7227474f7455ea834d46d920f977e14d93f04568","last_reissued_at":"2026-05-18T02:31:36.424561Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:36.424561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Stable Particle Filter in High-Dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Ajay Jasra, Alex Beskos, Dan Crisan, Kengo Kamatani, Yan Zhou","submitted_at":"2014-12-11T00:03:57Z","abstract_excerpt":"We consider the numerical approximation of the filtering problem in high dimensions, that is, when the hidden state lies in $\\mathbb{R}^d$ with $d$ large. For low dimensional problems, one of the most popular numerical procedures for consistent inference is the class of approximations termed particle filters or sequential Monte Carlo methods. However, in high dimensions, standard particle filters (e.g. the bootstrap particle filter) can have a cost that is exponential in $d$ for the algorithm to be stable in an appropriate sense. We develop a new particle filter, called the \\emph{space-time pa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.3501","kind":"arxiv","version":1},"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":"1412.3501","created_at":"2026-05-18T02:31:36.424622+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.3501v1","created_at":"2026-05-18T02:31:36.424622+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.3501","created_at":"2026-05-18T02:31:36.424622+00:00"},{"alias_kind":"pith_short_12","alias_value":"A5VZDP7KU7OR","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"A5VZDP7KU7ORSGTT","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"A5VZDP7K","created_at":"2026-05-18T12:28:19.803747+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A5VZDP7KU7ORSGTTE77HEJ2HJ5","json":"https://pith.science/pith/A5VZDP7KU7ORSGTTE77HEJ2HJ5.json","graph_json":"https://pith.science/api/pith-number/A5VZDP7KU7ORSGTTE77HEJ2HJ5/graph.json","events_json":"https://pith.science/api/pith-number/A5VZDP7KU7ORSGTTE77HEJ2HJ5/events.json","paper":"https://pith.science/paper/A5VZDP7K"},"agent_actions":{"view_html":"https://pith.science/pith/A5VZDP7KU7ORSGTTE77HEJ2HJ5","download_json":"https://pith.science/pith/A5VZDP7KU7ORSGTTE77HEJ2HJ5.json","view_paper":"https://pith.science/paper/A5VZDP7K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.3501&json=true","fetch_graph":"https://pith.science/api/pith-number/A5VZDP7KU7ORSGTTE77HEJ2HJ5/graph.json","fetch_events":"https://pith.science/api/pith-number/A5VZDP7KU7ORSGTTE77HEJ2HJ5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A5VZDP7KU7ORSGTTE77HEJ2HJ5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A5VZDP7KU7ORSGTTE77HEJ2HJ5/action/storage_attestation","attest_author":"https://pith.science/pith/A5VZDP7KU7ORSGTTE77HEJ2HJ5/action/author_attestation","sign_citation":"https://pith.science/pith/A5VZDP7KU7ORSGTTE77HEJ2HJ5/action/citation_signature","submit_replication":"https://pith.science/pith/A5VZDP7KU7ORSGTTE77HEJ2HJ5/action/replication_record"}},"created_at":"2026-05-18T02:31:36.424622+00:00","updated_at":"2026-05-18T02:31:36.424622+00:00"}