{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:CCPG7GIG3XIXCCSCFNH2WYYFFO","short_pith_number":"pith:CCPG7GIG","schema_version":"1.0","canonical_sha256":"109e6f9906ddd1710a422b4fab63052b96fc88cc4a79b1bdd25f9c2f14f4a0d4","source":{"kind":"arxiv","id":"2505.23346","version":1},"attestation_state":"computed","paper":{"title":"Beyond Optimal Transport: Model-Aligned Coupling for Flow Matching","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Tongliang Liu, Yexiong Lin, Yu Yao","submitted_at":"2025-05-29T11:10:41Z","abstract_excerpt":"Flow Matching (FM) is an effective framework for training a model to learn a vector field that transports samples from a source distribution to a target distribution. To train the model, early FM methods use random couplings, which often result in crossing paths and lead the model to learn non-straight trajectories that require many integration steps to generate high-quality samples. To address this, recent methods adopt Optimal Transport (OT) to construct couplings by minimizing geometric distances, which helps reduce path crossings. However, we observe that such geometry-based couplings do n"},"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":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2505.23346","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2025-05-29T11:10:41Z","cross_cats_sorted":[],"title_canon_sha256":"86e04309be96ac05ae89b20aabc5189ff4150e1a9cdc8e1cef038833554614ae","abstract_canon_sha256":"db24781b1c5fc8b4ebfaa1abe7a6bcb7e7b4b46a018ae17bc2c273449c2b8e89"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:11:59.978009Z","signature_b64":"QwyESu0ttBXtXHMeccMvmHPIGaQ3yoIvkR8G1QUVbTMuQSTBpWZrJ9iVGuh+KBdQc1yKmxWEbCxUS/FKPt6ODQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"109e6f9906ddd1710a422b4fab63052b96fc88cc4a79b1bdd25f9c2f14f4a0d4","last_reissued_at":"2026-07-05T11:11:59.977480Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:11:59.977480Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Beyond Optimal Transport: Model-Aligned Coupling for Flow Matching","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Tongliang Liu, Yexiong Lin, Yu Yao","submitted_at":"2025-05-29T11:10:41Z","abstract_excerpt":"Flow Matching (FM) is an effective framework for training a model to learn a vector field that transports samples from a source distribution to a target distribution. To train the model, early FM methods use random couplings, which often result in crossing paths and lead the model to learn non-straight trajectories that require many integration steps to generate high-quality samples. To address this, recent methods adopt Optimal Transport (OT) to construct couplings by minimizing geometric distances, which helps reduce path crossings. However, we observe that such geometry-based couplings do n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.23346","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.23346/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2505.23346","created_at":"2026-07-05T11:11:59.977537+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.23346v1","created_at":"2026-07-05T11:11:59.977537+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.23346","created_at":"2026-07-05T11:11:59.977537+00:00"},{"alias_kind":"pith_short_12","alias_value":"CCPG7GIG3XIX","created_at":"2026-07-05T11:11:59.977537+00:00"},{"alias_kind":"pith_short_16","alias_value":"CCPG7GIG3XIXCCSC","created_at":"2026-07-05T11:11:59.977537+00:00"},{"alias_kind":"pith_short_8","alias_value":"CCPG7GIG","created_at":"2026-07-05T11:11:59.977537+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.04092","citing_title":"Optimal Transport Flow Matching by Design","ref_index":36,"is_internal_anchor":false},{"citing_arxiv_id":"2604.12273","citing_title":"SubFlow: Sub-mode Conditioned Flow Matching for Diverse One-Step Generation","ref_index":27,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CCPG7GIG3XIXCCSCFNH2WYYFFO","json":"https://pith.science/pith/CCPG7GIG3XIXCCSCFNH2WYYFFO.json","graph_json":"https://pith.science/api/pith-number/CCPG7GIG3XIXCCSCFNH2WYYFFO/graph.json","events_json":"https://pith.science/api/pith-number/CCPG7GIG3XIXCCSCFNH2WYYFFO/events.json","paper":"https://pith.science/paper/CCPG7GIG"},"agent_actions":{"view_html":"https://pith.science/pith/CCPG7GIG3XIXCCSCFNH2WYYFFO","download_json":"https://pith.science/pith/CCPG7GIG3XIXCCSCFNH2WYYFFO.json","view_paper":"https://pith.science/paper/CCPG7GIG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.23346&json=true","fetch_graph":"https://pith.science/api/pith-number/CCPG7GIG3XIXCCSCFNH2WYYFFO/graph.json","fetch_events":"https://pith.science/api/pith-number/CCPG7GIG3XIXCCSCFNH2WYYFFO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CCPG7GIG3XIXCCSCFNH2WYYFFO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CCPG7GIG3XIXCCSCFNH2WYYFFO/action/storage_attestation","attest_author":"https://pith.science/pith/CCPG7GIG3XIXCCSCFNH2WYYFFO/action/author_attestation","sign_citation":"https://pith.science/pith/CCPG7GIG3XIXCCSCFNH2WYYFFO/action/citation_signature","submit_replication":"https://pith.science/pith/CCPG7GIG3XIXCCSCFNH2WYYFFO/action/replication_record"}},"created_at":"2026-07-05T11:11:59.977537+00:00","updated_at":"2026-07-05T11:11:59.977537+00:00"}