{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BU45LDVDUSJ7RTANORWTSUTWWZ","short_pith_number":"pith:BU45LDVD","schema_version":"1.0","canonical_sha256":"0d39d58ea3a493f8cc0d746d395276b67f7817e47144426603d7a74592b59e2b","source":{"kind":"arxiv","id":"1710.06635","version":2},"attestation_state":"computed","paper":{"title":"A Sinkhorn-Newton method for entropic optimal transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA","stat.ML"],"primary_cat":"math.OC","authors_text":"Benedikt Wirth, Christian Clason, Christoph Brauer, Dirk Lorenz","submitted_at":"2017-10-18T09:19:50Z","abstract_excerpt":"We consider the entropic regularization of discretized optimal transport and propose to solve its optimality conditions via a logarithmic Newton iteration. We show a quadratic convergence rate and validate numerically that the method compares favorably with the more commonly used Sinkhorn--Knopp algorithm for small regularization strength. We further investigate numerically the robustness of the proposed method with respect to parameters such as the mesh size of the discretization."},"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":"1710.06635","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-18T09:19:50Z","cross_cats_sorted":["math.NA","stat.ML"],"title_canon_sha256":"80966db36fae66982e8b2cb68b56f3ae3331d622bfbe2fa8d9c2b58a573269df","abstract_canon_sha256":"fe0294c546567bd4168316f33e4d433409b06ad909106cb1dd5de0c3b8cafabb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:58.810470Z","signature_b64":"8BHHPulHdKn/hIYY3Ml4OuIRbVRo9dswSbJsmiAdaRH81KYk7yZNinr6YnUQhk286bNbYgsdJLXyC2/v7h0LBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d39d58ea3a493f8cc0d746d395276b67f7817e47144426603d7a74592b59e2b","last_reissued_at":"2026-05-18T00:23:58.809901Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:58.809901Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Sinkhorn-Newton method for entropic optimal transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA","stat.ML"],"primary_cat":"math.OC","authors_text":"Benedikt Wirth, Christian Clason, Christoph Brauer, Dirk Lorenz","submitted_at":"2017-10-18T09:19:50Z","abstract_excerpt":"We consider the entropic regularization of discretized optimal transport and propose to solve its optimality conditions via a logarithmic Newton iteration. We show a quadratic convergence rate and validate numerically that the method compares favorably with the more commonly used Sinkhorn--Knopp algorithm for small regularization strength. We further investigate numerically the robustness of the proposed method with respect to parameters such as the mesh size of the discretization."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.06635","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":""},"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":"1710.06635","created_at":"2026-05-18T00:23:58.809982+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.06635v2","created_at":"2026-05-18T00:23:58.809982+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.06635","created_at":"2026-05-18T00:23:58.809982+00:00"},{"alias_kind":"pith_short_12","alias_value":"BU45LDVDUSJ7","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BU45LDVDUSJ7RTAN","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BU45LDVD","created_at":"2026-05-18T12:31:08.081275+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2602.03067","citing_title":"FlashSinkhorn: IO-Aware Entropic Optimal Transport on GPU","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BU45LDVDUSJ7RTANORWTSUTWWZ","json":"https://pith.science/pith/BU45LDVDUSJ7RTANORWTSUTWWZ.json","graph_json":"https://pith.science/api/pith-number/BU45LDVDUSJ7RTANORWTSUTWWZ/graph.json","events_json":"https://pith.science/api/pith-number/BU45LDVDUSJ7RTANORWTSUTWWZ/events.json","paper":"https://pith.science/paper/BU45LDVD"},"agent_actions":{"view_html":"https://pith.science/pith/BU45LDVDUSJ7RTANORWTSUTWWZ","download_json":"https://pith.science/pith/BU45LDVDUSJ7RTANORWTSUTWWZ.json","view_paper":"https://pith.science/paper/BU45LDVD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.06635&json=true","fetch_graph":"https://pith.science/api/pith-number/BU45LDVDUSJ7RTANORWTSUTWWZ/graph.json","fetch_events":"https://pith.science/api/pith-number/BU45LDVDUSJ7RTANORWTSUTWWZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BU45LDVDUSJ7RTANORWTSUTWWZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BU45LDVDUSJ7RTANORWTSUTWWZ/action/storage_attestation","attest_author":"https://pith.science/pith/BU45LDVDUSJ7RTANORWTSUTWWZ/action/author_attestation","sign_citation":"https://pith.science/pith/BU45LDVDUSJ7RTANORWTSUTWWZ/action/citation_signature","submit_replication":"https://pith.science/pith/BU45LDVDUSJ7RTANORWTSUTWWZ/action/replication_record"}},"created_at":"2026-05-18T00:23:58.809982+00:00","updated_at":"2026-05-18T00:23:58.809982+00:00"}