{"as_of":"2026-08-21T18:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:30c5352599c1fababbb5875462926fba79c57167d6a10903b684dccc749e58b7","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:35.107120Z","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.616027Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2307.08507","last_updated":"2025-06-03T15:40:27Z","snapshot_observed_at":"2026-08-16T15:15:40.737752Z","submitted_at":"2023-07-17T14:09:43Z","title":"Efficient and Accurate Optimal Transport with Mirror Descent and Conjugate Gradients","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.08507","snapshot_observed_at":"2026-08-15T17:04:35.107120Z","title":", Jepson , A.D","venue":null,"work_id":null,"year":2023},"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":36,"source":"arxiv_source","source_observed_at":"2026-08-15T17:04:35.107120Z"},"links":{"cited_paper":"/paper/2307.08507","citing_paper":"/paper/2508.17641"},"observation_digest":"sha256:242672ca6295188c4b7d6a1407365d71fa532a31d772e80a642537925e8a80d3","observation_id":"930f020b-8c55-4ce3-a227-d8ac2c99e4af","resolution":{"observed_at":"2026-08-15T17:04:35.107120Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.08507","last_updated":"2025-06-03T15:40:27Z","snapshot_observed_at":"2026-08-16T15:15:40.737752Z","submitted_at":"2023-07-17T14:09:43Z","title":"Efficient and Accurate Optimal Transport with Mirror Descent and Conjugate Gradients","version":4},"cited_work":{"arxiv_id":"2307.08507","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2307.08507","snapshot_observed_at":"2026-07-02T08:06:47.616027Z","title":"arXiv preprint arXiv:2307.08507 , year=","venue":null,"work_id":"cc9b2c8f-af15-4576-949c-6b15015d3dbf","year":null},"citing_paper":{"arxiv_id":"2606.28973","last_updated":"2026-06-27T15:25:34Z","snapshot_observed_at":"2026-08-14T11:44:41.800324Z","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":47,"source":"arxiv_source","source_observed_at":"2026-06-30T08:38:03.985543Z"},"links":{"cited_paper":"/paper/2307.08507","citing_paper":"/paper/2606.28973"},"observation_digest":"sha256:868e8f2eae1b05561cb3f33d742671e2e2197b8b56d296f736b8168ab41982be","observation_id":"15d560c9-4570-484e-ac85-075a1a73b183","resolution":{"observed_at":"2026-06-30T08:44:27.688899Z","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":"2307.08507","last_updated":"2025-06-03T15:40:27Z","snapshot_observed_at":"2026-08-16T15:15:40.737752Z","submitted_at":"2023-07-17T14:09:43Z","title":"Efficient and Accurate Optimal Transport with Mirror Descent and Conjugate Gradients","version":4},"cited_work":{"arxiv_id":"2307.08507","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2307.08507","snapshot_observed_at":"2026-07-02T08:06:47.616027Z","title":"arXiv preprint arXiv:2307.08507 , year=","venue":null,"work_id":"cc9b2c8f-af15-4576-949c-6b15015d3dbf","year":null},"citing_paper":{"arxiv_id":"2607.00665","last_updated":"2026-07-01T09:13:24Z","snapshot_observed_at":"2026-08-14T06:32:55.348416Z","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":46,"source":"arxiv_source","source_observed_at":"2026-07-02T08:05:55.418491Z"},"links":{"cited_paper":"/paper/2307.08507","citing_paper":"/paper/2607.00665"},"observation_digest":"sha256:51c2de21a6645534b2c7895bcee21847982c0a72d00c94e02fd0f4c31167c613","observation_id":"1390d9cb-82a9-4669-8126-f53ab1eba961","resolution":{"observed_at":"2026-07-02T08:06:47.617307Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2307.08507/citation-record","integrity":"/paper/2307.08507/integrity","json":"/paper/2307.08507/citation-record.json","paper":"/paper/2307.08507"},"outbound":[],"paper":{"arxiv_id":"2307.08507","last_updated":"2025-06-03T15:40:27Z","latest_version":4,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T15:15:40.737752Z","submitted_at":"2023-07-17T14:09:43Z","title":"Efficient and Accurate Optimal Transport with Mirror Descent and Conjugate Gradients"},"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:2307.08507."}