{"as_of":"2026-08-07T20:20:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d4cabc22d3d43bc5650e1554452f02aead10954bc7e749080a8f71b53cbdfe62","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-07T06:34:17.273281+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-06T23:57:57.612044Z","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.595617Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2007.00976","last_updated":"2020-07-02T09:22:23Z","snapshot_observed_at":"2026-07-06T09:34:43.244912Z","submitted_at":"2020-07-02T09:22:23Z","title":"Optimal Transport losses and Sinkhorn algorithm with general convex regularization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.00976","snapshot_observed_at":"2026-08-06T23:57:57.612044Z","title":"Optimal transport losses and sinkhorn algorithm with general convex regular- ization.arXiv preprint arXiv:2007.00976, 2020","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2506.15524","last_updated":"2025-06-18T14:58:49Z","snapshot_observed_at":"2026-08-06T23:51:31.146998Z","submitted_at":"2025-06-18T14:58:49Z","title":"NTIRE 2025 Image Shadow Removal Challenge Report","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T23:57:57.612044Z"},"links":{"cited_paper":"/paper/2007.00976","citing_paper":"/paper/2506.15524"},"observation_digest":"sha256:831e659fb03b43627e5c6093d477eb735794e911bb52b6920f2bb25e1f9a0b14","observation_id":"694b3c7c-6f5d-482d-8004-a875d5c9d834","resolution":{"observed_at":"2026-08-06T23:57:57.612044Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.00976","last_updated":"2020-07-02T09:22:23Z","snapshot_observed_at":"2026-07-06T09:34:43.244912Z","submitted_at":"2020-07-02T09:22:23Z","title":"Optimal Transport losses and Sinkhorn algorithm with general convex regularization","version":1},"cited_work":{"arxiv_id":"2007.00976","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2007.00976","snapshot_observed_at":"2026-07-02T08:06:47.595617Z","title":"Optimal transport losses and sinkhorn algorithm with general convex regularization","venue":null,"work_id":"c24abdb1-1025-4f13-9c0a-c1cc5d849439","year":2007},"citing_paper":{"arxiv_id":"2604.12996","last_updated":"2026-04-14T17:29:33Z","snapshot_observed_at":"2026-07-06T23:01:05.634599Z","submitted_at":"2026-04-14T17:29:33Z","title":"Equivalence of optimal transport problems to regularization on the family of f-divergences","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-10T13:50:32.613011Z"},"links":{"cited_paper":"/paper/2007.00976","citing_paper":"/paper/2604.12996"},"observation_digest":"sha256:ed530c31feec5aae8cad9f2ebde7acd6319a1efec94a76942f066f1264a9c2ce","observation_id":"0895210c-cbc9-4283-9732-20f75d4bd623","resolution":{"observed_at":"2026-05-10T14:10:29.080422Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.00976","last_updated":"2020-07-02T09:22:23Z","snapshot_observed_at":"2026-07-06T09:34:43.244912Z","submitted_at":"2020-07-02T09:22:23Z","title":"Optimal Transport losses and Sinkhorn algorithm with general convex regularization","version":1},"cited_work":{"arxiv_id":"2007.00976","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2007.00976","snapshot_observed_at":"2026-07-02T08:06:47.595617Z","title":"Optimal transport losses and sinkhorn algorithm with general convex regularization","venue":null,"work_id":"c24abdb1-1025-4f13-9c0a-c1cc5d849439","year":2007},"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":66,"source":"arxiv_source","source_observed_at":"2026-06-30T08:38:03.985543Z"},"links":{"cited_paper":"/paper/2007.00976","citing_paper":"/paper/2606.28973"},"observation_digest":"sha256:8b3d47c30532f3825caa122cdc26371180b3932f88b49ecf766a362d552ef444","observation_id":"5146a1fd-4eea-4984-83a1-f8a6f0b3e4a5","resolution":{"observed_at":"2026-06-30T08:44:27.727025Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.00976","last_updated":"2020-07-02T09:22:23Z","snapshot_observed_at":"2026-07-06T09:34:43.244912Z","submitted_at":"2020-07-02T09:22:23Z","title":"Optimal Transport losses and Sinkhorn algorithm with general convex regularization","version":1},"cited_work":{"arxiv_id":"2007.00976","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2007.00976","snapshot_observed_at":"2026-07-02T08:06:47.595617Z","title":"Optimal transport losses and sinkhorn algorithm with general convex regularization","venue":null,"work_id":"c24abdb1-1025-4f13-9c0a-c1cc5d849439","year":2007},"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":65,"source":"arxiv_source","source_observed_at":"2026-07-02T08:05:55.418491Z"},"links":{"cited_paper":"/paper/2007.00976","citing_paper":"/paper/2607.00665"},"observation_digest":"sha256:7d2ea6cc3269ea15aea500a0a2f2d32a19adc51d7cfb9e6bde52bdf9f9db1b8a","observation_id":"49831db4-2857-40dd-9f0e-ee08031344da","resolution":{"observed_at":"2026-07-02T08:06:47.597052Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2007.00976/citation-record","integrity":"/paper/2007.00976/integrity","json":"/paper/2007.00976/citation-record.json","paper":"/paper/2007.00976"},"outbound":[],"paper":{"arxiv_id":"2007.00976","last_updated":"2020-07-02T09:22:23Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-07-06T09:34:43.244912Z","submitted_at":"2020-07-02T09:22:23Z","title":"Optimal Transport losses and Sinkhorn algorithm with general convex regularization"},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2007.00976."}