{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:OYX4MHOCBXXJNEATIVAQJDX3EG","short_pith_number":"pith:OYX4MHOC","schema_version":"1.0","canonical_sha256":"762fc61dc20dee9690134541048efb21a9eddb08b9d59a76b9feab548db5f386","source":{"kind":"arxiv","id":"2206.13472","version":1},"attestation_state":"computed","paper":{"title":"On the sample complexity of entropic optimal transport","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Austin J. Stromme, Philippe Rigollet","submitted_at":"2022-06-27T17:25:47Z","abstract_excerpt":"We study the sample complexity of entropic optimal transport in high dimensions using computationally efficient plug-in estimators. We significantly advance the state of the art by establishing dimension-free, parametric rates for estimating various quantities of interest, including the entropic regression function which is a natural analog to the optimal transport map. As an application, we propose a practical model for transfer learning based on entropic optimal transport and establish parametric rates of convergence for nonparametric regression and classification."},"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":"2206.13472","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2022-06-27T17:25:47Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"ee9a5452d38081fdf8b2d7fa669902ebcd0abc0cdade94843370d2c94ec93371","abstract_canon_sha256":"51653b41ba57e06b20eadaec795c120b0d3e2fab290169439239b80c0d342f2a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:35:07.144033Z","signature_b64":"lRj4MIYFLEKJq82VIKPsqMehpLAjKLA/vwfqiEynZy+/l0ORU+yIWhLLf7i5kPBczr3+YkudwohMVxT52LQIBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"762fc61dc20dee9690134541048efb21a9eddb08b9d59a76b9feab548db5f386","last_reissued_at":"2026-07-05T04:35:07.143582Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:35:07.143582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the sample complexity of entropic optimal transport","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Austin J. Stromme, Philippe Rigollet","submitted_at":"2022-06-27T17:25:47Z","abstract_excerpt":"We study the sample complexity of entropic optimal transport in high dimensions using computationally efficient plug-in estimators. We significantly advance the state of the art by establishing dimension-free, parametric rates for estimating various quantities of interest, including the entropic regression function which is a natural analog to the optimal transport map. As an application, we propose a practical model for transfer learning based on entropic optimal transport and establish parametric rates of convergence for nonparametric regression and classification."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.13472","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/2206.13472/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":"2206.13472","created_at":"2026-07-05T04:35:07.143639+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.13472v1","created_at":"2026-07-05T04:35:07.143639+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.13472","created_at":"2026-07-05T04:35:07.143639+00:00"},{"alias_kind":"pith_short_12","alias_value":"OYX4MHOCBXXJ","created_at":"2026-07-05T04:35:07.143639+00:00"},{"alias_kind":"pith_short_16","alias_value":"OYX4MHOCBXXJNEAT","created_at":"2026-07-05T04:35:07.143639+00:00"},{"alias_kind":"pith_short_8","alias_value":"OYX4MHOC","created_at":"2026-07-05T04:35:07.143639+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.24987","citing_title":"Sample complexity of unbalanced entropic OT","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2412.12007","citing_title":"The entropic optimal (self-)transport problem: Limit distributions for decreasing regularization with application to score function estimation","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2604.22670","citing_title":"Curvature of optimal transport with respect to the cost and applications to inverse optimal transport","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OYX4MHOCBXXJNEATIVAQJDX3EG","json":"https://pith.science/pith/OYX4MHOCBXXJNEATIVAQJDX3EG.json","graph_json":"https://pith.science/api/pith-number/OYX4MHOCBXXJNEATIVAQJDX3EG/graph.json","events_json":"https://pith.science/api/pith-number/OYX4MHOCBXXJNEATIVAQJDX3EG/events.json","paper":"https://pith.science/paper/OYX4MHOC"},"agent_actions":{"view_html":"https://pith.science/pith/OYX4MHOCBXXJNEATIVAQJDX3EG","download_json":"https://pith.science/pith/OYX4MHOCBXXJNEATIVAQJDX3EG.json","view_paper":"https://pith.science/paper/OYX4MHOC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.13472&json=true","fetch_graph":"https://pith.science/api/pith-number/OYX4MHOCBXXJNEATIVAQJDX3EG/graph.json","fetch_events":"https://pith.science/api/pith-number/OYX4MHOCBXXJNEATIVAQJDX3EG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OYX4MHOCBXXJNEATIVAQJDX3EG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OYX4MHOCBXXJNEATIVAQJDX3EG/action/storage_attestation","attest_author":"https://pith.science/pith/OYX4MHOCBXXJNEATIVAQJDX3EG/action/author_attestation","sign_citation":"https://pith.science/pith/OYX4MHOCBXXJNEATIVAQJDX3EG/action/citation_signature","submit_replication":"https://pith.science/pith/OYX4MHOCBXXJNEATIVAQJDX3EG/action/replication_record"}},"created_at":"2026-07-05T04:35:07.143639+00:00","updated_at":"2026-07-05T04:35:07.143639+00:00"}