{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:4FQJGYSIZ6YVRYHML6OO2TY2UU","short_pith_number":"pith:4FQJGYSI","schema_version":"1.0","canonical_sha256":"e160936248cfb158e0ec5f9ced4f1aa53ee2399c45c3d85086bb8bd4e11fb06a","source":{"kind":"arxiv","id":"2309.11666","version":2},"attestation_state":"computed","paper":{"title":"Error estimate for regularized optimal transport problems via Bregman divergence","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Asuka Takatsu, Keiichi Morikuni, Koya Sakakibara","submitted_at":"2023-09-20T22:19:49Z","abstract_excerpt":"Regularization by the Shannon entropy enables us to efficiently and approximately solve optimal transport problems on a finite set. This paper is concerned with regularized optimal transport problems via Bregman divergence. We introduce the required properties for Bregman divergences, provide a non-asymptotic error estimate for the regularized problem, and show that the error estimate becomes faster than exponentially."},"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":"2309.11666","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-09-20T22:19:49Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"b8dfcf3014daec1b048f2b47dfc433724c99992cfd0051a5c31301ba7363e0f3","abstract_canon_sha256":"c4902a59a901837548e2265f631962493e83f530017c32597b57ca12b5d5083b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:46:18.790021Z","signature_b64":"aa2468IdTGO13sYRvwQFGY/1VXm1Rqde531kB8tS3k5jEbRyICVTO7nalfi1REob3nExGQYr1eJj+iLpWk2ICA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e160936248cfb158e0ec5f9ced4f1aa53ee2399c45c3d85086bb8bd4e11fb06a","last_reissued_at":"2026-07-05T10:46:18.789486Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:46:18.789486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Error estimate for regularized optimal transport problems via Bregman divergence","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Asuka Takatsu, Keiichi Morikuni, Koya Sakakibara","submitted_at":"2023-09-20T22:19:49Z","abstract_excerpt":"Regularization by the Shannon entropy enables us to efficiently and approximately solve optimal transport problems on a finite set. This paper is concerned with regularized optimal transport problems via Bregman divergence. We introduce the required properties for Bregman divergences, provide a non-asymptotic error estimate for the regularized problem, and show that the error estimate becomes faster than exponentially."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.11666","kind":"arxiv","version":2},"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/2309.11666/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":"2309.11666","created_at":"2026-07-05T10:46:18.789542+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.11666v2","created_at":"2026-07-05T10:46:18.789542+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.11666","created_at":"2026-07-05T10:46:18.789542+00:00"},{"alias_kind":"pith_short_12","alias_value":"4FQJGYSIZ6YV","created_at":"2026-07-05T10:46:18.789542+00:00"},{"alias_kind":"pith_short_16","alias_value":"4FQJGYSIZ6YVRYHM","created_at":"2026-07-05T10:46:18.789542+00:00"},{"alias_kind":"pith_short_8","alias_value":"4FQJGYSI","created_at":"2026-07-05T10:46:18.789542+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.03120","citing_title":"Sinkhorn Algorithm for Sequentially Composed Optimal Transports","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4FQJGYSIZ6YVRYHML6OO2TY2UU","json":"https://pith.science/pith/4FQJGYSIZ6YVRYHML6OO2TY2UU.json","graph_json":"https://pith.science/api/pith-number/4FQJGYSIZ6YVRYHML6OO2TY2UU/graph.json","events_json":"https://pith.science/api/pith-number/4FQJGYSIZ6YVRYHML6OO2TY2UU/events.json","paper":"https://pith.science/paper/4FQJGYSI"},"agent_actions":{"view_html":"https://pith.science/pith/4FQJGYSIZ6YVRYHML6OO2TY2UU","download_json":"https://pith.science/pith/4FQJGYSIZ6YVRYHML6OO2TY2UU.json","view_paper":"https://pith.science/paper/4FQJGYSI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.11666&json=true","fetch_graph":"https://pith.science/api/pith-number/4FQJGYSIZ6YVRYHML6OO2TY2UU/graph.json","fetch_events":"https://pith.science/api/pith-number/4FQJGYSIZ6YVRYHML6OO2TY2UU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4FQJGYSIZ6YVRYHML6OO2TY2UU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4FQJGYSIZ6YVRYHML6OO2TY2UU/action/storage_attestation","attest_author":"https://pith.science/pith/4FQJGYSIZ6YVRYHML6OO2TY2UU/action/author_attestation","sign_citation":"https://pith.science/pith/4FQJGYSIZ6YVRYHML6OO2TY2UU/action/citation_signature","submit_replication":"https://pith.science/pith/4FQJGYSIZ6YVRYHML6OO2TY2UU/action/replication_record"}},"created_at":"2026-07-05T10:46:18.789542+00:00","updated_at":"2026-07-05T10:46:18.789542+00:00"}