{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:F4RNAL3JK47B6JS6SGCWAXSW5C","short_pith_number":"pith:F4RNAL3J","schema_version":"1.0","canonical_sha256":"2f22d02f69573e1f265e9185605e56e88bdd86489fd55ef215de6bdecc8043d3","source":{"kind":"arxiv","id":"2007.00976","version":1},"attestation_state":"computed","paper":{"title":"Optimal Transport losses and Sinkhorn algorithm with general convex regularization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.FA"],"primary_cat":"math.OC","authors_text":"Augusto Gerolin, Simone Di Marino","submitted_at":"2020-07-02T09:22:23Z","abstract_excerpt":"We introduce a new class of convex-regularized Optimal Transport losses, which generalizes the classical Entropy-regularization of Optimal Transport and Sinkhorn divergences, and propose a generalized Sinkhorn algorithm. Our framework unifies many regularizations and numerical methods previously appeared in the literature. We show the existence of the maximizer for the dual problem, complementary slackness conditions, providing a complete characterization of solutions for such class of variational problems. As a consequence, we study structural properties of these losses, including continuity,"},"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":"2007.00976","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-07-02T09:22:23Z","cross_cats_sorted":["math.FA"],"title_canon_sha256":"fd8339d969c18b31b5f257d77a3c63cc53bf01b39f3e7234e277e33bbc390196","abstract_canon_sha256":"3c2d25bbd19b3dea5058e6e5b6810a73ddad56d2ef86264a4201d8d18e8958da"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:15:43.396541Z","signature_b64":"IEGB/WSgdf0BBfMIyTxJInEVLW/KLAQ7xPTO5d+gMEgI20kiE3AwqoQyEdlbsknwPrlVKBtJWFcK0R+mrxEqBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f22d02f69573e1f265e9185605e56e88bdd86489fd55ef215de6bdecc8043d3","last_reissued_at":"2026-07-05T01:15:43.395935Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:15:43.395935Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Transport losses and Sinkhorn algorithm with general convex regularization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.FA"],"primary_cat":"math.OC","authors_text":"Augusto Gerolin, Simone Di Marino","submitted_at":"2020-07-02T09:22:23Z","abstract_excerpt":"We introduce a new class of convex-regularized Optimal Transport losses, which generalizes the classical Entropy-regularization of Optimal Transport and Sinkhorn divergences, and propose a generalized Sinkhorn algorithm. Our framework unifies many regularizations and numerical methods previously appeared in the literature. We show the existence of the maximizer for the dual problem, complementary slackness conditions, providing a complete characterization of solutions for such class of variational problems. As a consequence, we study structural properties of these losses, including continuity,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.00976","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/2007.00976/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":"2007.00976","created_at":"2026-07-05T01:15:43.396021+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.00976v1","created_at":"2026-07-05T01:15:43.396021+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.00976","created_at":"2026-07-05T01:15:43.396021+00:00"},{"alias_kind":"pith_short_12","alias_value":"F4RNAL3JK47B","created_at":"2026-07-05T01:15:43.396021+00:00"},{"alias_kind":"pith_short_16","alias_value":"F4RNAL3JK47B6JS6","created_at":"2026-07-05T01:15:43.396021+00:00"},{"alias_kind":"pith_short_8","alias_value":"F4RNAL3J","created_at":"2026-07-05T01:15:43.396021+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.00665","citing_title":"Effective dynamics of the Sinkhorn algorithm in the regime of low entropy regularization","ref_index":65,"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":66,"is_internal_anchor":false},{"citing_arxiv_id":"2604.12996","citing_title":"Equivalence of optimal transport problems to regularization on the family of f-divergences","ref_index":11,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/F4RNAL3JK47B6JS6SGCWAXSW5C","json":"https://pith.science/pith/F4RNAL3JK47B6JS6SGCWAXSW5C.json","graph_json":"https://pith.science/api/pith-number/F4RNAL3JK47B6JS6SGCWAXSW5C/graph.json","events_json":"https://pith.science/api/pith-number/F4RNAL3JK47B6JS6SGCWAXSW5C/events.json","paper":"https://pith.science/paper/F4RNAL3J"},"agent_actions":{"view_html":"https://pith.science/pith/F4RNAL3JK47B6JS6SGCWAXSW5C","download_json":"https://pith.science/pith/F4RNAL3JK47B6JS6SGCWAXSW5C.json","view_paper":"https://pith.science/paper/F4RNAL3J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.00976&json=true","fetch_graph":"https://pith.science/api/pith-number/F4RNAL3JK47B6JS6SGCWAXSW5C/graph.json","fetch_events":"https://pith.science/api/pith-number/F4RNAL3JK47B6JS6SGCWAXSW5C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F4RNAL3JK47B6JS6SGCWAXSW5C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F4RNAL3JK47B6JS6SGCWAXSW5C/action/storage_attestation","attest_author":"https://pith.science/pith/F4RNAL3JK47B6JS6SGCWAXSW5C/action/author_attestation","sign_citation":"https://pith.science/pith/F4RNAL3JK47B6JS6SGCWAXSW5C/action/citation_signature","submit_replication":"https://pith.science/pith/F4RNAL3JK47B6JS6SGCWAXSW5C/action/replication_record"}},"created_at":"2026-07-05T01:15:43.396021+00:00","updated_at":"2026-07-05T01:15:43.396021+00:00"}