{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:462JYRJZ3MVIEPD6HE5Y7N6T5F","short_pith_number":"pith:462JYRJZ","schema_version":"1.0","canonical_sha256":"e7b49c4539db2a823c7e393b8fb7d3e966d524ce0122b16eda4acaf5a28a59a5","source":{"kind":"arxiv","id":"2605.13487","version":1},"attestation_state":"computed","paper":{"title":"Path-independent Flow Matching for Multi-parameter Generative Dynamics","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Path-independent Flow Matching learns vector fields whose flows produce transport that depends only on start and end distributions, not the path taken.","cross_cats":[],"primary_cat":"cs.LG","authors_text":"AmirHossein Zamani, Eugene Belilovsky, Francisco T\\'ellez, Guy Wolf, Philippe Martin, Shuang Ni, Sina Sanjari, Yanlei Zhang","submitted_at":"2026-05-13T13:12:50Z","abstract_excerpt":"Flow Matching is a powerful framework for learning transport maps between probability distributions. Yet its standard single-parameter formulation is not designed to capture multi-parameter variations where the resulting transport should be path-independent. Path independence is crucial because it ensures that transformations depend only on the initial and target distributions, not on the specific path. In this work, we introduce Path-independent Flow Matching (PiFM), a method for learning vector fields whose induced flows yield path-independent transport between distributions. We show that Pi"},"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":true,"formal_links_present":true},"canonical_record":{"source":{"id":"2605.13487","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T13:12:50Z","cross_cats_sorted":[],"title_canon_sha256":"1c2c263ee2c20edae62fb725bcefc464fa9bd4dfe2e13618b7ff1e62484c022a","abstract_canon_sha256":"14d226fe7ff824794f333bd258125329a947a3199c74813e766551abef84ca65"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:41.245748Z","signature_b64":"C0mbNjOLMhvpWjZ9MsvA94PSuVqBZGXKubsYr3Zd2emgG9OtWWvGhpTfvXQSvbghFiXw2HsH6D5n3l3pyGnNAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7b49c4539db2a823c7e393b8fb7d3e966d524ce0122b16eda4acaf5a28a59a5","last_reissued_at":"2026-05-18T02:44:41.245186Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:41.245186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Path-independent Flow Matching for Multi-parameter Generative Dynamics","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Path-independent Flow Matching learns vector fields whose flows produce transport that depends only on start and end distributions, not the path taken.","cross_cats":[],"primary_cat":"cs.LG","authors_text":"AmirHossein Zamani, Eugene Belilovsky, Francisco T\\'ellez, Guy Wolf, Philippe Martin, Shuang Ni, Sina Sanjari, Yanlei Zhang","submitted_at":"2026-05-13T13:12:50Z","abstract_excerpt":"Flow Matching is a powerful framework for learning transport maps between probability distributions. Yet its standard single-parameter formulation is not designed to capture multi-parameter variations where the resulting transport should be path-independent. Path independence is crucial because it ensures that transformations depend only on the initial and target distributions, not on the specific path. In this work, we introduce Path-independent Flow Matching (PiFM), a method for learning vector fields whose induced flows yield path-independent transport between distributions. We show that Pi"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"we introduce Path-independent Flow Matching (PiFM), a method for learning vector fields whose induced flows yield path-independent transport between distributions. We show that, under suitable assumptions, PiFM approximates the Wasserstein barycenter","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"under suitable assumptions, PiFM approximates the Wasserstein barycenter; the structural conditions that enforce path-independence in higher-dimensional parameter domains are not specified in the abstract.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"PiFM extends Flow Matching to multi-parameter settings by enforcing path-independent flows that approximate Wasserstein barycenters under suitable assumptions.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Path-independent Flow Matching learns vector fields whose flows produce transport that depends only on start and end distributions, not the path taken.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"330a3bfe77ee1f06b6afa1e41e3924cb6c28180185aa7d72a6b4e0ab43c22321"},"source":{"id":"2605.13487","kind":"arxiv","version":1},"verdict":{"id":"c8ecc841-596f-46f4-a1e9-65dfbc2ff910","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T20:32:19.267874Z","strongest_claim":"we introduce Path-independent Flow Matching (PiFM), a method for learning vector fields whose induced flows yield path-independent transport between distributions. We show that, under suitable assumptions, PiFM approximates the Wasserstein barycenter","one_line_summary":"PiFM extends Flow Matching to multi-parameter settings by enforcing path-independent flows that approximate Wasserstein barycenters under suitable assumptions.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"under suitable assumptions, PiFM approximates the Wasserstein barycenter; the structural conditions that enforce path-independence in higher-dimensional parameter domains are not specified in the abstract.","pith_extraction_headline":"Path-independent Flow Matching learns vector fields whose flows produce transport that depends only on start and end distributions, not the path taken."},"references":{"count":46,"sample":[{"doi":"10.1051/m2an/2015020","year":2015,"title":"Multi-marginal optimal transport: theory and applications","work_id":"db877c57-449d-4409-84f6-9c3a46bcd651","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1007/s10851-022-01126-7","year":null,"title":"Unbalanced Multi-marginal Optimal Transport , volume=","work_id":"bc8a7d7d-314b-472b-8c77-956e68e7a4e9","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2017,"title":"Characterization of barycenters in the Wasserstein space by averaging optimal transport maps , author=. 2017 , eprint=","work_id":"740b80dc-ce40-4eea-8eaf-0360a97b0fd1","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1984,"title":"Marsden and Tudor Ratiu , title =","work_id":"c066eefc-d765-48e4-bbfb-c7c41ff5cbe6","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1983,"title":"Foundations of Differentiable Manifolds and Lie Groups , author=. 1983 , publisher=","work_id":"daae5ffb-2700-4320-aabb-c896e2a85d51","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":46,"snapshot_sha256":"1f2ae95f8fcf0748a9258baeb7cebe4456bac4ecb2eeb2bffb71fea08dc9d631","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"babb500b11f4821fc6f495c497b56ff3bc8729327fb39a3de97258e84e2f3db8"},"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":"2605.13487","created_at":"2026-05-18T02:44:41.245275+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.13487v1","created_at":"2026-05-18T02:44:41.245275+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13487","created_at":"2026-05-18T02:44:41.245275+00:00"},{"alias_kind":"pith_short_12","alias_value":"462JYRJZ3MVI","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"462JYRJZ3MVIEPD6","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"462JYRJZ","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/462JYRJZ3MVIEPD6HE5Y7N6T5F","json":"https://pith.science/pith/462JYRJZ3MVIEPD6HE5Y7N6T5F.json","graph_json":"https://pith.science/api/pith-number/462JYRJZ3MVIEPD6HE5Y7N6T5F/graph.json","events_json":"https://pith.science/api/pith-number/462JYRJZ3MVIEPD6HE5Y7N6T5F/events.json","paper":"https://pith.science/paper/462JYRJZ"},"agent_actions":{"view_html":"https://pith.science/pith/462JYRJZ3MVIEPD6HE5Y7N6T5F","download_json":"https://pith.science/pith/462JYRJZ3MVIEPD6HE5Y7N6T5F.json","view_paper":"https://pith.science/paper/462JYRJZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.13487&json=true","fetch_graph":"https://pith.science/api/pith-number/462JYRJZ3MVIEPD6HE5Y7N6T5F/graph.json","fetch_events":"https://pith.science/api/pith-number/462JYRJZ3MVIEPD6HE5Y7N6T5F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/462JYRJZ3MVIEPD6HE5Y7N6T5F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/462JYRJZ3MVIEPD6HE5Y7N6T5F/action/storage_attestation","attest_author":"https://pith.science/pith/462JYRJZ3MVIEPD6HE5Y7N6T5F/action/author_attestation","sign_citation":"https://pith.science/pith/462JYRJZ3MVIEPD6HE5Y7N6T5F/action/citation_signature","submit_replication":"https://pith.science/pith/462JYRJZ3MVIEPD6HE5Y7N6T5F/action/replication_record"}},"created_at":"2026-05-18T02:44:41.245275+00:00","updated_at":"2026-05-18T02:44:41.245275+00:00"}