{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:34R2TEILYTUYU37DKWIFODTQG6","short_pith_number":"pith:34R2TEIL","canonical_record":{"source":{"id":"2606.04092","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2026-06-02T18:00:05Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"68013da2d781328bf8af5ec2c6dd161645a76a053ba1a64b28daa11cc2c75b6e","abstract_canon_sha256":"ef2c5766d82e39a0cc94e44f4abe64ba3e003dcdf8f7531a86892bd459cbde27"},"schema_version":"1.0"},"canonical_sha256":"df23a9910bc4e98a6fe35590570e7037b9c4cb28394ef3096f077da6c9f1c8e6","source":{"kind":"arxiv","id":"2606.04092","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.04092","created_at":"2026-06-04T00:06:46Z"},{"alias_kind":"arxiv_version","alias_value":"2606.04092v1","created_at":"2026-06-04T00:06:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.04092","created_at":"2026-06-04T00:06:46Z"},{"alias_kind":"pith_short_12","alias_value":"34R2TEILYTUY","created_at":"2026-06-04T00:06:46Z"},{"alias_kind":"pith_short_16","alias_value":"34R2TEILYTUYU37D","created_at":"2026-06-04T00:06:46Z"},{"alias_kind":"pith_short_8","alias_value":"34R2TEIL","created_at":"2026-06-04T00:06:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:34R2TEILYTUYU37DKWIFODTQG6","target":"record","payload":{"canonical_record":{"source":{"id":"2606.04092","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2026-06-02T18:00:05Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"68013da2d781328bf8af5ec2c6dd161645a76a053ba1a64b28daa11cc2c75b6e","abstract_canon_sha256":"ef2c5766d82e39a0cc94e44f4abe64ba3e003dcdf8f7531a86892bd459cbde27"},"schema_version":"1.0"},"canonical_sha256":"df23a9910bc4e98a6fe35590570e7037b9c4cb28394ef3096f077da6c9f1c8e6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T00:06:46.385269Z","signature_b64":"j43E3EAXnCyYbE6fNN9g2zXhCi+W2VrucGqQ1yqoNIlYHr0xm9f84J0X//WOeOSHmOj4D5KHdgznghfD6oHPDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df23a9910bc4e98a6fe35590570e7037b9c4cb28394ef3096f077da6c9f1c8e6","last_reissued_at":"2026-06-04T00:06:46.384923Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T00:06:46.384923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.04092","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-06-04T00:06:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YWpSevB07YBxaYiXQa01PtzsidSIeFS9BPkP0QHc7EhWjCN1nZiBTllitCkWRbwsgaPyQEzOTWvUo2bZxTXICA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:54:15.185289Z"},"content_sha256":"5bb67988d0701489b097047ac4399b3b66f07702929212812d2bf1b2c1b70b96","schema_version":"1.0","event_id":"sha256:5bb67988d0701489b097047ac4399b3b66f07702929212812d2bf1b2c1b70b96"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:34R2TEILYTUYU37DKWIFODTQG6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Transport Flow Matching by Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Matan Rusanovsky, Ohad Fried, Shai Avidan, Shimon Malnick","submitted_at":"2026-06-02T18:00:05Z","abstract_excerpt":"Flow matching models learn to transport samples from a simple prior distribution to a complex data distribution. When prior-data pairs are coupled via optimal transport (OT), the learned trajectories are straight and non-crossing, enabling fast, even single-step, generation. However, computing the OT coupling in high dimensions is intractable, and existing methods attempt to solve the OT problem, at the cost of persistent bias or significant overhead. Rather than solving for the OT coupling, we reformulate the problem. Once the prior is treated as a design choice rather than a fixed input, the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.04092","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/2606.04092/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-04T00:06:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qcb0XkhT+Fl1MVHxnuweZt+4uzg0zthYUZdC/gL2ExvSgEud+O3IXxUbgBaUSBRILklstgrirItGLMoWKbjQBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:54:15.185696Z"},"content_sha256":"4b1492d7a8876f093b2df9ecf99c9c8bf4fa88e7681607102dc66c5c33c4bba7","schema_version":"1.0","event_id":"sha256:4b1492d7a8876f093b2df9ecf99c9c8bf4fa88e7681607102dc66c5c33c4bba7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/34R2TEILYTUYU37DKWIFODTQG6/bundle.json","state_url":"https://pith.science/pith/34R2TEILYTUYU37DKWIFODTQG6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/34R2TEILYTUYU37DKWIFODTQG6/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-06-09T14:54:15Z","links":{"resolver":"https://pith.science/pith/34R2TEILYTUYU37DKWIFODTQG6","bundle":"https://pith.science/pith/34R2TEILYTUYU37DKWIFODTQG6/bundle.json","state":"https://pith.science/pith/34R2TEILYTUYU37DKWIFODTQG6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/34R2TEILYTUYU37DKWIFODTQG6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:34R2TEILYTUYU37DKWIFODTQG6","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":"ef2c5766d82e39a0cc94e44f4abe64ba3e003dcdf8f7531a86892bd459cbde27","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2026-06-02T18:00:05Z","title_canon_sha256":"68013da2d781328bf8af5ec2c6dd161645a76a053ba1a64b28daa11cc2c75b6e"},"schema_version":"1.0","source":{"id":"2606.04092","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.04092","created_at":"2026-06-04T00:06:46Z"},{"alias_kind":"arxiv_version","alias_value":"2606.04092v1","created_at":"2026-06-04T00:06:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.04092","created_at":"2026-06-04T00:06:46Z"},{"alias_kind":"pith_short_12","alias_value":"34R2TEILYTUY","created_at":"2026-06-04T00:06:46Z"},{"alias_kind":"pith_short_16","alias_value":"34R2TEILYTUYU37D","created_at":"2026-06-04T00:06:46Z"},{"alias_kind":"pith_short_8","alias_value":"34R2TEIL","created_at":"2026-06-04T00:06:46Z"}],"graph_snapshots":[{"event_id":"sha256:4b1492d7a8876f093b2df9ecf99c9c8bf4fa88e7681607102dc66c5c33c4bba7","target":"graph","created_at":"2026-06-04T00:06:46Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.04092/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Flow matching models learn to transport samples from a simple prior distribution to a complex data distribution. When prior-data pairs are coupled via optimal transport (OT), the learned trajectories are straight and non-crossing, enabling fast, even single-step, generation. However, computing the OT coupling in high dimensions is intractable, and existing methods attempt to solve the OT problem, at the cost of persistent bias or significant overhead. Rather than solving for the OT coupling, we reformulate the problem. Once the prior is treated as a design choice rather than a fixed input, the","authors_text":"Matan Rusanovsky, Ohad Fried, Shai Avidan, Shimon Malnick","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2026-06-02T18:00:05Z","title":"Optimal Transport Flow Matching by Design"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.04092","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5bb67988d0701489b097047ac4399b3b66f07702929212812d2bf1b2c1b70b96","target":"record","created_at":"2026-06-04T00:06:46Z","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":"ef2c5766d82e39a0cc94e44f4abe64ba3e003dcdf8f7531a86892bd459cbde27","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2026-06-02T18:00:05Z","title_canon_sha256":"68013da2d781328bf8af5ec2c6dd161645a76a053ba1a64b28daa11cc2c75b6e"},"schema_version":"1.0","source":{"id":"2606.04092","kind":"arxiv","version":1}},"canonical_sha256":"df23a9910bc4e98a6fe35590570e7037b9c4cb28394ef3096f077da6c9f1c8e6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"df23a9910bc4e98a6fe35590570e7037b9c4cb28394ef3096f077da6c9f1c8e6","first_computed_at":"2026-06-04T00:06:46.384923Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-04T00:06:46.384923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j43E3EAXnCyYbE6fNN9g2zXhCi+W2VrucGqQ1yqoNIlYHr0xm9f84J0X//WOeOSHmOj4D5KHdgznghfD6oHPDw==","signature_status":"signed_v1","signed_at":"2026-06-04T00:06:46.385269Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.04092","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5bb67988d0701489b097047ac4399b3b66f07702929212812d2bf1b2c1b70b96","sha256:4b1492d7a8876f093b2df9ecf99c9c8bf4fa88e7681607102dc66c5c33c4bba7"],"state_sha256":"c824c9af04317e94a8e7cc4291dea73d366ace699dc6440395ad2b338c789f23"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tp6vciqvbjQB+j34JIv2fG5UF3aRTsNmpJgLmTuXg6KPfOuwTTlsTCyCThWDmlQveaK8E+bNGl0pIpoqzp22Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T14:54:15.187903Z","bundle_sha256":"a037b196128fae4263fd408cf07febf129da6d0a88ec4388edb3efc382884249"}}