{"as_of":"2026-08-08T12:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0f75cd2daa2d98bc1b2ea1af3ff01f871e1c868097f1bdd52ee6c68a30657092","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T12:11:22.380069Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-02T08:06:47.654636Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2305.14939","last_updated":"2023-10-19T14:17:35Z","snapshot_observed_at":"2026-07-06T15:32:22.277926Z","submitted_at":"2023-05-24T09:23:33Z","title":"Improved Complexity Analysis of the Sinkhorn and Greenkhorn Algorithms for Optimal Transport","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.14939","snapshot_observed_at":"2026-08-07T12:11:22.380069Z","title":"Improved complexity analysis of the sinkhorn and greenkhorn algorithms for optimal transport.arXiv preprint arXiv:2305.14939, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.00407","last_updated":"2025-05-31T05:54:49Z","snapshot_observed_at":"2026-08-07T12:03:48.254921Z","submitted_at":"2025-05-31T05:54:49Z","title":"Bias as a Virtue: Rethinking Generalization under Distribution Shifts","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T12:11:22.380069Z"},"links":{"cited_paper":"/paper/2305.14939","citing_paper":"/paper/2506.00407"},"observation_digest":"sha256:9331f3f31be4a361d5baf4519d99b51c8c8c7e7ca95eecd2fb20e3682d2cd737","observation_id":"94116843-bba6-49b9-a839-192d269fd5bc","resolution":{"observed_at":"2026-08-07T12:11:22.380069Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.14939","last_updated":"2023-10-19T14:17:35Z","snapshot_observed_at":"2026-07-06T15:32:22.277926Z","submitted_at":"2023-05-24T09:23:33Z","title":"Improved Complexity Analysis of the Sinkhorn and Greenkhorn Algorithms for Optimal Transport","version":2},"cited_work":{"arxiv_id":"2305.14939","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2305.14939","snapshot_observed_at":"2026-07-02T08:06:47.654636Z","title":"Improved complexity analysis of the sinkhorn and greenkhorn algorithms for optimal transport.arXiv preprint arXiv:2305.14939","venue":null,"work_id":"0d92b792-26da-42be-8b92-7772db7ab5d6","year":null},"citing_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},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-14T22:26:58.414162Z"},"links":{"cited_paper":"/paper/2305.14939","citing_paper":"/paper/2604.03787"},"observation_digest":"sha256:36a3df9c6ff176017f0d1e48769df5cb28720db71939dbabd6766dca6f4e1aa1","observation_id":"ca50bd44-02a5-4f33-8424-ee4c9125c170","resolution":{"observed_at":"2026-05-14T22:28:04.031912Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.14939","last_updated":"2023-10-19T14:17:35Z","snapshot_observed_at":"2026-07-06T15:32:22.277926Z","submitted_at":"2023-05-24T09:23:33Z","title":"Improved Complexity Analysis of the Sinkhorn and Greenkhorn Algorithms for Optimal Transport","version":2},"cited_work":{"arxiv_id":"2305.14939","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2305.14939","snapshot_observed_at":"2026-07-02T08:06:47.654636Z","title":"Improved complexity analysis of the sinkhorn and greenkhorn algorithms for optimal transport.arXiv preprint arXiv:2305.14939","venue":null,"work_id":"0d92b792-26da-42be-8b92-7772db7ab5d6","year":null},"citing_paper":{"arxiv_id":"2606.28973","last_updated":"2026-06-27T15:25:34Z","snapshot_observed_at":"2026-07-07T00:02:57.622708Z","submitted_at":"2026-06-27T15:25:34Z","title":"Sharp $O(1/k)$ convergence rate for the Sinkhorn algorithm via a local analysis","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-06-30T08:38:03.985543Z"},"links":{"cited_paper":"/paper/2305.14939","citing_paper":"/paper/2606.28973"},"observation_digest":"sha256:8f640bf7a0a0db242c02b8f35b517803c63dc6d7154b6a3b9458c32589c10dc0","observation_id":"a507f343-bb2b-4490-b2d5-68b277a4a270","resolution":{"observed_at":"2026-06-30T08:44:27.716153Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.14939","last_updated":"2023-10-19T14:17:35Z","snapshot_observed_at":"2026-07-06T15:32:22.277926Z","submitted_at":"2023-05-24T09:23:33Z","title":"Improved Complexity Analysis of the Sinkhorn and Greenkhorn Algorithms for Optimal Transport","version":2},"cited_work":{"arxiv_id":"2305.14939","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2305.14939","snapshot_observed_at":"2026-07-02T08:06:47.654636Z","title":"Improved complexity analysis of the sinkhorn and greenkhorn algorithms for optimal transport.arXiv preprint arXiv:2305.14939","venue":null,"work_id":"0d92b792-26da-42be-8b92-7772db7ab5d6","year":null},"citing_paper":{"arxiv_id":"2607.00665","last_updated":"2026-07-01T09:13:24Z","snapshot_observed_at":"2026-08-03T18:18:39.283181Z","submitted_at":"2026-07-01T09:13:24Z","title":"Effective dynamics of the Sinkhorn algorithm in the regime of low entropy regularization","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-07-02T08:05:55.418491Z"},"links":{"cited_paper":"/paper/2305.14939","citing_paper":"/paper/2607.00665"},"observation_digest":"sha256:2a04ecc5a0443addad81283f766780815ec567b18f31539c820dc2b53b891102","observation_id":"5e26e19f-d97e-47db-8a41-672dab8ad21e","resolution":{"observed_at":"2026-07-02T08:06:47.655866Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2305.14939/citation-record","integrity":"/paper/2305.14939/integrity","json":"/paper/2305.14939/citation-record.json","paper":"/paper/2305.14939"},"outbound":[],"paper":{"arxiv_id":"2305.14939","last_updated":"2023-10-19T14:17:35Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-07-06T15:32:22.277926Z","submitted_at":"2023-05-24T09:23:33Z","title":"Improved Complexity Analysis of the Sinkhorn and Greenkhorn Algorithms for Optimal Transport"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2305.14939."}