{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:25PO54O3KJXRL6U5EYNLHUIY6W","short_pith_number":"pith:25PO54O3","schema_version":"1.0","canonical_sha256":"d75eeef1db526f15fa9d261ab3d118f5832dad4209b498a700e92539324372b6","source":{"kind":"arxiv","id":"2201.12220","version":3},"attestation_state":"computed","paper":{"title":"Neural Optimal Transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Alexander Korotin, Daniil Selikhanovych, Evgeny Burnaev","submitted_at":"2022-01-28T16:24:13Z","abstract_excerpt":"We present a novel neural-networks-based algorithm to compute optimal transport maps and plans for strong and weak transport costs. To justify the usage of neural networks, we prove that they are universal approximators of transport plans between probability distributions. We evaluate the performance of our optimal transport algorithm on toy examples and on the unpaired image-to-image translation."},"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":"2201.12220","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-01-28T16:24:13Z","cross_cats_sorted":[],"title_canon_sha256":"982b93b9d5ee9c929378ac0eed042208440d5e087667541972d3c1d84891e134","abstract_canon_sha256":"03410d82684176be887893d2f26b38c6e24508892d8a5a5c1808fcde40999625"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:47:01.964972Z","signature_b64":"Sud61fJxehP6xhpyMjcxkOkX3vNZqVYvcnQar98eOXcUg1BL1aRXVQtnCHqTGABAhH/jTm5Nl1a1Kru3aHoSBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d75eeef1db526f15fa9d261ab3d118f5832dad4209b498a700e92539324372b6","last_reissued_at":"2026-07-05T05:47:01.964471Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:47:01.964471Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Neural Optimal Transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Alexander Korotin, Daniil Selikhanovych, Evgeny Burnaev","submitted_at":"2022-01-28T16:24:13Z","abstract_excerpt":"We present a novel neural-networks-based algorithm to compute optimal transport maps and plans for strong and weak transport costs. To justify the usage of neural networks, we prove that they are universal approximators of transport plans between probability distributions. We evaluate the performance of our optimal transport algorithm on toy examples and on the unpaired image-to-image translation."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.12220","kind":"arxiv","version":3},"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/2201.12220/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":"2201.12220","created_at":"2026-07-05T05:47:01.964532+00:00"},{"alias_kind":"arxiv_version","alias_value":"2201.12220v3","created_at":"2026-07-05T05:47:01.964532+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.12220","created_at":"2026-07-05T05:47:01.964532+00:00"},{"alias_kind":"pith_short_12","alias_value":"25PO54O3KJXR","created_at":"2026-07-05T05:47:01.964532+00:00"},{"alias_kind":"pith_short_16","alias_value":"25PO54O3KJXRL6U5","created_at":"2026-07-05T05:47:01.964532+00:00"},{"alias_kind":"pith_short_8","alias_value":"25PO54O3","created_at":"2026-07-05T05:47:01.964532+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":8,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.03201","citing_title":"Reinforcement Learning from Cross-domain Videos with Video Prediction Model","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2606.30821","citing_title":"Mind the Residual Gap: Probabilistic Downscaling under Real-World Bias","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2605.05569","citing_title":"Stability of the Monge Map in Semi-Dual Optimal Transport","ref_index":77,"is_internal_anchor":false},{"citing_arxiv_id":"2209.14577","citing_title":"Rectified Flow: A Marginal Preserving Approach to Optimal Transport","ref_index":112,"is_internal_anchor":false},{"citing_arxiv_id":"2603.07119","citing_title":"TIQA: Human-Aligned Perceptual Text Quality Assessment in Generated Images","ref_index":31,"is_internal_anchor":false},{"citing_arxiv_id":"2605.05569","citing_title":"Stability of the Monge Map in Semi-Dual Optimal Transport","ref_index":77,"is_internal_anchor":false},{"citing_arxiv_id":"2605.05569","citing_title":"Stability of the Monge Map in Semi-Dual Optimal Transport","ref_index":77,"is_internal_anchor":false},{"citing_arxiv_id":"2209.03003","citing_title":"Flow Straight and Fast: Learning to Generate and Transfer Data with Rectified Flow","ref_index":35,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/25PO54O3KJXRL6U5EYNLHUIY6W","json":"https://pith.science/pith/25PO54O3KJXRL6U5EYNLHUIY6W.json","graph_json":"https://pith.science/api/pith-number/25PO54O3KJXRL6U5EYNLHUIY6W/graph.json","events_json":"https://pith.science/api/pith-number/25PO54O3KJXRL6U5EYNLHUIY6W/events.json","paper":"https://pith.science/paper/25PO54O3"},"agent_actions":{"view_html":"https://pith.science/pith/25PO54O3KJXRL6U5EYNLHUIY6W","download_json":"https://pith.science/pith/25PO54O3KJXRL6U5EYNLHUIY6W.json","view_paper":"https://pith.science/paper/25PO54O3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2201.12220&json=true","fetch_graph":"https://pith.science/api/pith-number/25PO54O3KJXRL6U5EYNLHUIY6W/graph.json","fetch_events":"https://pith.science/api/pith-number/25PO54O3KJXRL6U5EYNLHUIY6W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/25PO54O3KJXRL6U5EYNLHUIY6W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/25PO54O3KJXRL6U5EYNLHUIY6W/action/storage_attestation","attest_author":"https://pith.science/pith/25PO54O3KJXRL6U5EYNLHUIY6W/action/author_attestation","sign_citation":"https://pith.science/pith/25PO54O3KJXRL6U5EYNLHUIY6W/action/citation_signature","submit_replication":"https://pith.science/pith/25PO54O3KJXRL6U5EYNLHUIY6W/action/replication_record"}},"created_at":"2026-07-05T05:47:01.964532+00:00","updated_at":"2026-07-05T05:47:01.964532+00:00"}