{"as_of":"2026-08-21T09:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:002d57e5923c430e1cf7d8722446721736c3582d6846007f7e224417eb11f2e1","coverage":[{"denominator":43,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":43,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T00:38:41.703379Z","state":"measured"},{"denominator":43,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":43,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2608.11760/citation-record","integrity":"/paper/2608.11760/integrity","json":"/paper/2608.11760/citation-record.json","paper":"/paper/2608.11760"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:38:43.726192Z","title":"Katyusha: The first direct acceleration of stochastic gradient methods.Journal of Machine Learning Research, 18(221):1–51, 2018","venue":null,"work_id":"be67aae8-83fc-4b64-b5ae-4b71ad776c10","year":2018},"citing_paper":{"arxiv_id":"2608.11760","last_updated":"2026-08-13T02:05:14Z","snapshot_observed_at":"2026-08-19T12:26:39.886712Z","submitted_at":"2026-08-12T07:56:08Z","title":"Tight Nonasymptotic Local Convergence of Sinkhorn-Knopp","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-16T00:38:40.819292Z"},"links":{"citing_paper":"/paper/2608.11760"},"observation_digest":"sha256:d5ddd57e0c9c7e53edfdc8e9aeeac284676d398a3898940772a2027587f25a03","observation_id":"66ea058e-80eb-4feb-bc3c-f54a70e5f28a","resolution":{"observed_at":"2026-08-16T00:38:43.730387Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:38:43.713689Z","title":"Much faster algorithms for matrix scaling","venue":null,"work_id":"65a2449c-8bff-44bf-bb9b-c349347666d0","year":null},"citing_paper":{"arxiv_id":"2608.11760","last_updated":"2026-08-13T02:05:14Z","snapshot_observed_at":"2026-08-19T12:26:39.886712Z","submitted_at":"2026-08-12T07:56:08Z","title":"Tight Nonasymptotic Local Convergence of Sinkhorn-Knopp","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-16T00:38:40.824540Z"},"links":{"citing_paper":"/paper/2608.11760"},"observation_digest":"sha256:3ed1fac4a18fec0fde16aecd8f90b39cabfdb26329bdc5de29b67e6233588091","observation_id":"dbcdaf16-3fbb-46b2-b351-166d62dc7f25","resolution":{"observed_at":"2026-08-16T00:38:43.717712Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:38:43.688714Z","title":"Near-linear time approximation algorithms for optimal transport via sinkhorn iteration.Advances in Neural Information Processing Systems, 30, 2017","venue":null,"work_id":"d81c27ad-b523-4e54-be5d-569b9512ba17","year":2017},"citing_paper":{"arxiv_id":"2608.11760","last_updated":"2026-08-13T02:05:14Z","snapshot_observed_at":"2026-08-19T12:26:39.886712Z","submitted_at":"2026-08-12T07:56:08Z","title":"Tight Nonasymptotic Local Convergence of Sinkhorn-Knopp","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-16T00:38:40.835073Z"},"links":{"citing_paper":"/paper/2608.11760"},"observation_digest":"sha256:c523e2871cccb86bf22757543ae7429813ff1f17ec5be667b9f5e9b4fba8af95","observation_id":"d8872248-af62-41aa-bdca-ffc5b8472825","resolution":{"observed_at":"2026-08-16T00:38:43.693179Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:38:43.677150Z","title":"Estimating nonnegative matrices from marginal data.International Economic Review, 6(3):294–310, 1965","venue":null,"work_id":"670b10c2-8d17-4fcb-8548-562be8f943f6","year":1965},"citing_paper":{"arxiv_id":"2608.11760","last_updated":"2026-08-13T02:05:14Z","snapshot_observed_at":"2026-08-19T12:26:39.886712Z","submitted_at":"2026-08-12T07:56:08Z","title":"Tight Nonasymptotic Local Convergence of Sinkhorn-Knopp","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-16T00:38:40.840263Z"},"links":{"citing_paper":"/paper/2608.11760"},"observation_digest":"sha256:d2ea4f107a7e576c8b0a00fc44461d7823b32f38da6ccf876d1f4831ad10520c","observation_id":"09de9c69-dea7-4335-a418-195d3f465d08","resolution":{"observed_at":"2026-08-16T00:38:43.681155Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1810.07717","last_updated":"2020-01-28T07:20:12Z","snapshot_observed_at":"2026-08-14T18:13:03.208226Z","submitted_at":"2018-10-17T18:08:30Z","title":"Towards Optimal Running Times for Optimal Transport","version":3},"cited_work":{"arxiv_id":"1810.07717","doi":null,"metadata_source":"pith","pith_arxiv_id":"1810.07717","snapshot_observed_at":"2026-08-16T00:38:42.227034Z","title":"Towards Optimal Running Times for Optimal Transport","venue":"cs.DS","work_id":"94a7fcda-b4d8-4fa2-8901-19b43c119636","year":2018},"citing_paper":{"arxiv_id":"2608.11760","last_updated":"2026-08-13T02:05:14Z","snapshot_observed_at":"2026-08-19T12:26:39.886712Z","submitted_at":"2026-08-12T07:56:08Z","title":"Tight Nonasymptotic Local Convergence of Sinkhorn-Knopp","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-16T00:38:40.844940Z"},"links":{"cited_paper":"/paper/1810.07717","citing_paper":"/paper/2608.11760"},"observation_digest":"sha256:75116e2102e6007a653f23d7fbcbe537529c52ae67e37f8b312c5728fef5d627","observation_id":"c7332636-11b4-44fb-8b76-91e831872686","resolution":{"observed_at":"2026-08-16T00:38:42.268020Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:38:43.663988Z","title":"Better and simpler error analysis of the sinkhorn–knopp algorithm for matrix scaling.Mathematical Programming, 188(1):395–407, 2021","venue":null,"work_id":"0bc034fe-8801-4170-8ab6-bef8e8411811","year":2021},"citing_paper":{"arxiv_id":"2608.11760","last_updated":"2026-08-13T02:05:14Z","snapshot_observed_at":"2026-08-19T12:26:39.886712Z","submitted_at":"2026-08-12T07:56:08Z","title":"Tight Nonasymptotic Local Convergence of Sinkhorn-Knopp","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-16T00:38:40.850958Z"},"links":{"citing_paper":"/paper/2608.11760"},"observation_digest":"sha256:c822cfa7665967d8ef4c4706f66dbb6e6f59a1809f5f7ab36bd4149bff250f3f","observation_id":"b22a4781-c73f-498d-b577-9398bd3f514c","resolution":{"observed_at":"2026-08-16T00:38:43.668177Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:38:43.650866Z","title":"Matrix scaling and balancing via box constrained newton’s method and interior point methods","venue":null,"work_id":"4e7096a2-1343-4231-a881-9deda17fc3cf","year":2017},"citing_paper":{"arxiv_id":"2608.11760","last_updated":"2026-08-13T02:05:14Z","snapshot_observed_at":"2026-08-19T12:26:39.886712Z","submitted_at":"2026-08-12T07:56:08Z","title":"Tight Nonasymptotic Local Convergence of Sinkhorn-Knopp","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-16T00:38:40.928749Z"},"links":{"citing_paper":"/paper/2608.11760"},"observation_digest":"sha256:06b9eb417c255184cfb631f04a12bbecf88261b96ec812ea575561300af48d69","observation_id":"5571bdc8-5329-44d0-802d-cf71484c28c3","resolution":{"observed_at":"2026-08-16T00:38:43.655815Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:38:43.629753Z","title":"Semidual regularized optimal transport.SIAM Review, 60(4):941–965,","venue":null,"work_id":"0e822ae6-cde0-4509-9d07-e403bef3a48d","year":null},"citing_paper":{"arxiv_id":"2608.11760","last_updated":"2026-08-13T02:05:14Z","snapshot_observed_at":"2026-08-19T12:26:39.886712Z","submitted_at":"2026-08-12T07:56:08Z","title":"Tight Nonasymptotic Local Convergence of Sinkhorn-Knopp","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-16T00:38:40.996600Z"},"links":{"citing_paper":"/paper/2608.11760"},"observation_digest":"sha256:9f02da3a9332e1eda4e1bec4b3dd8562646e8f09c5edbca5a5f4ec8f7c298fec","observation_id":"e932197a-22fd-44d5-9949-2cfddd3b6d93","resolution":{"observed_at":"2026-08-16T00:38:43.642539Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:38:43.531250Z","title":"Acceleration methods.Foundations and Trends®in Optimization, 5(1-2):1–245, 2021","venue":null,"work_id":"d561140b-ffca-4cc9-9f24-99307fce3a26","year":2021},"citing_paper":{"arxiv_id":"2608.11760","last_updated":"2026-08-13T02:05:14Z","snapshot_observed_at":"2026-08-19T12:26:39.886712Z","submitted_at":"2026-08-12T07:56:08Z","title":"Tight Nonasymptotic Local Convergence of Sinkhorn-Knopp","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-16T00:38:41.064681Z"},"links":{"citing_paper":"/paper/2608.11760"},"observation_digest":"sha256:06554ce8718b023411a53e1bfe4b4b181d0ee89870b2e57daf56700d2c88a07c","observation_id":"f4b15f4f-d96d-42ff-b374-c135ad55d275","resolution":{"observed_at":"2026-08-16T00:38:43.576807Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:38:43.442897Z","title":"Stochastic matrix-free equilibration.Journal of Optimization Theory and Applications, 172(2):436–454, 2017","venue":null,"work_id":"0c051071-8693-4434-bd72-638c58601719","year":2017},"citing_paper":{"arxiv_id":"2608.11760","last_updated":"2026-08-13T02:05:14Z","snapshot_observed_at":"2026-08-19T12:26:39.886712Z","submitted_at":"2026-08-12T07:56:08Z","title":"Tight Nonasymptotic Local Convergence of Sinkhorn-Knopp","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-16T00:38:41.069686Z"},"links":{"citing_paper":"/paper/2608.11760"},"observation_digest":"sha256:f6f72abe3cb052eb5d1be84d0bf435cd95fb5b6b152be872a660ab288dd8d33f","observation_id":"8c5835a1-44fb-45b5-b7c9-c8fd4930f517","resolution":{"observed_at":"2026-08-16T00:38:43.475234Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:38:43.426393Z","title":"Computational optimal transport: Com- plexity by accelerated gradient descent is better than by sinkhorn’s algorithm","venue":null,"work_id":"406025f0-4914-4007-885d-2a716e9cf76a","year":2018},"citing_paper":{"arxiv_id":"2608.11760","last_updated":"2026-08-13T02:05:14Z","snapshot_observed_at":"2026-08-19T12:26:39.886712Z","submitted_at":"2026-08-12T07:56:08Z","title":"Tight Nonasymptotic Local Convergence of Sinkhorn-Knopp","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-16T00:38:41.075950Z"},"links":{"citing_paper":"/paper/2608.11760"},"observation_digest":"sha256:108d39d2b9382a0c05c3e3b81915509458c008def853d65bdaa597ccdabae40b","observation_id":"ec3eb59c-c16b-4020-ad63-29065bba53b8","resolution":{"observed_at":"2026-08-16T00:38:43.431107Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:38:43.372763Z","title":"Parameterselectionandpreconditioningforagraphformsolver","venue":null,"work_id":"f1e61538-2936-448c-868c-666d1a027511","year":2018},"citing_paper":{"arxiv_id":"2608.11760","last_updated":"2026-08-13T02:05:14Z","snapshot_observed_at":"2026-08-19T12:26:39.886712Z","submitted_at":"2026-08-12T07:56:08Z","title":"Tight Nonasymptotic Local Convergence of Sinkhorn-Knopp","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-16T00:38:41.082035Z"},"links":{"citing_paper":"/paper/2608.11760"},"observation_digest":"sha256:bc674c4a68ddbee1cd02c70e133bc5ebca8f151d201db6793ebf6246b692b59b","observation_id":"9efd1ffe-c72d-481e-9f52-5ff5bcbb366e","resolution":{"observed_at":"2026-08-16T00:38:43.394411Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:38:43.308388Z","title":"On the scaling of multidimensional matrices.Linear Algebra and its applications, 114:717–735, 1989","venue":null,"work_id":"1ee0e80a-a1cb-42b0-9914-b9132d2b3cbd","year":1989},"citing_paper":{"arxiv_id":"2608.11760","last_updated":"2026-08-13T02:05:14Z","snapshot_observed_at":"2026-08-19T12:26:39.886712Z","submitted_at":"2026-08-12T07:56:08Z","title":"Tight Nonasymptotic Local Convergence of Sinkhorn-Knopp","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-16T00:38:41.087476Z"},"links":{"citing_paper":"/paper/2608.11760"},"observation_digest":"sha256:5a68a6e1409087a47c705ed13ffb6919fef8d23d42ad5eec27fac376dd0a1a5f","observation_id":"38b0a61b-30fa-44ce-93a7-41d17084ad54","resolution":{"observed_at":"2026-08-16T00:38:43.351723Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:38:43.266339Z","title":"Non-asymptotic local convergence analysis of alternating minimization, April 2026","venue":null,"work_id":"dfba1c73-a4a0-4649-994e-d7ad04f587de","year":2026},"citing_paper":{"arxiv_id":"2608.11760","last_updated":"2026-08-13T02:05:14Z","snapshot_observed_at":"2026-08-19T12:26:39.886712Z","submitted_at":"2026-08-12T07:56:08Z","title":"Tight Nonasymptotic Local Convergence of Sinkhorn-Knopp","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-16T00:38:41.093226Z"},"links":{"citing_paper":"/paper/2608.11760"},"observation_digest":"sha256:58caf64c586b7403d10c9ae5255984d038f13da7ed214a98c7932f1237823ecd","observation_id":"f108af17-7b38-456c-8324-b01b8ec2be91","resolution":{"observed_at":"2026-08-16T00:38:43.284302Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.23081","last_updated":"2025-09-05T02:19:47Z","snapshot_observed_at":"2026-08-10T15:27:55.230768Z","submitted_at":"2025-05-29T04:35:21Z","title":"Gradient Methods with Online Scaling Part I. Theoretical Foundations","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.23081","snapshot_observed_at":"2026-08-16T00:38:41.132738Z","title":"Gradient methods with online scaling part I","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.11760","last_updated":"2026-08-13T02:05:14Z","snapshot_observed_at":"2026-08-19T12:26:39.886712Z","submitted_at":"2026-08-12T07:56:08Z","title":"Tight Nonasymptotic Local Convergence of Sinkhorn-Knopp","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-16T00:38:41.132738Z"},"links":{"cited_paper":"/paper/2505.23081","citing_paper":"/paper/2608.11760"},"observation_digest":"sha256:aa6cdd6ba852f8ac5e8f68c83e2e15f5f68e154e9744801df94d6fb7fcd61811","observation_id":"a17a2056-3d84-44f7-a89b-1f954def582f","resolution":{"observed_at":"2026-08-16T00:38:41.132738Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2602.10697","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:38:42.020966Z","title":"Fast and large-scale unbalanced optimal transport via its semi-dual and adaptive gradient methods.arXiv preprint arXiv:2602.10697, 2026","venue":null,"work_id":"10a05646-b178-41b3-9b4b-36d82bb7b76c","year":2026},"citing_paper":{"arxiv_id":"2608.11760","last_updated":"2026-08-13T02:05:14Z","snapshot_observed_at":"2026-08-19T12:26:39.886712Z","submitted_at":"2026-08-12T07:56:08Z","title":"Tight Nonasymptotic Local Convergence of Sinkhorn-Knopp","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-16T00:38:41.196629Z"},"links":{"citing_paper":"/paper/2608.11760"},"observation_digest":"sha256:e64969d5ea02dc47d40a7c9dc52cb1862b40c6d4c1f0241b850e011fcc4d10ab","observation_id":"1f8f6d97-54a5-4a88-a324-429dc6560b0f","resolution":{"observed_at":"2026-08-16T00:38:42.091837Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2604.03787","last_updated":"2026-04-04T16:24:19Z","snapshot_observed_at":"2026-08-03T00:33:21.311712Z","submitted_at":"2026-04-04T16:24:19Z","title":"On the Efficiency of Sinkhorn-Knopp for Entropically Regularized Optimal Transport","version":1},"cited_work":{"arxiv_id":"2604.03787","doi":null,"metadata_source":"pith","pith_arxiv_id":"2604.03787","snapshot_observed_at":"2026-08-16T00:38:41.892245Z","title":"On the Efficiency of Sinkhorn-Knopp for Entropically Regularized Optimal Transport","venue":"cs.DS","work_id":"cbf0ef60-e76d-48c8-b4c5-ead5d0ecf58b","year":2026},"citing_paper":{"arxiv_id":"2608.11760","last_updated":"2026-08-13T02:05:14Z","snapshot_observed_at":"2026-08-19T12:26:39.886712Z","submitted_at":"2026-08-12T07:56:08Z","title":"Tight Nonasymptotic Local Convergence of Sinkhorn-Knopp","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-16T00:38:41.244187Z"},"links":{"cited_paper":"/paper/2604.03787","citing_paper":"/paper/2608.11760"},"observation_digest":"sha256:bc6f73943466db0bc41f772c8224569fd640a47ff786690d0d4a2ce6a23b5d66","observation_id":"94fafc9e-c59c-4052-ac60-8090999f9e22","resolution":{"observed_at":"2026-08-16T00:38:41.913273Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:38:43.242786Z","title":"Phase transition of the sinkhorn-knopp algorithm","venue":null,"work_id":"c610fb35-c3da-4bd1-b11f-3b759b40b3e9","year":2026},"citing_paper":{"arxiv_id":"2608.11760","last_updated":"2026-08-13T02:05:14Z","snapshot_observed_at":"2026-08-19T12:26:39.886712Z","submitted_at":"2026-08-12T07:56:08Z","title":"Tight Nonasymptotic Local Convergence of Sinkhorn-Knopp","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-16T00:38:41.249053Z"},"links":{"citing_paper":"/paper/2608.11760"},"observation_digest":"sha256:820aac71b7a932f691002f5f698480b693759600041044019a1344907cea2a23","observation_id":"fbede85d-f04d-4bfd-81df-365636e7cd9b","resolution":{"observed_at":"2026-08-16T00:38:43.247106Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1609.06349","last_updated":"2016-09-20T20:41:04Z","snapshot_observed_at":"2026-08-14T21:38:57.030519Z","submitted_at":"2016-09-20T20:41:04Z","title":"A review of matrix scaling and Sinkhorn's normal form for matrices and positive maps","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.06349","snapshot_observed_at":"2026-08-16T00:38:41.253824Z","title":"A review of matrix scaling and sinkhorn’s normal form for matrices and positive maps.arXiv preprint arXiv:1609.06349, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2608.11760","last_updated":"2026-08-13T02:05:14Z","snapshot_observed_at":"2026-08-19T12:26:39.886712Z","submitted_at":"2026-08-12T07:56:08Z","title":"Tight Nonasymptotic Local Convergence of Sinkhorn-Knopp","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-16T00:38:41.253824Z"},"links":{"cited_paper":"/paper/1609.06349","citing_paper":"/paper/2608.11760"},"observation_digest":"sha256:535eac739e9ad09f3c28d00904c46a8f00ed3f81309ca1afec192030a037d0eb","observation_id":"c8b40211-814d-453b-880b-500151ae4ca3","resolution":{"observed_at":"2026-08-16T00:38:41.253824Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:38:43.228966Z","title":"A direct tilde{O}(1/epsilon) iteration parallel al- gorithm for optimal transport.Advances in Neural Information Processing Systems, 32, 2019","venue":null,"work_id":"5c8e1adb-6a83-430b-8ffb-5b07c272786e","year":2019},"citing_paper":{"arxiv_id":"2608.11760","last_updated":"2026-08-13T02:05:14Z","snapshot_observed_at":"2026-08-19T12:26:39.886712Z","submitted_at":"2026-08-12T07:56:08Z","title":"Tight Nonasymptotic Local Convergence of Sinkhorn-Knopp","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-16T00:38:41.258571Z"},"links":{"citing_paper":"/paper/2608.11760"},"observation_digest":"sha256:9e298ca69b8202c34a0302d6637bfb8357650dfcf9f1b867e6b3a1322d4ce420","observation_id":"77119a49-6cca-4cb1-946a-497a31d7e4c3","resolution":{"observed_at":"2026-08-16T00:38:43.233669Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:38:43.217607Z","title":"A theorem of the alternative for multihomogeneous functions and its relationship to diagonal scaling of matrices.Linear Algebra and its Applications, 236:1–24, 1996","venue":null,"work_id":"03b74599-8892-48ee-a142-119099dc577f","year":1996},"citing_paper":{"arxiv_id":"2608.11760","last_updated":"2026-08-13T02:05:14Z","snapshot_observed_at":"2026-08-19T12:26:39.886712Z","submitted_at":"2026-08-12T07:56:08Z","title":"Tight Nonasymptotic Local Convergence of Sinkhorn-Knopp","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-16T00:38:41.264424Z"},"links":{"citing_paper":"/paper/2608.11760"},"observation_digest":"sha256:d3ad71b4f2f96f8e64493fb4ac3db65f0e7dd4b8f1fcadd40169cc0e107b4410","observation_id":"80931f80-6399-40b9-a9ae-697a4c94d356","resolution":{"observed_at":"2026-08-16T00:38:43.221652Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:38:43.207035Z","title":"On the rate of convergence of deterministic and randomized ras matrix scaling algorithms.Operations research letters, 14(5):237–244, 1993","venue":null,"work_id":"ff937986-4a25-4928-b2d1-fb94b8848773","year":1993},"citing_paper":{"arxiv_id":"2608.11760","last_updated":"2026-08-13T02:05:14Z","snapshot_observed_at":"2026-08-19T12:26:39.886712Z","submitted_at":"2026-08-12T07:56:08Z","title":"Tight Nonasymptotic Local Convergence of Sinkhorn-Knopp","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-16T00:38:41.269078Z"},"links":{"citing_paper":"/paper/2608.11760"},"observation_digest":"sha256:1220a010f4a02bfcd72f888b5c226735df136fed77a44cd5f185356fe3f844cd","observation_id":"5cf9d86e-da41-436b-80c9-ba9f61cf6f2d","resolution":{"observed_at":"2026-08-16T00:38:43.210769Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:38:43.195410Z","title":"Onthecomplexityofnonnegative-matrixscaling.Linear Algebra and its applications, 240:87–103, 1996","venue":null,"work_id":"e4800f41-e7a8-408e-8424-ebad20a2ae62","year":1996},"citing_paper":{"arxiv_id":"2608.11760","last_updated":"2026-08-13T02:05:14Z","snapshot_observed_at":"2026-08-19T12:26:39.886712Z","submitted_at":"2026-08-12T07:56:08Z","title":"Tight Nonasymptotic Local Convergence of Sinkhorn-Knopp","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-16T00:38:41.273458Z"},"links":{"citing_paper":"/paper/2608.11760"},"observation_digest":"sha256:eb410c72a6a91957946d50ca92f822f5e3ba66228541964000569129cd857ae7","observation_id":"1328d555-6629-4c90-979f-a850f604c555","resolution":{"observed_at":"2026-08-16T00:38:43.199552Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:38:43.055109Z","title":"On the complexity of general matrix scaling and entropy minimization via the ras algorithm.Mathematical Programming, 112(2):371–401, 2008","venue":null,"work_id":"3225ce5c-f5de-4cc0-b848-f64f5cb42460","year":2008},"citing_paper":{"arxiv_id":"2608.11760","last_updated":"2026-08-13T02:05:14Z","snapshot_observed_at":"2026-08-19T12:26:39.886712Z","submitted_at":"2026-08-12T07:56:08Z","title":"Tight Nonasymptotic Local Convergence of Sinkhorn-Knopp","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-16T00:38:41.277855Z"},"links":{"citing_paper":"/paper/2608.11760"},"observation_digest":"sha256:1314597e541e52fda1923588433d2f4da360f752c184c75da441a4c5a7e09568","observation_id":"3b95a39d-910c-44fd-acc6-7ae6df9d4596","resolution":{"observed_at":"2026-08-16T00:38:43.060881Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:38:43.036402Z","title":"The sinkhorn–knopp algorithm: convergence and applications.SIAM Journal on Matrix Analysis and Applications, 30(1):261–275, 2008","venue":null,"work_id":"29134e42-9bf6-4367-bf88-afcc2ff5a965","year":2008},"citing_paper":{"arxiv_id":"2608.11760","last_updated":"2026-08-13T02:05:14Z","snapshot_observed_at":"2026-08-19T12:26:39.886712Z","submitted_at":"2026-08-12T07:56:08Z","title":"Tight Nonasymptotic Local Convergence of Sinkhorn-Knopp","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-16T00:38:41.340444Z"},"links":{"citing_paper":"/paper/2608.11760"},"observation_digest":"sha256:6e281eac423db23df1ec4302e3bde1e85b6247979e1f4f3da30e5756492e828f","observation_id":"20785235-1683-4985-9e38-7cb9f73df252","resolution":{"observed_at":"2026-08-16T00:38:43.041179Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:38:42.979486Z","title":"A geometric structure of acceleration and its role in making gradients small fast.Advances in Neural Information Processing Systems, 34:11999–12012, 2021","venue":null,"work_id":"49208d12-e585-4e84-ab6b-181ed0824efc","year":2021},"citing_paper":{"arxiv_id":"2608.11760","last_updated":"2026-08-13T02:05:14Z","snapshot_observed_at":"2026-08-19T12:26:39.886712Z","submitted_at":"2026-08-12T07:56:08Z","title":"Tight Nonasymptotic Local Convergence of Sinkhorn-Knopp","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-16T00:38:41.432188Z"},"links":{"citing_paper":"/paper/2608.11760"},"observation_digest":"sha256:ba528d08e24c60ee11467cd0a2286f025f1b6d61f133d38e9e7db3e7e17ec7a6","observation_id":"c2270a30-7f7f-47dc-8309-466182a485b1","resolution":{"observed_at":"2026-08-16T00:38:43.009670Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:38:42.893562Z","title":"A note on overrelax- ation in the sinkhorn algorithm.Optimization Letters, 16(8):2209–2220, 2022","venue":null,"work_id":"d1b04a3c-49c2-4938-a493-01ba286600d1","year":2022},"citing_paper":{"arxiv_id":"2608.11760","last_updated":"2026-08-13T02:05:14Z","snapshot_observed_at":"2026-08-19T12:26:39.886712Z","submitted_at":"2026-08-12T07:56:08Z","title":"Tight Nonasymptotic Local Convergence of Sinkhorn-Knopp","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-16T00:38:41.437011Z"},"links":{"citing_paper":"/paper/2608.11760"},"observation_digest":"sha256:21179db9e44588388d5813ca9d8ac14c6965fda3b365b50c78859f110823a729","observation_id":"b72ca6ab-9436-47b7-9dab-dddde3c7d924","resolution":{"observed_at":"2026-08-16T00:38:42.935204Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:38:42.807230Z","title":"On efficient optimal transport: An analysis of greedy and accelerated mirror descent algorithms","venue":null,"work_id":"25daaca8-8a1c-4071-85ab-7ddb4f64ebdc","year":null},"citing_paper":{"arxiv_id":"2608.11760","last_updated":"2026-08-13T02:05:14Z","snapshot_observed_at":"2026-08-19T12:26:39.886712Z","submitted_at":"2026-08-12T07:56:08Z","title":"Tight Nonasymptotic Local Convergence of Sinkhorn-Knopp","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-16T00:38:41.442156Z"},"links":{"citing_paper":"/paper/2608.11760"},"observation_digest":"sha256:b56ed9e4e085783644a61a2f298d38f9127b725acc905a4c13b0bef61978fb52","observation_id":"c1e92cd9-fa80-42b5-8ea4-1badc9ccd2a8","resolution":{"observed_at":"2026-08-16T00:38:42.847817Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:38:42.774395Z","title":"A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents","venue":null,"work_id":"29a35b52-9f1e-4364-94b4-705595c411b4","year":1998},"citing_paper":{"arxiv_id":"2608.11760","last_updated":"2026-08-13T02:05:14Z","snapshot_observed_at":"2026-08-19T12:26:39.886712Z","submitted_at":"2026-08-12T07:56:08Z","title":"Tight Nonasymptotic Local Convergence of Sinkhorn-Knopp","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-16T00:38:41.451993Z"},"links":{"citing_paper":"/paper/2608.11760"},"observation_digest":"sha256:90c11664be3850529b5e140932f4e3bd262a5f1297f7aa81ec530c9fcb451006","observation_id":"1cf8e6a1-b002-4b3e-9239-f18a73b605cb","resolution":{"observed_at":"2026-08-16T00:38:42.780868Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:38:42.758245Z","title":"Softmax is $1/2$-lipschitz: A tight bound across all $\\ell_p$ norms.Transactions on Machine Learning Research, 2026","venue":null,"work_id":"ee0769c2-ebf1-4eb6-b2db-71f953a0ef1c","year":2026},"citing_paper":{"arxiv_id":"2608.11760","last_updated":"2026-08-13T02:05:14Z","snapshot_observed_at":"2026-08-19T12:26:39.886712Z","submitted_at":"2026-08-12T07:56:08Z","title":"Tight Nonasymptotic Local Convergence of Sinkhorn-Knopp","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-16T00:38:41.458851Z"},"links":{"citing_paper":"/paper/2608.11760"},"observation_digest":"sha256:061fc026ef88a9964fd2277ba88a368ed7655b5e019cd272f1a729e9eeb49c1b","observation_id":"3c60781c-5687-4db9-9e4d-bfb43a17098c","resolution":{"observed_at":"2026-08-16T00:38:42.763377Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:38:42.741355Z","title":"On complexity of matrix scaling.Linear Algebra and its Applica- tions, 302:435–460, 1999","venue":null,"work_id":"1a79a8d8-0f20-42df-bbb6-6043899a6bad","year":1999},"citing_paper":{"arxiv_id":"2608.11760","last_updated":"2026-08-13T02:05:14Z","snapshot_observed_at":"2026-08-19T12:26:39.886712Z","submitted_at":"2026-08-12T07:56:08Z","title":"Tight Nonasymptotic Local Convergence of Sinkhorn-Knopp","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-16T00:38:41.463705Z"},"links":{"citing_paper":"/paper/2608.11760"},"observation_digest":"sha256:449f103c3f19d08bdc7941e4346fc0148c3240fd1453df61fb5e532c1af855cc","observation_id":"54ec403b-9bf0-4bda-a22b-0cec84fa88ac","resolution":{"observed_at":"2026-08-16T00:38:42.746834Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:38:42.587435Z","title":"Springer Science & Business Media, 2013","venue":null,"work_id":"a66ee9a2-9463-44d7-8517-d089dc19d2ae","year":2013},"citing_paper":{"arxiv_id":"2608.11760","last_updated":"2026-08-13T02:05:14Z","snapshot_observed_at":"2026-08-19T12:26:39.886712Z","submitted_at":"2026-08-12T07:56:08Z","title":"Tight Nonasymptotic Local Convergence of Sinkhorn-Knopp","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-16T00:38:41.533312Z"},"links":{"citing_paper":"/paper/2608.11760"},"observation_digest":"sha256:2e0a5a59d79313cecd13a1460b7046bdcfd24c49f5be95e1115629571bf696b3","observation_id":"772f51ba-28e9-4807-a5c0-09ce3f1ce797","resolution":{"observed_at":"2026-08-16T00:38:42.677404Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:38:42.572375Z","title":"Quantum entropic regular- ization of matrix-valued optimal transport.European Journal of Applied Mathematics, 30(6):1079–1102,","venue":null,"work_id":"a53aa383-dca1-4ca4-9707-a0536d604c7e","year":null},"citing_paper":{"arxiv_id":"2608.11760","last_updated":"2026-08-13T02:05:14Z","snapshot_observed_at":"2026-08-19T12:26:39.886712Z","submitted_at":"2026-08-12T07:56:08Z","title":"Tight Nonasymptotic Local Convergence of Sinkhorn-Knopp","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-16T00:38:41.599592Z"},"links":{"citing_paper":"/paper/2608.11760"},"observation_digest":"sha256:c9df783c1427814cfee1d04948358293e619934d9a9d86602bee8d3489ee0a5d","observation_id":"820a360e-f1b8-4a4d-a0c3-8f8ccf68249d","resolution":{"observed_at":"2026-08-16T00:38:42.577941Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:38:42.556044Z","title":"Now Foundations and Trends, 2019","venue":null,"work_id":"71d976eb-2a64-4e2f-b845-fae7ba1a3ade","year":2019},"citing_paper":{"arxiv_id":"2608.11760","last_updated":"2026-08-13T02:05:14Z","snapshot_observed_at":"2026-08-19T12:26:39.886712Z","submitted_at":"2026-08-12T07:56:08Z","title":"Tight Nonasymptotic Local Convergence of Sinkhorn-Knopp","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-16T00:38:41.628457Z"},"links":{"citing_paper":"/paper/2608.11760"},"observation_digest":"sha256:940079dea793e156311d47ae6d9eaa456db8087236d680815f032409e01d690a","observation_id":"d9c6123c-5560-42b6-9694-97142f13fd03","resolution":{"observed_at":"2026-08-16T00:38:42.561188Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:38:42.499868Z","title":"On sinkhorn’s algorithm and choice modeling.Operations Research, 2025","venue":null,"work_id":"2a7b6fd6-213f-4215-a59b-98e5b0cfd90d","year":2025},"citing_paper":{"arxiv_id":"2608.11760","last_updated":"2026-08-13T02:05:14Z","snapshot_observed_at":"2026-08-19T12:26:39.886712Z","submitted_at":"2026-08-12T07:56:08Z","title":"Tight Nonasymptotic Local Convergence of Sinkhorn-Knopp","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-16T00:38:41.635037Z"},"links":{"citing_paper":"/paper/2608.11760"},"observation_digest":"sha256:a15a8c76035c4a6454e0d55515883c183ffcafadfe27f48da5e2b006638dfb7a","observation_id":"02efcd5e-a7a4-4480-91ae-264877a32bc0","resolution":{"observed_at":"2026-08-16T00:38:42.545427Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:38:42.445589Z","title":"Concerning nonnegative matrices and doubly stochastic matrices","venue":null,"work_id":"0e9b8a12-fe48-4991-9600-62b1e5f8209d","year":1967},"citing_paper":{"arxiv_id":"2608.11760","last_updated":"2026-08-13T02:05:14Z","snapshot_observed_at":"2026-08-19T12:26:39.886712Z","submitted_at":"2026-08-12T07:56:08Z","title":"Tight Nonasymptotic Local Convergence of Sinkhorn-Knopp","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-16T00:38:41.640680Z"},"links":{"citing_paper":"/paper/2608.11760"},"observation_digest":"sha256:3ed0dcbfd48d396edb2518e536ee105b10135fab8cd392e187b283a09e3241d4","observation_id":"36ec1e96-8d53-440a-9a7d-081f1bd43283","resolution":{"observed_at":"2026-08-16T00:38:42.451483Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:38:42.400317Z","title":"Exact worst-case convergence rates of the proximal gradient method for composite convex minimization.Journal of Optimization Theory and Appli- cations, 178(2):455–476, 2018","venue":null,"work_id":"b1aecd9f-68dd-415f-af2c-bdfded0ea6c0","year":2018},"citing_paper":{"arxiv_id":"2608.11760","last_updated":"2026-08-13T02:05:14Z","snapshot_observed_at":"2026-08-19T12:26:39.886712Z","submitted_at":"2026-08-12T07:56:08Z","title":"Tight Nonasymptotic Local Convergence of Sinkhorn-Knopp","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-16T00:38:41.648174Z"},"links":{"citing_paper":"/paper/2608.11760"},"observation_digest":"sha256:19237322a9e55574a8ce55211b300d049521e3d0c6316bcfbb7b5fafda5c6e59","observation_id":"e5a3fb97-d704-4bd5-a2df-ffd1fb6e70fe","resolution":{"observed_at":"2026-08-16T00:38:42.435255Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:38:42.307150Z","title":"Overrelaxed sinkhorn–knopp algorithm for regularized optimal transport.Algorithms, 14(5):143, 2021","venue":null,"work_id":"25930abf-5562-48f9-ab60-8479e99747c3","year":2021},"citing_paper":{"arxiv_id":"2608.11760","last_updated":"2026-08-13T02:05:14Z","snapshot_observed_at":"2026-08-19T12:26:39.886712Z","submitted_at":"2026-08-12T07:56:08Z","title":"Tight Nonasymptotic Local Convergence of Sinkhorn-Knopp","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-16T00:38:41.655828Z"},"links":{"citing_paper":"/paper/2608.11760"},"observation_digest":"sha256:a38c15d4f110daec3203b85d18b5c2c2b8694b5fc30bd72c9c5c20457a0fcc33","observation_id":"5305317b-277c-43d3-8c9d-72078ffcf8d5","resolution":{"observed_at":"2026-08-16T00:38:42.339642Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2512.24880","last_updated":"2026-01-05T16:51:18Z","snapshot_observed_at":"2026-08-03T01:54:33.526522Z","submitted_at":"2025-12-31T14:16:26Z","title":"mHC: Manifold-Constrained Hyper-Connections","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2512.24880","snapshot_observed_at":"2026-08-16T00:38:41.660700Z","title":"mhc: Manifold-constrained hyper-connections.arXiv preprint arXiv:2512.24880, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.11760","last_updated":"2026-08-13T02:05:14Z","snapshot_observed_at":"2026-08-19T12:26:39.886712Z","submitted_at":"2026-08-12T07:56:08Z","title":"Tight Nonasymptotic Local Convergence of Sinkhorn-Knopp","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-16T00:38:41.660700Z"},"links":{"cited_paper":"/paper/2512.24880","citing_paper":"/paper/2608.11760"},"observation_digest":"sha256:911614bc67bb1339729251a50f8c02aa5b7becb8d001f2fb99c896cac1b0360a","observation_id":"abec382e-cbe5-49da-9ca8-7a1bdb1d00bb","resolution":{"observed_at":"2026-08-16T00:38:41.660700Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2605.30267","last_updated":"2026-06-01T18:53:58Z","snapshot_observed_at":"2026-08-21T07:11:02.694564Z","submitted_at":"2026-05-28T17:29:12Z","title":"Accelerating Sinkhorn for Entropy-Regularized Optimal Transport","version":2},"cited_work":{"arxiv_id":"2605.30267","doi":null,"metadata_source":"pith","pith_arxiv_id":"2605.30267","snapshot_observed_at":"2026-08-16T00:38:41.809944Z","title":"Accelerating Sinkhorn for Entropy-Regularized Optimal Transport","venue":"math.OC","work_id":"5244434b-90f1-4793-93a2-68717519ff44","year":2026},"citing_paper":{"arxiv_id":"2608.11760","last_updated":"2026-08-13T02:05:14Z","snapshot_observed_at":"2026-08-19T12:26:39.886712Z","submitted_at":"2026-08-12T07:56:08Z","title":"Tight Nonasymptotic Local Convergence of Sinkhorn-Knopp","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-16T00:38:41.665526Z"},"links":{"cited_paper":"/paper/2605.30267","citing_paper":"/paper/2608.11760"},"observation_digest":"sha256:ccff2339c719c152cf20e9a61a503229b2ff7315837522a9f5bff02797740dc3","observation_id":"84becbd0-36d5-4b7d-bdb3-03b73b906139","resolution":{"observed_at":"2026-08-16T00:38:41.819465Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:38:42.283520Z","title":"For∆ 2, sinceℓ(u)is a quadratic function minimized atu−P −1∇ℓ(u), we have ∆2 =ℓ(u−P −1∇α(u))−ℓ(u−P −1∇ℓ(u)) = 1 2∥∇α(u)−∇ℓ(u)∥ 2 P−1 ≤ 1 2∥∇φ(u,v)−∇λ(u,v)∥ 2 S−1≤ 2 sε2","venue":null,"work_id":"5a2b9761-a54e-4c90-8ba9-221f8df4b68b","year":null},"citing_paper":{"arxiv_id":"2608.11760","last_updated":"2026-08-13T02:05:14Z","snapshot_observed_at":"2026-08-19T12:26:39.886712Z","submitted_at":"2026-08-12T07:56:08Z","title":"Tight Nonasymptotic Local Convergence of Sinkhorn-Knopp","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-16T00:38:41.703379Z"},"links":{"citing_paper":"/paper/2608.11760"},"observation_digest":"sha256:13e0a4934fc90f2ec84e3640c65403ce934199da87318a6cde0376fb75533608","observation_id":"89500fc2-f7bf-4853-92d5-0bc14335f66d","resolution":{"observed_at":"2026-08-16T00:38:42.293751Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:38:43.701406Z","title":"(cited on 2, 4, 7)","venue":null,"work_id":"606b7d21-25c5-4979-9824-3711591a28cf","year":2017},"citing_paper":{"arxiv_id":"2608.11760","last_updated":"2026-08-13T02:05:14Z","snapshot_observed_at":"2026-08-19T12:26:39.886712Z","submitted_at":"2026-08-12T07:56:08Z","title":"Tight Nonasymptotic Local Convergence of Sinkhorn-Knopp","version":2},"reference_index":901,"source":"pdf_text","source_observed_at":"2026-08-16T00:38:40.829298Z"},"links":{"citing_paper":"/paper/2608.11760"},"observation_digest":"sha256:9b2edf55723f68ae0b4455378da328fe96529dcdfdf3891d8156bbe3a346ca3e","observation_id":"50c3e2de-500b-4e63-af93-5435e438cd04","resolution":{"observed_at":"2026-08-16T00:38:43.705558Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:38:42.791003Z","title":"(cited on 4, 7, 16)","venue":null,"work_id":"28f6b178-624f-4a36-a932-83e35714df58","year":2019},"citing_paper":{"arxiv_id":"2608.11760","last_updated":"2026-08-13T02:05:14Z","snapshot_observed_at":"2026-08-19T12:26:39.886712Z","submitted_at":"2026-08-12T07:56:08Z","title":"Tight Nonasymptotic Local Convergence of Sinkhorn-Knopp","version":2},"reference_index":3991,"source":"pdf_text","source_observed_at":"2026-08-16T00:38:41.447245Z"},"links":{"citing_paper":"/paper/2608.11760"},"observation_digest":"sha256:29745fdc0b54c788b72d5ed184657f65c5bd216dfcba4b25d9e445eb6a914bca","observation_id":"783412e0-269e-45de-9b9b-ac1f9ad84495","resolution":{"observed_at":"2026-08-16T00:38:42.797238Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.11760","last_updated":"2026-08-13T02:05:14Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-19T12:26:39.886712Z","submitted_at":"2026-08-12T07:56:08Z","title":"Tight Nonasymptotic Local Convergence of Sinkhorn-Knopp"},"reference_resolution":{"displayed":43,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":4,"verified_fuzzy":36},"total_outbound_references":43},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 43 of 43 outbound references and 0 inbound Pith citation observations for arXiv:2608.11760."}