{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:QSCENX6YI2BEEAIX7LYRBCPXQX","short_pith_number":"pith:QSCENX6Y","schema_version":"1.0","canonical_sha256":"848446dfd84682420117faf11089f785fc68442732f076a7ab5b8b539562888e","source":{"kind":"arxiv","id":"1901.10543","version":1},"attestation_state":"computed","paper":{"title":"A High-Dimensional Particle Filter Algorithm","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"stat.CO","authors_text":"Jameson Quinn","submitted_at":"2019-01-29T20:56:38Z","abstract_excerpt":"Online data assimilation in time series models over a large spatial extent is an important problem in both geosciences and robotics. Such models are intrinsically high-dimensional, rendering traditional particle filter algorithms ineffective. Though methods that begin to address this problem exist, they either rely on additional assumptions or lead to error that is spatially inhomogeneous. I present a novel particle-based algorithm for online approximation of the filtering problem on such models, using the fact that each locus affects only nearby loci at the next time step. The algorithm is ba"},"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":"1901.10543","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"stat.CO","submitted_at":"2019-01-29T20:56:38Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"1faa65c20c6709cb7662cf118b54423b937b35e5631be9f25abdddee26c15686","abstract_canon_sha256":"37ff60e96f1b9cf9d1ec0b19826b8c7d5e6dbaccddf8c517b18c237a79ecd12f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:06.699964Z","signature_b64":"b/y8Bk5N6CBaHlSt/UESt8fY24hne4H2k+T3V2HKtCUT5cKgTDwRwVuT60gRRsv8cCTvQ0zNgn/o4APCCKkbDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"848446dfd84682420117faf11089f785fc68442732f076a7ab5b8b539562888e","last_reissued_at":"2026-05-17T23:55:06.699484Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:06.699484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A High-Dimensional Particle Filter Algorithm","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"stat.CO","authors_text":"Jameson Quinn","submitted_at":"2019-01-29T20:56:38Z","abstract_excerpt":"Online data assimilation in time series models over a large spatial extent is an important problem in both geosciences and robotics. Such models are intrinsically high-dimensional, rendering traditional particle filter algorithms ineffective. Though methods that begin to address this problem exist, they either rely on additional assumptions or lead to error that is spatially inhomogeneous. I present a novel particle-based algorithm for online approximation of the filtering problem on such models, using the fact that each locus affects only nearby loci at the next time step. The algorithm is ba"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.10543","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":"1901.10543","created_at":"2026-05-17T23:55:06.699563+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.10543v1","created_at":"2026-05-17T23:55:06.699563+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.10543","created_at":"2026-05-17T23:55:06.699563+00:00"},{"alias_kind":"pith_short_12","alias_value":"QSCENX6YI2BE","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"QSCENX6YI2BEEAIX","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"QSCENX6Y","created_at":"2026-05-18T12:33:27.125529+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2409.14585","citing_title":"A convergent scheme for the Bayesian filtering problem based on the Fokker--Planck equation and deep splitting","ref_index":42,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QSCENX6YI2BEEAIX7LYRBCPXQX","json":"https://pith.science/pith/QSCENX6YI2BEEAIX7LYRBCPXQX.json","graph_json":"https://pith.science/api/pith-number/QSCENX6YI2BEEAIX7LYRBCPXQX/graph.json","events_json":"https://pith.science/api/pith-number/QSCENX6YI2BEEAIX7LYRBCPXQX/events.json","paper":"https://pith.science/paper/QSCENX6Y"},"agent_actions":{"view_html":"https://pith.science/pith/QSCENX6YI2BEEAIX7LYRBCPXQX","download_json":"https://pith.science/pith/QSCENX6YI2BEEAIX7LYRBCPXQX.json","view_paper":"https://pith.science/paper/QSCENX6Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.10543&json=true","fetch_graph":"https://pith.science/api/pith-number/QSCENX6YI2BEEAIX7LYRBCPXQX/graph.json","fetch_events":"https://pith.science/api/pith-number/QSCENX6YI2BEEAIX7LYRBCPXQX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QSCENX6YI2BEEAIX7LYRBCPXQX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QSCENX6YI2BEEAIX7LYRBCPXQX/action/storage_attestation","attest_author":"https://pith.science/pith/QSCENX6YI2BEEAIX7LYRBCPXQX/action/author_attestation","sign_citation":"https://pith.science/pith/QSCENX6YI2BEEAIX7LYRBCPXQX/action/citation_signature","submit_replication":"https://pith.science/pith/QSCENX6YI2BEEAIX7LYRBCPXQX/action/replication_record"}},"created_at":"2026-05-17T23:55:06.699563+00:00","updated_at":"2026-05-17T23:55:06.699563+00:00"}