{"as_of":"2026-08-21T16:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5c2b41ee1c26f17d45dae5cf694b1036f361dbe36c7f7f338079041afa96f30a","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T17:04:34.992409Z","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-05-23T03:27:27.195214Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2403.05054","last_updated":"2024-03-08T05:01:43Z","snapshot_observed_at":"2026-08-21T14:47:16.566029Z","submitted_at":"2024-03-08T05:01:43Z","title":"A Sinkhorn-type Algorithm for Constrained Optimal Transport","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.05054","snapshot_observed_at":"2026-08-11T23:01:21.120294Z","title":"A sinkhorn-type algorithm for constrained optimal transport","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.03120","last_updated":"2025-01-12T08:12:17Z","snapshot_observed_at":"2026-08-16T18:49:11.102998Z","submitted_at":"2024-12-04T08:39:45Z","title":"Sinkhorn Algorithm for Sequentially Composed Optimal Transports","version":4},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-11T23:01:21.120294Z"},"links":{"cited_paper":"/paper/2403.05054","citing_paper":"/paper/2412.03120"},"observation_digest":"sha256:79d5387bca5b1ec1372bad0d89d68b012ea9c53ab65126518414086c0b1e814f","observation_id":"28ea866a-78bc-48de-81e7-bf7ea148ec16","resolution":{"observed_at":"2026-08-11T23:01:21.120294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.05054","last_updated":"2024-03-08T05:01:43Z","snapshot_observed_at":"2026-08-21T14:47:16.566029Z","submitted_at":"2024-03-08T05:01:43Z","title":"A Sinkhorn-type Algorithm for Constrained Optimal Transport","version":1},"cited_work":{"arxiv_id":"2403.05054","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2403.05054","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"K., Xiao, T., and Ying, L","venue":null,"work_id":"6b21fe95-310d-44f9-b70c-365682699c5f","year":2024},"citing_paper":{"arxiv_id":"2502.03749","last_updated":"2026-05-11T17:00:21Z","snapshot_observed_at":"2026-08-17T01:22:08.307783Z","submitted_at":"2025-02-06T03:21:48Z","title":"PINS: Proximal Iterations with Sparse Newton and Sinkhorn for Optimal Transport","version":2},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-05-23T03:25:37.710821Z"},"links":{"cited_paper":"/paper/2403.05054","citing_paper":"/paper/2502.03749"},"observation_digest":"sha256:e3736e9375fb0807def55d25554c73d00a34d30a7ba1041f71bd0b543e218391","observation_id":"c983079a-e496-4565-9b31-67dfbec2ead1","resolution":{"observed_at":"2026-05-23T03:27:27.196781Z","resolver_source":"arxiv_id","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":"2403.05054","last_updated":"2024-03-08T05:01:43Z","snapshot_observed_at":"2026-08-21T14:47:16.566029Z","submitted_at":"2024-03-08T05:01:43Z","title":"A Sinkhorn-type Algorithm for Constrained Optimal Transport","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.05054","snapshot_observed_at":"2026-08-15T17:04:34.992409Z","title":", Rahmanian , H","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.17641","last_updated":"2025-08-25T04:07:40Z","snapshot_observed_at":"2026-08-21T09:44:38.719903Z","submitted_at":"2025-08-25T04:07:40Z","title":"An efficient algorithm for entropic optimal transport under martingale-type constraints","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-15T17:04:34.992409Z"},"links":{"cited_paper":"/paper/2403.05054","citing_paper":"/paper/2508.17641"},"observation_digest":"sha256:32d1438a09becb011cef2002681002d6adb22b3de3fa4e0deb9583fbc913c8c6","observation_id":"5764e6da-35f3-431b-9fec-7ed3581d0d0d","resolution":{"observed_at":"2026-08-15T17:04:34.992409Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2403.05054/citation-record","integrity":"/paper/2403.05054/integrity","json":"/paper/2403.05054/citation-record.json","paper":"/paper/2403.05054"},"outbound":[],"paper":{"arxiv_id":"2403.05054","last_updated":"2024-03-08T05:01:43Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-21T14:47:16.566029Z","submitted_at":"2024-03-08T05:01:43Z","title":"A Sinkhorn-type Algorithm for Constrained 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-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 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2403.05054."}