{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:SFYPUFY6JN4RSX3PHEPHYUFAND","short_pith_number":"pith:SFYPUFY6","schema_version":"1.0","canonical_sha256":"9170fa171e4b79195f6f391e7c50a068f4e47d32bfeccebaf0e3541018bd2288","source":{"kind":"arxiv","id":"2505.04721","version":1},"attestation_state":"computed","paper":{"title":"Sparse Regularized Optimal Transport without Curse of Dimensionality","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.PR","stat.TH"],"primary_cat":"math.ST","authors_text":"Alberto Gonz\\'alez-Sanz, Marcel Nutz, Stephan Eckstein","submitted_at":"2025-05-07T18:17:57Z","abstract_excerpt":"Entropic optimal transport -- the optimal transport problem regularized by KL diver\\-gence -- is highly successful in statistical applications. Thanks to the smoothness of the entropic coupling, its sample complexity avoids the curse of dimensionality suffered by unregularized optimal transport. The flip side of smoothness is overspreading: the entropic coupling always has full support, whereas the unregularized coupling that it approximates is usually sparse, even given by a map. Regularizing optimal transport by less-smooth $f$-divergences such as Tsallis divergence (i.e., $L^p$-regularizati"},"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":"2505.04721","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2025-05-07T18:17:57Z","cross_cats_sorted":["math.PR","stat.TH"],"title_canon_sha256":"cdd2cc3098683112b2cf6972783bdbc2b2cbebce18a3fa80f6d392b69a8f19db","abstract_canon_sha256":"2ad1fcb535730b9d0a1e995545b77892bbedbcd1abd19479d8fb96d4db864b0d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:00:12.659551Z","signature_b64":"QWp2m0g9rPUt9EUvgoOAE9y7g5YlueZjqyS+pcBGWdEmAjlWrF5Jm/CzsoW0QGs5OQDUEBxaeyV1Br1vJM3XBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9170fa171e4b79195f6f391e7c50a068f4e47d32bfeccebaf0e3541018bd2288","last_reissued_at":"2026-07-05T11:00:12.659035Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:00:12.659035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse Regularized Optimal Transport without Curse of Dimensionality","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.PR","stat.TH"],"primary_cat":"math.ST","authors_text":"Alberto Gonz\\'alez-Sanz, Marcel Nutz, Stephan Eckstein","submitted_at":"2025-05-07T18:17:57Z","abstract_excerpt":"Entropic optimal transport -- the optimal transport problem regularized by KL diver\\-gence -- is highly successful in statistical applications. Thanks to the smoothness of the entropic coupling, its sample complexity avoids the curse of dimensionality suffered by unregularized optimal transport. The flip side of smoothness is overspreading: the entropic coupling always has full support, whereas the unregularized coupling that it approximates is usually sparse, even given by a map. Regularizing optimal transport by less-smooth $f$-divergences such as Tsallis divergence (i.e., $L^p$-regularizati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.04721","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/2505.04721/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":"2505.04721","created_at":"2026-07-05T11:00:12.659098+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.04721v1","created_at":"2026-07-05T11:00:12.659098+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.04721","created_at":"2026-07-05T11:00:12.659098+00:00"},{"alias_kind":"pith_short_12","alias_value":"SFYPUFY6JN4R","created_at":"2026-07-05T11:00:12.659098+00:00"},{"alias_kind":"pith_short_16","alias_value":"SFYPUFY6JN4RSX3P","created_at":"2026-07-05T11:00:12.659098+00:00"},{"alias_kind":"pith_short_8","alias_value":"SFYPUFY6","created_at":"2026-07-05T11:00:12.659098+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.25947","citing_title":"Finite-sample bounds for regularized optimal transport","ref_index":30,"is_internal_anchor":false},{"citing_arxiv_id":"2605.27175","citing_title":"Polyak-Lojasiewicz Inequality for Quadratically Regularized Optimal Transport","ref_index":14,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SFYPUFY6JN4RSX3PHEPHYUFAND","json":"https://pith.science/pith/SFYPUFY6JN4RSX3PHEPHYUFAND.json","graph_json":"https://pith.science/api/pith-number/SFYPUFY6JN4RSX3PHEPHYUFAND/graph.json","events_json":"https://pith.science/api/pith-number/SFYPUFY6JN4RSX3PHEPHYUFAND/events.json","paper":"https://pith.science/paper/SFYPUFY6"},"agent_actions":{"view_html":"https://pith.science/pith/SFYPUFY6JN4RSX3PHEPHYUFAND","download_json":"https://pith.science/pith/SFYPUFY6JN4RSX3PHEPHYUFAND.json","view_paper":"https://pith.science/paper/SFYPUFY6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.04721&json=true","fetch_graph":"https://pith.science/api/pith-number/SFYPUFY6JN4RSX3PHEPHYUFAND/graph.json","fetch_events":"https://pith.science/api/pith-number/SFYPUFY6JN4RSX3PHEPHYUFAND/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SFYPUFY6JN4RSX3PHEPHYUFAND/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SFYPUFY6JN4RSX3PHEPHYUFAND/action/storage_attestation","attest_author":"https://pith.science/pith/SFYPUFY6JN4RSX3PHEPHYUFAND/action/author_attestation","sign_citation":"https://pith.science/pith/SFYPUFY6JN4RSX3PHEPHYUFAND/action/citation_signature","submit_replication":"https://pith.science/pith/SFYPUFY6JN4RSX3PHEPHYUFAND/action/replication_record"}},"created_at":"2026-07-05T11:00:12.659098+00:00","updated_at":"2026-07-05T11:00:12.659098+00:00"}