{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:MSTR2345GIPTZ2Q5C27KCH34KO","short_pith_number":"pith:MSTR2345","schema_version":"1.0","canonical_sha256":"64a71d6f9d321f3cea1d16bea11f7c53895fe30c7656a0711af56b812503d447","source":{"kind":"arxiv","id":"1605.08527","version":1},"attestation_state":"computed","paper":{"title":"Stochastic Optimization for Large-scale Optimal Transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.NA"],"primary_cat":"math.OC","authors_text":"CEREMADE), Francis Bach (SIERRA, Gabriel Peyr\\'e (MOKAPLAN, Genevay Aude (MOKAPLAN, LIENS), Marco Cuturi","submitted_at":"2016-05-27T07:47:30Z","abstract_excerpt":"Optimal transport (OT) defines a powerful framework to compare probability distributions in a geometrically faithful way. However, the practical impact of OT is still limited because of its computational burden. We propose a new class of stochastic optimization algorithms to cope with large-scale problems routinely encountered in machine learning applications. These methods are able to manipulate arbitrary distributions (either discrete or continuous) by simply requiring to be able to draw samples from them, which is the typical setup in high-dimensional learning problems. This alleviates the "},"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":"1605.08527","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-27T07:47:30Z","cross_cats_sorted":["cs.LG","math.NA"],"title_canon_sha256":"2854e799378f041b54d91fd8557cd373c6cd649b0d8bff3bb71541bf2ad1923d","abstract_canon_sha256":"0d5952fc771e3c484878428224af26bae7381bdd6d987aa160a9499ec1cef7d4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:29.699934Z","signature_b64":"ZrvPFJZNX0RhXPvvJXtgh1dKxWbEtbkgwteB9MaThRUxaxtcyz/31qHWVj5TTrsgQPPBDYfViP/f1RN7R+4aBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64a71d6f9d321f3cea1d16bea11f7c53895fe30c7656a0711af56b812503d447","last_reissued_at":"2026-05-18T01:13:29.699252Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:29.699252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stochastic Optimization for Large-scale Optimal Transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.NA"],"primary_cat":"math.OC","authors_text":"CEREMADE), Francis Bach (SIERRA, Gabriel Peyr\\'e (MOKAPLAN, Genevay Aude (MOKAPLAN, LIENS), Marco Cuturi","submitted_at":"2016-05-27T07:47:30Z","abstract_excerpt":"Optimal transport (OT) defines a powerful framework to compare probability distributions in a geometrically faithful way. However, the practical impact of OT is still limited because of its computational burden. We propose a new class of stochastic optimization algorithms to cope with large-scale problems routinely encountered in machine learning applications. These methods are able to manipulate arbitrary distributions (either discrete or continuous) by simply requiring to be able to draw samples from them, which is the typical setup in high-dimensional learning problems. This alleviates the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.08527","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":""},"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":"1605.08527","created_at":"2026-05-18T01:13:29.699374+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.08527v1","created_at":"2026-05-18T01:13:29.699374+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.08527","created_at":"2026-05-18T01:13:29.699374+00:00"},{"alias_kind":"pith_short_12","alias_value":"MSTR2345GIPT","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"MSTR2345GIPTZ2Q5","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"MSTR2345","created_at":"2026-05-18T12:30:32.724797+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/MSTR2345GIPTZ2Q5C27KCH34KO","json":"https://pith.science/pith/MSTR2345GIPTZ2Q5C27KCH34KO.json","graph_json":"https://pith.science/api/pith-number/MSTR2345GIPTZ2Q5C27KCH34KO/graph.json","events_json":"https://pith.science/api/pith-number/MSTR2345GIPTZ2Q5C27KCH34KO/events.json","paper":"https://pith.science/paper/MSTR2345"},"agent_actions":{"view_html":"https://pith.science/pith/MSTR2345GIPTZ2Q5C27KCH34KO","download_json":"https://pith.science/pith/MSTR2345GIPTZ2Q5C27KCH34KO.json","view_paper":"https://pith.science/paper/MSTR2345","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.08527&json=true","fetch_graph":"https://pith.science/api/pith-number/MSTR2345GIPTZ2Q5C27KCH34KO/graph.json","fetch_events":"https://pith.science/api/pith-number/MSTR2345GIPTZ2Q5C27KCH34KO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MSTR2345GIPTZ2Q5C27KCH34KO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MSTR2345GIPTZ2Q5C27KCH34KO/action/storage_attestation","attest_author":"https://pith.science/pith/MSTR2345GIPTZ2Q5C27KCH34KO/action/author_attestation","sign_citation":"https://pith.science/pith/MSTR2345GIPTZ2Q5C27KCH34KO/action/citation_signature","submit_replication":"https://pith.science/pith/MSTR2345GIPTZ2Q5C27KCH34KO/action/replication_record"}},"created_at":"2026-05-18T01:13:29.699374+00:00","updated_at":"2026-05-18T01:13:29.699374+00:00"}