{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:VBG3NLOSIBCU4JHPJGWY4SQR6K","short_pith_number":"pith:VBG3NLOS","schema_version":"1.0","canonical_sha256":"a84db6add240454e24ef49ad8e4a11f2b290bb9f24fb0c7b74f8d6f8a5aaca6c","source":{"kind":"arxiv","id":"2201.12324","version":1},"attestation_state":"computed","paper":{"title":"Optimal Transport Tools (OTT): A JAX Toolbox for all things Wasserstein","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Charlotte Bunne, Geoff Davis, Laetitia Meng-Papaxanthos, Marco Cuturi, Olivier Teboul, Yingtao Tian","submitted_at":"2022-01-28T18:43:41Z","abstract_excerpt":"Optimal transport tools (OTT-JAX) is a Python toolbox that can solve optimal transport problems between point clouds and histograms. The toolbox builds on various JAX features, such as automatic and custom reverse mode differentiation, vectorization, just-in-time compilation and accelerators support. The toolbox covers elementary computations, such as the resolution of the regularized OT problem, and more advanced extensions, such as barycenters, Gromov-Wasserstein, low-rank solvers, estimation of convex maps, differentiable generalizations of quantiles and ranks, and approximate OT between Ga"},"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.12324","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-01-28T18:43:41Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"fed1edf121b22e4c49024cd841be194e25351fd6dcc1c6a41020576dd5e37878","abstract_canon_sha256":"7412133c04265d8ecaf086e7e7aab9fbe5cae3c2f8140b6734a147f34c22e3fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:52:22.087132Z","signature_b64":"I8oxOCn0jCwoCIOmaDebXJ0jbIRP3d7htiXQ/2WquMctTmcX3n5Qg5JZeN2FH0Jor+uXkWBQWHQR5gATjjjfAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a84db6add240454e24ef49ad8e4a11f2b290bb9f24fb0c7b74f8d6f8a5aaca6c","last_reissued_at":"2026-07-05T03:52:22.086721Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:52:22.086721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Transport Tools (OTT): A JAX Toolbox for all things Wasserstein","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Charlotte Bunne, Geoff Davis, Laetitia Meng-Papaxanthos, Marco Cuturi, Olivier Teboul, Yingtao Tian","submitted_at":"2022-01-28T18:43:41Z","abstract_excerpt":"Optimal transport tools (OTT-JAX) is a Python toolbox that can solve optimal transport problems between point clouds and histograms. The toolbox builds on various JAX features, such as automatic and custom reverse mode differentiation, vectorization, just-in-time compilation and accelerators support. The toolbox covers elementary computations, such as the resolution of the regularized OT problem, and more advanced extensions, such as barycenters, Gromov-Wasserstein, low-rank solvers, estimation of convex maps, differentiable generalizations of quantiles and ranks, and approximate OT between Ga"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.12324","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/2201.12324/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.12324","created_at":"2026-07-05T03:52:22.086778+00:00"},{"alias_kind":"arxiv_version","alias_value":"2201.12324v1","created_at":"2026-07-05T03:52:22.086778+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.12324","created_at":"2026-07-05T03:52:22.086778+00:00"},{"alias_kind":"pith_short_12","alias_value":"VBG3NLOSIBCU","created_at":"2026-07-05T03:52:22.086778+00:00"},{"alias_kind":"pith_short_16","alias_value":"VBG3NLOSIBCU4JHP","created_at":"2026-07-05T03:52:22.086778+00:00"},{"alias_kind":"pith_short_8","alias_value":"VBG3NLOS","created_at":"2026-07-05T03:52:22.086778+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":11,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.04683","citing_title":"Minimax Private Estimation of Smooth Optimal-Transport Maps","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2607.00665","citing_title":"Effective dynamics of the Sinkhorn algorithm in the regime of low entropy regularization","ref_index":114,"is_internal_anchor":false},{"citing_arxiv_id":"2606.02515","citing_title":"A Biconvex Formulation for Stable Transport of Mixture Models with a Unique Solution","ref_index":43,"is_internal_anchor":false},{"citing_arxiv_id":"2606.28973","citing_title":"Sharp $O(1/k)$ convergence rate for the Sinkhorn algorithm via a local analysis","ref_index":115,"is_internal_anchor":false},{"citing_arxiv_id":"2605.27499","citing_title":"GenSBI: Generative Methods for Simulation-Based Inference in JAX","ref_index":84,"is_internal_anchor":false},{"citing_arxiv_id":"2605.28134","citing_title":"Convergence of empirical subgradients for optimal transport-based objectives","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2602.03067","citing_title":"FlashSinkhorn: IO-Aware Entropic Optimal Transport on GPU","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2505.24384","citing_title":"Provably convergent stochastic fixed-point algorithm for free-support Wasserstein barycenter of continuous non-parametric measures","ref_index":29,"is_internal_anchor":false},{"citing_arxiv_id":"2603.25182","citing_title":"Learning Monge maps with constrained drifting models","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2604.26942","citing_title":"Hyper Input Convex Neural Networks for Shape Constrained Learning and Optimal Transport","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08793","citing_title":"cuRegOT: A GPU-Accelerated Solver for Entropic-Regularized Optimal Transport","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VBG3NLOSIBCU4JHPJGWY4SQR6K","json":"https://pith.science/pith/VBG3NLOSIBCU4JHPJGWY4SQR6K.json","graph_json":"https://pith.science/api/pith-number/VBG3NLOSIBCU4JHPJGWY4SQR6K/graph.json","events_json":"https://pith.science/api/pith-number/VBG3NLOSIBCU4JHPJGWY4SQR6K/events.json","paper":"https://pith.science/paper/VBG3NLOS"},"agent_actions":{"view_html":"https://pith.science/pith/VBG3NLOSIBCU4JHPJGWY4SQR6K","download_json":"https://pith.science/pith/VBG3NLOSIBCU4JHPJGWY4SQR6K.json","view_paper":"https://pith.science/paper/VBG3NLOS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2201.12324&json=true","fetch_graph":"https://pith.science/api/pith-number/VBG3NLOSIBCU4JHPJGWY4SQR6K/graph.json","fetch_events":"https://pith.science/api/pith-number/VBG3NLOSIBCU4JHPJGWY4SQR6K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VBG3NLOSIBCU4JHPJGWY4SQR6K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VBG3NLOSIBCU4JHPJGWY4SQR6K/action/storage_attestation","attest_author":"https://pith.science/pith/VBG3NLOSIBCU4JHPJGWY4SQR6K/action/author_attestation","sign_citation":"https://pith.science/pith/VBG3NLOSIBCU4JHPJGWY4SQR6K/action/citation_signature","submit_replication":"https://pith.science/pith/VBG3NLOSIBCU4JHPJGWY4SQR6K/action/replication_record"}},"created_at":"2026-07-05T03:52:22.086778+00:00","updated_at":"2026-07-05T03:52:22.086778+00:00"}