{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:DZAAKWYUQQ3RLAHGNNAIX5RKHL","short_pith_number":"pith:DZAAKWYU","canonical_record":{"source":{"id":"1508.00783","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-08-04T14:23:16Z","cross_cats_sorted":[],"title_canon_sha256":"2897e964910f4baaba23801ebf455737421f7f514863dcf4f6fa09e471475f23","abstract_canon_sha256":"35890e6e8f2c515b53cb3ef2ea7d40255fb0758f1a95c9f109fa2a9190431188"},"schema_version":"1.0"},"canonical_sha256":"1e40055b1484371580e66b408bf62a3aee23d9adf1e4925d4d4f59555957060a","source":{"kind":"arxiv","id":"1508.00783","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.00783","created_at":"2026-05-18T01:35:53Z"},{"alias_kind":"arxiv_version","alias_value":"1508.00783v1","created_at":"2026-05-18T01:35:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.00783","created_at":"2026-05-18T01:35:53Z"},{"alias_kind":"pith_short_12","alias_value":"DZAAKWYUQQ3R","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DZAAKWYUQQ3RLAHG","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DZAAKWYU","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:DZAAKWYUQQ3RLAHGNNAIX5RKHL","target":"record","payload":{"canonical_record":{"source":{"id":"1508.00783","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-08-04T14:23:16Z","cross_cats_sorted":[],"title_canon_sha256":"2897e964910f4baaba23801ebf455737421f7f514863dcf4f6fa09e471475f23","abstract_canon_sha256":"35890e6e8f2c515b53cb3ef2ea7d40255fb0758f1a95c9f109fa2a9190431188"},"schema_version":"1.0"},"canonical_sha256":"1e40055b1484371580e66b408bf62a3aee23d9adf1e4925d4d4f59555957060a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:53.373413Z","signature_b64":"OeLmPr2f1jfRahQGef9bS8EEMLpBfu9HuHUHoPULEh6Trgq2ghwEXTWQV9jt7Z+5MGR0McvBDDVs1haeygHyDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e40055b1484371580e66b408bf62a3aee23d9adf1e4925d4d4f59555957060a","last_reissued_at":"2026-05-18T01:35:53.372942Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:53.372942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.00783","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:35:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uuZ8HNURz+JoddMFoUDaqheyNiOnIQFCF41TpSNX+pIIBmMnE7GsmkMJLlLSeYrl8z5Y+ToVNPvzwqmsPJkfDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T00:08:42.419659Z"},"content_sha256":"297f07ca5df00088805d0712fe52f68d1f129459d51cac563ed160f1c0026b09","schema_version":"1.0","event_id":"sha256:297f07ca5df00088805d0712fe52f68d1f129459d51cac563ed160f1c0026b09"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:DZAAKWYUQQ3RLAHGNNAIX5RKHL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Efficient Meshfreee Implicit Filter for Nonlinear Filtering Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Clayton Webster, Feng Bao, Guannan Zhang, Yanzhao Cao","submitted_at":"2015-08-04T14:23:16Z","abstract_excerpt":"In this paper, we propose a meshfree approximation method for the implicit filter developed in [2], which is a novel numerical algorithm for nonlinear filtering problems. The implicit filter approximates conditional distributions in the optimal filter over a deterministic state space grid and is developed from samples of the current state obtained by solving the state equation implicitly. The purpose of the meshfree approximation is to improve the efficiency of the implicit filter in moderately high-dimensional problems. The construction of the algorithm includes generation of random state spa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.00783","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:35:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VP2BDPBKXaLa7tpR4wjES/IJuZYYhAtlueDZBvtIcASiBXIHTMHGEE0aHoyG50Ffi2aL13k47lolz9IaDNfpCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T00:08:42.420011Z"},"content_sha256":"7581c3f1353cdaf41e795b3b6189ae379f9b71280465d95c38eb45c63d48ca30","schema_version":"1.0","event_id":"sha256:7581c3f1353cdaf41e795b3b6189ae379f9b71280465d95c38eb45c63d48ca30"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DZAAKWYUQQ3RLAHGNNAIX5RKHL/bundle.json","state_url":"https://pith.science/pith/DZAAKWYUQQ3RLAHGNNAIX5RKHL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DZAAKWYUQQ3RLAHGNNAIX5RKHL/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-24T00:08:42Z","links":{"resolver":"https://pith.science/pith/DZAAKWYUQQ3RLAHGNNAIX5RKHL","bundle":"https://pith.science/pith/DZAAKWYUQQ3RLAHGNNAIX5RKHL/bundle.json","state":"https://pith.science/pith/DZAAKWYUQQ3RLAHGNNAIX5RKHL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DZAAKWYUQQ3RLAHGNNAIX5RKHL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:DZAAKWYUQQ3RLAHGNNAIX5RKHL","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"35890e6e8f2c515b53cb3ef2ea7d40255fb0758f1a95c9f109fa2a9190431188","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-08-04T14:23:16Z","title_canon_sha256":"2897e964910f4baaba23801ebf455737421f7f514863dcf4f6fa09e471475f23"},"schema_version":"1.0","source":{"id":"1508.00783","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.00783","created_at":"2026-05-18T01:35:53Z"},{"alias_kind":"arxiv_version","alias_value":"1508.00783v1","created_at":"2026-05-18T01:35:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.00783","created_at":"2026-05-18T01:35:53Z"},{"alias_kind":"pith_short_12","alias_value":"DZAAKWYUQQ3R","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DZAAKWYUQQ3RLAHG","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DZAAKWYU","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:7581c3f1353cdaf41e795b3b6189ae379f9b71280465d95c38eb45c63d48ca30","target":"graph","created_at":"2026-05-18T01:35:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In this paper, we propose a meshfree approximation method for the implicit filter developed in [2], which is a novel numerical algorithm for nonlinear filtering problems. The implicit filter approximates conditional distributions in the optimal filter over a deterministic state space grid and is developed from samples of the current state obtained by solving the state equation implicitly. The purpose of the meshfree approximation is to improve the efficiency of the implicit filter in moderately high-dimensional problems. The construction of the algorithm includes generation of random state spa","authors_text":"Clayton Webster, Feng Bao, Guannan Zhang, Yanzhao Cao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-08-04T14:23:16Z","title":"An Efficient Meshfreee Implicit Filter for Nonlinear Filtering Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.00783","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:297f07ca5df00088805d0712fe52f68d1f129459d51cac563ed160f1c0026b09","target":"record","created_at":"2026-05-18T01:35:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"35890e6e8f2c515b53cb3ef2ea7d40255fb0758f1a95c9f109fa2a9190431188","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-08-04T14:23:16Z","title_canon_sha256":"2897e964910f4baaba23801ebf455737421f7f514863dcf4f6fa09e471475f23"},"schema_version":"1.0","source":{"id":"1508.00783","kind":"arxiv","version":1}},"canonical_sha256":"1e40055b1484371580e66b408bf62a3aee23d9adf1e4925d4d4f59555957060a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1e40055b1484371580e66b408bf62a3aee23d9adf1e4925d4d4f59555957060a","first_computed_at":"2026-05-18T01:35:53.372942Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:53.372942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OeLmPr2f1jfRahQGef9bS8EEMLpBfu9HuHUHoPULEh6Trgq2ghwEXTWQV9jt7Z+5MGR0McvBDDVs1haeygHyDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:53.373413Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.00783","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:297f07ca5df00088805d0712fe52f68d1f129459d51cac563ed160f1c0026b09","sha256:7581c3f1353cdaf41e795b3b6189ae379f9b71280465d95c38eb45c63d48ca30"],"state_sha256":"118f83e8ff1f1d46e57d6f1266578af8de7a8b10aa8e82cf71366925ca217101"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3FoxT7ER2EFkaDMYjLywW4JTrcJZkuAQXyWz+Ol9H312u0v1yCdp0tTcdGFaa2xfG+A4jS9uPzttsJGDI421Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T00:08:42.421938Z","bundle_sha256":"6c09ff972876844538274a8dfd9709112656f1612e6cdac2c6a306117d47c78b"}}