{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:462JYRJZ3MVIEPD6HE5Y7N6T5F","short_pith_number":"pith:462JYRJZ","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"},"canonical_sha256":"e7b49c4539db2a823c7e393b8fb7d3e966d524ce0122b16eda4acaf5a28a59a5","source":{"kind":"arxiv","id":"2605.13487","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13487","created_at":"2026-05-18T02:44:41Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13487v1","created_at":"2026-05-18T02:44:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13487","created_at":"2026-05-18T02:44:41Z"},{"alias_kind":"pith_short_12","alias_value":"462JYRJZ3MVI","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"462JYRJZ3MVIEPD6","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"462JYRJZ","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:462JYRJZ3MVIEPD6HE5Y7N6T5F","target":"record","payload":{"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"},"canonical_sha256":"e7b49c4539db2a823c7e393b8fb7d3e966d524ce0122b16eda4acaf5a28a59a5","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"},"source_kind":"arxiv","source_id":"2605.13487","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-18T02:44:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xeaPKNo70CNvKbf7bRJKVIkWVLJwWkTCSynjH5PLix9b+wNxgRDW9t/iQKCxADO07JIYPDwANAsEBENPOWWKCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:25:32.146722Z"},"content_sha256":"1a27b9533a8377bfa1f0740ec8f6f880f7764ee2e16691bf23a1eb1db5839504","schema_version":"1.0","event_id":"sha256:1a27b9533a8377bfa1f0740ec8f6f880f7764ee2e16691bf23a1eb1db5839504"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:462JYRJZ3MVIEPD6HE5Y7N6T5F","target":"graph","payload":{"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"},"verdict_id":"c8ecc841-596f-46f4-a1e9-65dfbc2ff910"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:44:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AYQGpvb1MgllbSovN/lavg5iLavNptnu6pbNazaHqmwlCr0rhHauByTMGUa7ia+H8ETyF5InYupDZp34u8j+Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:25:32.147708Z"},"content_sha256":"0eaf7646a68606b652df802bd06d7679660e61788d23b0aa89f421564368c96d","schema_version":"1.0","event_id":"sha256:0eaf7646a68606b652df802bd06d7679660e61788d23b0aa89f421564368c96d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/462JYRJZ3MVIEPD6HE5Y7N6T5F/bundle.json","state_url":"https://pith.science/pith/462JYRJZ3MVIEPD6HE5Y7N6T5F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/462JYRJZ3MVIEPD6HE5Y7N6T5F/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-05-27T15:25:32Z","links":{"resolver":"https://pith.science/pith/462JYRJZ3MVIEPD6HE5Y7N6T5F","bundle":"https://pith.science/pith/462JYRJZ3MVIEPD6HE5Y7N6T5F/bundle.json","state":"https://pith.science/pith/462JYRJZ3MVIEPD6HE5Y7N6T5F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/462JYRJZ3MVIEPD6HE5Y7N6T5F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:462JYRJZ3MVIEPD6HE5Y7N6T5F","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":"14d226fe7ff824794f333bd258125329a947a3199c74813e766551abef84ca65","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T13:12:50Z","title_canon_sha256":"1c2c263ee2c20edae62fb725bcefc464fa9bd4dfe2e13618b7ff1e62484c022a"},"schema_version":"1.0","source":{"id":"2605.13487","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13487","created_at":"2026-05-18T02:44:41Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13487v1","created_at":"2026-05-18T02:44:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13487","created_at":"2026-05-18T02:44:41Z"},{"alias_kind":"pith_short_12","alias_value":"462JYRJZ3MVI","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"462JYRJZ3MVIEPD6","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"462JYRJZ","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:0eaf7646a68606b652df802bd06d7679660e61788d23b0aa89f421564368c96d","target":"graph","created_at":"2026-05-18T02:44:41Z","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":"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"},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"PiFM extends Flow Matching to multi-parameter settings by enforcing path-independent flows that approximate Wasserstein barycenters under suitable assumptions."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Path-independent Flow Matching learns vector fields whose flows produce transport that depends only on start and end distributions, not the path taken."}],"snapshot_sha256":"330a3bfe77ee1f06b6afa1e41e3924cb6c28180185aa7d72a6b4e0ab43c22321"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"babb500b11f4821fc6f495c497b56ff3bc8729327fb39a3de97258e84e2f3db8"},"paper":{"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","authors_text":"AmirHossein Zamani, Eugene Belilovsky, Francisco T\\'ellez, Guy Wolf, Philippe Martin, Shuang Ni, Sina Sanjari, Yanlei Zhang","cross_cats":[],"headline":"Path-independent Flow Matching learns vector fields whose flows produce transport that depends only on start and end distributions, not the path taken.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T13:12:50Z","title":"Path-independent Flow Matching for Multi-parameter Generative Dynamics"},"references":{"count":46,"internal_anchors":0,"resolved_work":46,"sample":[{"cited_arxiv_id":"","doi":"10.1051/m2an/2015020","is_internal_anchor":false,"ref_index":1,"title":"Multi-marginal optimal transport: theory and applications","work_id":"db877c57-449d-4409-84f6-9c3a46bcd651","year":2015},{"cited_arxiv_id":"","doi":"10.1007/s10851-022-01126-7","is_internal_anchor":false,"ref_index":2,"title":"Unbalanced Multi-marginal Optimal Transport , volume=","work_id":"bc8a7d7d-314b-472b-8c77-956e68e7a4e9","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Characterization of barycenters in the Wasserstein space by averaging optimal transport maps , author=. 2017 , eprint=","work_id":"740b80dc-ce40-4eea-8eaf-0360a97b0fd1","year":2017},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Marsden and Tudor Ratiu , title =","work_id":"c066eefc-d765-48e4-bbfb-c7c41ff5cbe6","year":1984},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Foundations of Differentiable Manifolds and Lie Groups , author=. 1983 , publisher=","work_id":"daae5ffb-2700-4320-aabb-c896e2a85d51","year":1983}],"snapshot_sha256":"1f2ae95f8fcf0748a9258baeb7cebe4456bac4ecb2eeb2bffb71fea08dc9d631"},"source":{"id":"2605.13487","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T20:32:19.267874Z","id":"c8ecc841-596f-46f4-a1e9-65dfbc2ff910","model_set":{"reader":"grok-4.3"},"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","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.","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","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."}},"verdict_id":"c8ecc841-596f-46f4-a1e9-65dfbc2ff910"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1a27b9533a8377bfa1f0740ec8f6f880f7764ee2e16691bf23a1eb1db5839504","target":"record","created_at":"2026-05-18T02:44:41Z","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":"14d226fe7ff824794f333bd258125329a947a3199c74813e766551abef84ca65","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T13:12:50Z","title_canon_sha256":"1c2c263ee2c20edae62fb725bcefc464fa9bd4dfe2e13618b7ff1e62484c022a"},"schema_version":"1.0","source":{"id":"2605.13487","kind":"arxiv","version":1}},"canonical_sha256":"e7b49c4539db2a823c7e393b8fb7d3e966d524ce0122b16eda4acaf5a28a59a5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e7b49c4539db2a823c7e393b8fb7d3e966d524ce0122b16eda4acaf5a28a59a5","first_computed_at":"2026-05-18T02:44:41.245186Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:41.245186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C0mbNjOLMhvpWjZ9MsvA94PSuVqBZGXKubsYr3Zd2emgG9OtWWvGhpTfvXQSvbghFiXw2HsH6D5n3l3pyGnNAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:41.245748Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13487","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a27b9533a8377bfa1f0740ec8f6f880f7764ee2e16691bf23a1eb1db5839504","sha256:0eaf7646a68606b652df802bd06d7679660e61788d23b0aa89f421564368c96d"],"state_sha256":"be7ee8da3a94814e5b754743249a989eec2e3a307c242cc4073379db4d3d7e44"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YrqY6wgQlmi5mlHNHA4QOQk3GAXKqVokiypdANyBQoQLya5Z7mZsGaxFQNE9aOco1HcVvyTfozFTHd8HZZLVCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T15:25:32.151834Z","bundle_sha256":"988c9837340a3b81f2ecfdf746483be6eca711a205b5614b6c3b0bdcd12db4b3"}}