{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:3DI3KW2OZD3QCZYG6WZPYBX7LR","short_pith_number":"pith:3DI3KW2O","schema_version":"1.0","canonical_sha256":"d8d1b55b4ec8f7016706f5b2fc06ff5c521daafc6dcf91cc9b8769a0328fbc0c","source":{"kind":"arxiv","id":"1905.00158","version":3},"attestation_state":"computed","paper":{"title":"On Scalable and Efficient Computation of Large Scale Optimal Transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Haoming Jiang, Hongyuan Zha, Minshuo Chen, Tuo Zhao, Yujia Xie","submitted_at":"2019-05-01T01:32:52Z","abstract_excerpt":"Optimal Transport (OT) naturally arises in many machine learning applications, yet the heavy computational burden limits its wide-spread uses. To address the scalability issue, we propose an implicit generative learning-based framework called SPOT (Scalable Push-forward of Optimal Transport). Specifically, we approximate the optimal transport plan by a pushforward of a reference distribution, and cast the optimal transport problem into a minimax problem. We then can solve OT problems efficiently using primal dual stochastic gradient-type algorithms. We also show that we can recover the density"},"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":"1905.00158","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-01T01:32:52Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"536942e1666f4e6cddaf4240a25b93df7b7c96fcbc7c5307c195ae59e87d365d","abstract_canon_sha256":"74ad0db1df1b14f8747c2f668457b610019d7add7af664a695338b254b345193"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:32.311388Z","signature_b64":"KVfxbXoRGNO0JKuzHlsxd5jtJ0xmaRPhk9CH9fbdOFfQIg533/5F3eyKMpVKHYeyqJsQyLWXTtYzgpiv/SLfCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8d1b55b4ec8f7016706f5b2fc06ff5c521daafc6dcf91cc9b8769a0328fbc0c","last_reissued_at":"2026-05-17T23:42:32.310712Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:32.310712Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Scalable and Efficient Computation of Large Scale Optimal Transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Haoming Jiang, Hongyuan Zha, Minshuo Chen, Tuo Zhao, Yujia Xie","submitted_at":"2019-05-01T01:32:52Z","abstract_excerpt":"Optimal Transport (OT) naturally arises in many machine learning applications, yet the heavy computational burden limits its wide-spread uses. To address the scalability issue, we propose an implicit generative learning-based framework called SPOT (Scalable Push-forward of Optimal Transport). Specifically, we approximate the optimal transport plan by a pushforward of a reference distribution, and cast the optimal transport problem into a minimax problem. We then can solve OT problems efficiently using primal dual stochastic gradient-type algorithms. We also show that we can recover the density"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.00158","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":""},"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":"1905.00158","created_at":"2026-05-17T23:42:32.310806+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.00158v3","created_at":"2026-05-17T23:42:32.310806+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.00158","created_at":"2026-05-17T23:42:32.310806+00:00"},{"alias_kind":"pith_short_12","alias_value":"3DI3KW2OZD3Q","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"3DI3KW2OZD3QCZYG","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"3DI3KW2O","created_at":"2026-05-18T12:33:07.085635+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3DI3KW2OZD3QCZYG6WZPYBX7LR","json":"https://pith.science/pith/3DI3KW2OZD3QCZYG6WZPYBX7LR.json","graph_json":"https://pith.science/api/pith-number/3DI3KW2OZD3QCZYG6WZPYBX7LR/graph.json","events_json":"https://pith.science/api/pith-number/3DI3KW2OZD3QCZYG6WZPYBX7LR/events.json","paper":"https://pith.science/paper/3DI3KW2O"},"agent_actions":{"view_html":"https://pith.science/pith/3DI3KW2OZD3QCZYG6WZPYBX7LR","download_json":"https://pith.science/pith/3DI3KW2OZD3QCZYG6WZPYBX7LR.json","view_paper":"https://pith.science/paper/3DI3KW2O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.00158&json=true","fetch_graph":"https://pith.science/api/pith-number/3DI3KW2OZD3QCZYG6WZPYBX7LR/graph.json","fetch_events":"https://pith.science/api/pith-number/3DI3KW2OZD3QCZYG6WZPYBX7LR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3DI3KW2OZD3QCZYG6WZPYBX7LR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3DI3KW2OZD3QCZYG6WZPYBX7LR/action/storage_attestation","attest_author":"https://pith.science/pith/3DI3KW2OZD3QCZYG6WZPYBX7LR/action/author_attestation","sign_citation":"https://pith.science/pith/3DI3KW2OZD3QCZYG6WZPYBX7LR/action/citation_signature","submit_replication":"https://pith.science/pith/3DI3KW2OZD3QCZYG6WZPYBX7LR/action/replication_record"}},"created_at":"2026-05-17T23:42:32.310806+00:00","updated_at":"2026-05-17T23:42:32.310806+00:00"}