{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:CKCILCHBKYNTIV7RH5XWI33WJL","short_pith_number":"pith:CKCILCHB","schema_version":"1.0","canonical_sha256":"12848588e1561b3457f13f6f646f764ac22a3cc3c9f5ad2c9d4ef1d2eaf81772","source":{"kind":"arxiv","id":"2101.05380","version":4},"attestation_state":"computed","paper":{"title":"A Dimension-free Computational Upper-bound for Smooth Optimal Transport Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.TH"],"primary_cat":"math.ST","authors_text":"Adrien Vacher, Alessandro Rudi, Boris Muzellec, Francis Bach, Francois-Xavier Vialard","submitted_at":"2021-01-13T22:56:46Z","abstract_excerpt":"It is well-known that plug-in statistical estimation of optimal transport suffers from the curse of dimensionality. Despite recent efforts to improve the rate of estimation with the smoothness of the problem, the computational complexity of these recently proposed methods still degrades exponentially with the dimension. In this paper, thanks to an infinite-dimensional sum-of-squares representation, we derive a statistical estimator of smooth optimal transport which achieves a precision $\\varepsilon$ from $\\tilde{O}(\\varepsilon^{-2})$ independent and identically distributed samples from the dis"},"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":"2101.05380","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2021-01-13T22:56:46Z","cross_cats_sorted":["math.OC","stat.TH"],"title_canon_sha256":"bbd72734ec30eb0274ff1f28b6b796201301b280dbe8f65163cf42797779a9d1","abstract_canon_sha256":"cc6ab9a1090cf528ec64035d611f0d591208b75607ac036d653269182dce668c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:19:04.348024Z","signature_b64":"RIAm9Mdf1LpS4He5bnBAFcKmfvnl0Kpnt0XeI0jgkkf6HZL7cCJfceBaQ/Dl4QBygQCSu0V0Gr9krKAoLI/CCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12848588e1561b3457f13f6f646f764ac22a3cc3c9f5ad2c9d4ef1d2eaf81772","last_reissued_at":"2026-07-05T03:19:04.347583Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:19:04.347583Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Dimension-free Computational Upper-bound for Smooth Optimal Transport Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.TH"],"primary_cat":"math.ST","authors_text":"Adrien Vacher, Alessandro Rudi, Boris Muzellec, Francis Bach, Francois-Xavier Vialard","submitted_at":"2021-01-13T22:56:46Z","abstract_excerpt":"It is well-known that plug-in statistical estimation of optimal transport suffers from the curse of dimensionality. Despite recent efforts to improve the rate of estimation with the smoothness of the problem, the computational complexity of these recently proposed methods still degrades exponentially with the dimension. In this paper, thanks to an infinite-dimensional sum-of-squares representation, we derive a statistical estimator of smooth optimal transport which achieves a precision $\\varepsilon$ from $\\tilde{O}(\\varepsilon^{-2})$ independent and identically distributed samples from the dis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.05380","kind":"arxiv","version":4},"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/2101.05380/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":"2101.05380","created_at":"2026-07-05T03:19:04.347646+00:00"},{"alias_kind":"arxiv_version","alias_value":"2101.05380v4","created_at":"2026-07-05T03:19:04.347646+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.05380","created_at":"2026-07-05T03:19:04.347646+00:00"},{"alias_kind":"pith_short_12","alias_value":"CKCILCHBKYNT","created_at":"2026-07-05T03:19:04.347646+00:00"},{"alias_kind":"pith_short_16","alias_value":"CKCILCHBKYNTIV7R","created_at":"2026-07-05T03:19:04.347646+00:00"},{"alias_kind":"pith_short_8","alias_value":"CKCILCHB","created_at":"2026-07-05T03:19:04.347646+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/CKCILCHBKYNTIV7RH5XWI33WJL","json":"https://pith.science/pith/CKCILCHBKYNTIV7RH5XWI33WJL.json","graph_json":"https://pith.science/api/pith-number/CKCILCHBKYNTIV7RH5XWI33WJL/graph.json","events_json":"https://pith.science/api/pith-number/CKCILCHBKYNTIV7RH5XWI33WJL/events.json","paper":"https://pith.science/paper/CKCILCHB"},"agent_actions":{"view_html":"https://pith.science/pith/CKCILCHBKYNTIV7RH5XWI33WJL","download_json":"https://pith.science/pith/CKCILCHBKYNTIV7RH5XWI33WJL.json","view_paper":"https://pith.science/paper/CKCILCHB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2101.05380&json=true","fetch_graph":"https://pith.science/api/pith-number/CKCILCHBKYNTIV7RH5XWI33WJL/graph.json","fetch_events":"https://pith.science/api/pith-number/CKCILCHBKYNTIV7RH5XWI33WJL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CKCILCHBKYNTIV7RH5XWI33WJL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CKCILCHBKYNTIV7RH5XWI33WJL/action/storage_attestation","attest_author":"https://pith.science/pith/CKCILCHBKYNTIV7RH5XWI33WJL/action/author_attestation","sign_citation":"https://pith.science/pith/CKCILCHBKYNTIV7RH5XWI33WJL/action/citation_signature","submit_replication":"https://pith.science/pith/CKCILCHBKYNTIV7RH5XWI33WJL/action/replication_record"}},"created_at":"2026-07-05T03:19:04.347646+00:00","updated_at":"2026-07-05T03:19:04.347646+00:00"}