{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:Z72TIE6MHEOL2LUJCREIQ57OVN","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":"140fdf4a0d0fc34f1d63f78e2254f3b5ed82df3732fb519f77882420aafcb0c9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T06:34:08Z","title_canon_sha256":"3fe0a4f0daee464b4049d970f977a226b85e334e3ca85535bd5516d6a32514b4"},"schema_version":"1.0","source":{"id":"2605.13063","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13063","created_at":"2026-05-18T03:08:59Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13063v1","created_at":"2026-05-18T03:08:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13063","created_at":"2026-05-18T03:08:59Z"},{"alias_kind":"pith_short_12","alias_value":"Z72TIE6MHEOL","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"Z72TIE6MHEOL2LUJ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"Z72TIE6M","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:caaafd93697240c56249409c432b651f9ccb327f661bf9d2a9e80f874c291312","target":"graph","created_at":"2026-05-18T03:08:59Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"The composed trajectory is asymptotically ergodic with respect to the learned pushforward distribution, with deviation from the target controlled by the flow-matching training loss; the three bounds combine into an end-to-end coverage bound estimable from CFM training diagnostics (certified given an architectural Lipschitz bound on v_θ)."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That a single offline-trained conditional flow matching map can transport the exact uniform ergodic occupancy of the analytic latent trajectory onto an arbitrary target density while respecting all operational constraints, with the approximation error bounded solely by the training loss and a Lipschitz constant on the learned velocity field."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"An analytic uniform ergodic latent trajectory is pushed forward by a conditional flow matching map to produce asymptotically ergodic trajectories matching any target density with provable coverage bounds."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A learned pushforward map turns an analytic uniform ergodic path into trajectories whose time-averaged occupancy matches any target density with error controlled by training loss."}],"snapshot_sha256":"452b8a6f75fb78bef4a2f486a60a12bfadd60638aeedca8edea3079a2a16cd78"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"bea44b039ed7e248f22c0fd02055969d2c9039cedc8a4ba8715310e0cac935cb"},"paper":{"abstract_excerpt":"Designing continuous trajectories whose time-averaged occupancy provably matches a prescribed spatial density (the \\emph{ergodic coverage} problem) is central to UAV-assisted data collection and sensing, robotic exploration, and mobile monitoring. For flying agents in particular, this challenge is acute: trajectories must balance coverage fidelity against tight energy budgets, no-fly zones, and acceleration limits. Existing methods either re-optimize each trajectory online (with cost growing in the horizon and re-running for every target, agent, and realization) or rely on bespoke analytical c","authors_text":"Ahmad Ghasemi, Ehsan Aghazadeh, Hossein Pishro-Nik, Masoud Malekzadeh","cross_cats":[],"headline":"A learned pushforward map turns an analytic uniform ergodic path into trajectories whose time-averaged occupancy matches any target density with error controlled by training loss.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T06:34:08Z","title":"Ergodic Trajectory Design by Learned Pushforward Maps: Provable Coverage via Conditional Flow Matching"},"references":{"count":58,"internal_anchors":0,"resolved_work":58,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Abraham, I. and Murphey, T. D. Decentralized ergodic control: distribution-driven sensing and exploration for multiagent systems.IEEE Robotics and Automation Letters, 3(4):2987–2994, 2018. 9","work_id":"ee61a2ba-2792-4d6f-b3cc-b185885e561a","year":2018},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Caffarelli, L. A. The regularity of mappings with a convex potential.Journal of the American Mathematical Society, 5(1):99–104, 1992","work_id":"bb0cb438-5e2d-4d0d-b656-7ddc6b3e917d","year":1992},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"and ´Swie ¸ch, A","work_id":"9be1f24f-b7e6-4f0a-8e63-66e75a779cb1","year":1998},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Moving aerial base station networks: A stochastic geometry analysis and design perspective.IEEE Trans","work_id":"f46b1936-d009-4940-ab22-f088b4cb85bf","year":2019},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Galceran, E. and Carreras, M. A survey on coverage path planning for robotics.Robotics and Autonomous Systems, 61(12):1258–1276, 2013","work_id":"26f2c0e2-15bd-4905-9169-e8107c792366","year":2013}],"snapshot_sha256":"c11084acdf9b8bff79017578afa301cc9a4a8eb4c11735cbe42a4d27e026654f"},"source":{"id":"2605.13063","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T20:02:55.471184Z","id":"efb92ca1-8d6a-4d12-9b2e-6218ac9e4dff","model_set":{"reader":"grok-4.3"},"one_line_summary":"An analytic uniform ergodic latent trajectory is pushed forward by a conditional flow matching map to produce asymptotically ergodic trajectories matching any target density with provable coverage bounds.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A learned pushforward map turns an analytic uniform ergodic path into trajectories whose time-averaged occupancy matches any target density with error controlled by training loss.","strongest_claim":"The composed trajectory is asymptotically ergodic with respect to the learned pushforward distribution, with deviation from the target controlled by the flow-matching training loss; the three bounds combine into an end-to-end coverage bound estimable from CFM training diagnostics (certified given an architectural Lipschitz bound on v_θ).","weakest_assumption":"That a single offline-trained conditional flow matching map can transport the exact uniform ergodic occupancy of the analytic latent trajectory onto an arbitrary target density while respecting all operational constraints, with the approximation error bounded solely by the training loss and a Lipschitz constant on the learned velocity field."}},"verdict_id":"efb92ca1-8d6a-4d12-9b2e-6218ac9e4dff"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b50d1c10d9c01164b60d9d67954568ada7d93e33be1d44ae11ba29a479bed095","target":"record","created_at":"2026-05-18T03:08:59Z","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":"140fdf4a0d0fc34f1d63f78e2254f3b5ed82df3732fb519f77882420aafcb0c9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T06:34:08Z","title_canon_sha256":"3fe0a4f0daee464b4049d970f977a226b85e334e3ca85535bd5516d6a32514b4"},"schema_version":"1.0","source":{"id":"2605.13063","kind":"arxiv","version":1}},"canonical_sha256":"cff53413cc391cbd2e8914488877eeab711756544351396a482b03de40127188","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cff53413cc391cbd2e8914488877eeab711756544351396a482b03de40127188","first_computed_at":"2026-05-18T03:08:59.039144Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:08:59.039144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V5MZD0HzXPB3M84Mlb/qZ7Wajq6Rp5zMpGomuo3fTWNou+IX+XcafWC9mAQjmcWlFE7f8lBuxXEG55EvJvtVCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:08:59.039873Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13063","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b50d1c10d9c01164b60d9d67954568ada7d93e33be1d44ae11ba29a479bed095","sha256:caaafd93697240c56249409c432b651f9ccb327f661bf9d2a9e80f874c291312"],"state_sha256":"df829236c15109106edec475e054540e8feae1d7e742db974b6b4fad9d57d6a6"}