{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:J3S35J3L5QCJ7AYXHYK4TWC7KO","short_pith_number":"pith:J3S35J3L","schema_version":"1.0","canonical_sha256":"4ee5bea76bec049f83173e15c9d85f53b392e8470964d0d24ea21d7b79da0642","source":{"kind":"arxiv","id":"1902.07263","version":2},"attestation_state":"computed","paper":{"title":"Diffusion map-based algorithm for Gain function approximation in the Feedback Particle Filter","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA","math.PR"],"primary_cat":"math.OC","authors_text":"Amirhossein Taghvaei, Prashant G. Mehta, Sean P. Meyn","submitted_at":"2019-02-19T20:05:09Z","abstract_excerpt":"Feedback particle filter (FPF) is a numerical algorithm to approximate the solution of the nonlinear filtering problem in continuous-time settings. In any numerical implementation of the FPF algorithm, the main challenge is to numerically approximate the so-called gain function. A numerical algorithm for gain function approximation is the subject of this paper. The exact gain function is the solution of a Poisson equation involving a probability-weighted Laplacian $\\Delta_\\rho$. The numerical problem is to approximate this solution using {\\em only} finitely many particles sampled from the prob"},"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":"1902.07263","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-19T20:05:09Z","cross_cats_sorted":["cs.NA","math.NA","math.PR"],"title_canon_sha256":"4ba95a1e808139e6c8b17fd0b65c1bf7da773bfbd46491c462a852a0b4d4b6dd","abstract_canon_sha256":"222ab7d73e98bfdf5b2ec90f80f83d9403b283afff91b9edf4c780daff36c5dc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T20:13:54.769903Z","signature_b64":"e4AM8/Qsz6UfM6kkR9vHQ206csIKRzZj2z0lVtRcDwv7yXpmM/Ui0F9rmKIwPne7+sY1kJzuU+i619EhyN/hBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ee5bea76bec049f83173e15c9d85f53b392e8470964d0d24ea21d7b79da0642","last_reissued_at":"2026-06-04T20:13:54.769410Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T20:13:54.769410Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Diffusion map-based algorithm for Gain function approximation in the Feedback Particle Filter","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA","math.PR"],"primary_cat":"math.OC","authors_text":"Amirhossein Taghvaei, Prashant G. Mehta, Sean P. Meyn","submitted_at":"2019-02-19T20:05:09Z","abstract_excerpt":"Feedback particle filter (FPF) is a numerical algorithm to approximate the solution of the nonlinear filtering problem in continuous-time settings. In any numerical implementation of the FPF algorithm, the main challenge is to numerically approximate the so-called gain function. A numerical algorithm for gain function approximation is the subject of this paper. The exact gain function is the solution of a Poisson equation involving a probability-weighted Laplacian $\\Delta_\\rho$. The numerical problem is to approximate this solution using {\\em only} finitely many particles sampled from the prob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.07263","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1902.07263/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1902.07263","created_at":"2026-06-04T20:13:54.769488+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.07263v2","created_at":"2026-06-04T20:13:54.769488+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.07263","created_at":"2026-06-04T20:13:54.769488+00:00"},{"alias_kind":"pith_short_12","alias_value":"J3S35J3L5QCJ","created_at":"2026-06-04T20:13:54.769488+00:00"},{"alias_kind":"pith_short_16","alias_value":"J3S35J3L5QCJ7AYX","created_at":"2026-06-04T20:13:54.769488+00:00"},{"alias_kind":"pith_short_8","alias_value":"J3S35J3L","created_at":"2026-06-04T20:13:54.769488+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/J3S35J3L5QCJ7AYXHYK4TWC7KO","json":"https://pith.science/pith/J3S35J3L5QCJ7AYXHYK4TWC7KO.json","graph_json":"https://pith.science/api/pith-number/J3S35J3L5QCJ7AYXHYK4TWC7KO/graph.json","events_json":"https://pith.science/api/pith-number/J3S35J3L5QCJ7AYXHYK4TWC7KO/events.json","paper":"https://pith.science/paper/J3S35J3L"},"agent_actions":{"view_html":"https://pith.science/pith/J3S35J3L5QCJ7AYXHYK4TWC7KO","download_json":"https://pith.science/pith/J3S35J3L5QCJ7AYXHYK4TWC7KO.json","view_paper":"https://pith.science/paper/J3S35J3L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.07263&json=true","fetch_graph":"https://pith.science/api/pith-number/J3S35J3L5QCJ7AYXHYK4TWC7KO/graph.json","fetch_events":"https://pith.science/api/pith-number/J3S35J3L5QCJ7AYXHYK4TWC7KO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J3S35J3L5QCJ7AYXHYK4TWC7KO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J3S35J3L5QCJ7AYXHYK4TWC7KO/action/storage_attestation","attest_author":"https://pith.science/pith/J3S35J3L5QCJ7AYXHYK4TWC7KO/action/author_attestation","sign_citation":"https://pith.science/pith/J3S35J3L5QCJ7AYXHYK4TWC7KO/action/citation_signature","submit_replication":"https://pith.science/pith/J3S35J3L5QCJ7AYXHYK4TWC7KO/action/replication_record"}},"created_at":"2026-06-04T20:13:54.769488+00:00","updated_at":"2026-06-04T20:13:54.769488+00:00"}