{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:R4LW7JVFICMEXY6J77WRYNMTXF","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":"264cbda82d5ebece2732453aea4b5a146805958975266f326bac031f8816fb3b","cross_cats_sorted":["cs.LG","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2026-05-13T08:36:49Z","title_canon_sha256":"b6db7a6514ab0f3fe2265c552f9d4bcf7144a41b0c9a152f6008653dd7306edf"},"schema_version":"1.0","source":{"id":"2605.13174","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13174","created_at":"2026-05-18T03:08:56Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13174v1","created_at":"2026-05-18T03:08:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13174","created_at":"2026-05-18T03:08:56Z"},{"alias_kind":"pith_short_12","alias_value":"R4LW7JVFICME","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"R4LW7JVFICMEXY6J","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"R4LW7JVF","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:5f58049ef9aade88fbf67491f7a257a1f3db870e15cee960b32825bd217fb705","target":"graph","created_at":"2026-05-18T03:08:56Z","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":3,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"The proposed approach accurately approximates non-Gaussian filtering posteriors and avoids particle collapse. We provide a convergence analysis for the expectation of the MMD between the approximated posterior and the truth posterior."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The block-triangular structure in the transport map based on couplings between state and observation variables allows reformulation as MMD minimization, and gradient flows yield an analytic transport map implying the steepest descent direction."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Coupling-informed transport maps approximate non-Gaussian posteriors in Bayesian filtering by minimizing MMD via gradient flows, with convergence analysis and high-dimensional localization."}],"snapshot_sha256":"d6372c089657d32498a805a8e4648d49c0c881254d16f7b830e7475d99e60b10"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"A likelihood-free transport filtering method is proposed based on the couplings between state and observation variables. By exploiting a block-triangular structure in the transport map, the analysis step of filtering is reformulated as the minimization of the maximum mean discrepancy (MMD) between the true joint measure and its transport-based approximation. To circumvent the non-convexity in the MMD optimization, we introduce a training-free transport filter method via gradient flows, which leads to an analytic computation for the transport map that implies the steepest descent direction of t","authors_text":"Dengfei Zeng, Dunhui Xiao, Lijian Jiang, Shuyu Sun","cross_cats":["cs.LG","stat.CO"],"headline":"Coupling-informed transport maps approximate non-Gaussian posteriors in Bayesian filtering by minimizing MMD via gradient flows, with convergence analysis and high-dimensional localization.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2026-05-13T08:36:49Z","title":"Coupling-Informed Transport Maps for Bayesian Filtering in Nonlinear Dynamical Systems"},"references":{"count":35,"internal_anchors":0,"resolved_work":35,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"SIAM Journal on Scientific Computing , volume =","work_id":"1340512c-7041-4bae-a58f-c9df1def7b46","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Proceedings of Machine Learning Research , pages =","work_id":"4ec967ef-dde1-402a-b93e-912b4de62c32","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Arbel, Michael and Korba, Anna and Salim, Adil and Gretton, Arthur , year = 2019, booktitle =. Maximum","work_id":"5627b905-d76c-4af1-829e-2b5ae2722d65","year":2019},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Data Assimilation:","work_id":"49a896f9-5cb3-4559-a25a-15e9a1476e1e","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"and Marzouk, Youssef M","work_id":"801645e3-68db-45b6-ad1e-d01ead7795e2","year":2024}],"snapshot_sha256":"e5a4cd874131332574879d28bad9a1b4625650746831e108e8c9ff867d776968"},"source":{"id":"2605.13174","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T17:55:33.190521Z","id":"9689bed0-425f-4e72-a7c5-0baf6cb59661","model_set":{"reader":"grok-4.3"},"one_line_summary":"Coupling-informed transport maps approximate non-Gaussian posteriors in Bayesian filtering by minimizing MMD via gradient flows, with convergence analysis and high-dimensional localization.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"","strongest_claim":"The proposed approach accurately approximates non-Gaussian filtering posteriors and avoids particle collapse. We provide a convergence analysis for the expectation of the MMD between the approximated posterior and the truth posterior.","weakest_assumption":"The block-triangular structure in the transport map based on couplings between state and observation variables allows reformulation as MMD minimization, and gradient flows yield an analytic transport map implying the steepest descent direction."}},"verdict_id":"9689bed0-425f-4e72-a7c5-0baf6cb59661"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:fe4bd34d06e6d4dfc1c9e9ee90aeb3017fe3f5bb3773e16ede73500abf5abfe4","target":"record","created_at":"2026-05-18T03:08:56Z","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":"264cbda82d5ebece2732453aea4b5a146805958975266f326bac031f8816fb3b","cross_cats_sorted":["cs.LG","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2026-05-13T08:36:49Z","title_canon_sha256":"b6db7a6514ab0f3fe2265c552f9d4bcf7144a41b0c9a152f6008653dd7306edf"},"schema_version":"1.0","source":{"id":"2605.13174","kind":"arxiv","version":1}},"canonical_sha256":"8f176fa6a540984be3c9ffed1c3593b963e08016792bae73c85b469901ce5b28","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8f176fa6a540984be3c9ffed1c3593b963e08016792bae73c85b469901ce5b28","first_computed_at":"2026-05-18T03:08:56.498109Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:08:56.498109Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZC0/iJLe4MLMuvVF3ePUacK5++J63/Z1T1jDlqiWz3aAqq+MX270glQUFcQ0KipKY5+pVaFMMCWTH3Rb3Iu9Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:08:56.498705Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13174","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fe4bd34d06e6d4dfc1c9e9ee90aeb3017fe3f5bb3773e16ede73500abf5abfe4","sha256:5f58049ef9aade88fbf67491f7a257a1f3db870e15cee960b32825bd217fb705"],"state_sha256":"85d8bb88a63cf5ea376f16162666202f34256406e84ce5854705970fcbe1520a"}