{"as_of":"2026-08-12T03:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:727b50980d714def56ff43fed11e58f1012404f7721a6795fb7d9bf650576346","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-11T06:34:44.6726+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-10T21:19:44.201523Z","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.191907Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2106.01963","last_updated":"2021-06-03T16:10:42Z","snapshot_observed_at":"2026-08-11T11:48:41.238766Z","submitted_at":"2021-06-03T16:10:42Z","title":"A Survey on Optimal Transport for Machine Learning: Theory and Applications","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.01963","snapshot_observed_at":"2026-08-10T21:19:44.201523Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.05635","last_updated":"2025-01-10T00:42:27Z","snapshot_observed_at":"2026-08-10T21:10:29.734756Z","submitted_at":"2025-01-10T00:42:27Z","title":"Enhancing Unsupervised Graph Few-shot Learning via Set Functions and Optimal Transport","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-10T21:19:44.201523Z"},"links":{"cited_paper":"/paper/2106.01963","citing_paper":"/paper/2501.05635"},"observation_digest":"sha256:b2dbcce0c02f10be3e7e8ea98a9dbfb88cf18527ac919f8fb785dbb21cd4ebb4","observation_id":"68304f13-236b-4a05-b862-d85d62b85c6f","resolution":{"observed_at":"2026-08-10T21:19:44.201523Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.01963","last_updated":"2021-06-03T16:10:42Z","snapshot_observed_at":"2026-08-11T11:48:41.238766Z","submitted_at":"2021-06-03T16:10:42Z","title":"A Survey on Optimal Transport for Machine Learning: Theory and Applications","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.01963","snapshot_observed_at":"2026-08-10T04:31:56.121267Z","title":"A Survey on Optimal Transport for Machine Learning: Theory and Applications","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.18650","last_updated":"2025-01-29T21:29:25Z","snapshot_observed_at":"2026-08-11T12:42:44.444744Z","submitted_at":"2025-01-29T21:29:25Z","title":"Constructing Cell-type Taxonomy by Optimal Transport with Relaxed Marginal Constraints","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-10T04:31:56.121267Z"},"links":{"cited_paper":"/paper/2106.01963","citing_paper":"/paper/2501.18650"},"observation_digest":"sha256:b2437db73940256fd0f00cf8035ab98517927bd5f81fb8df6287f32588183711","observation_id":"4d062bc7-8048-4a00-92d0-fbda901ce116","resolution":{"observed_at":"2026-08-10T04:31:56.121267Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.01963","last_updated":"2021-06-03T16:10:42Z","snapshot_observed_at":"2026-08-11T11:48:41.238766Z","submitted_at":"2021-06-03T16:10:42Z","title":"A Survey on Optimal Transport for Machine Learning: Theory and Applications","version":1},"cited_work":{"arxiv_id":"2106.01963","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2106.01963","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"C., Pereira, L","venue":null,"work_id":"61c27793-cde9-496a-b903-11c7895a97c8","year":2021},"citing_paper":{"arxiv_id":"2502.03749","last_updated":"2026-05-11T17:00:21Z","snapshot_observed_at":"2026-07-06T20:32:00.585460Z","submitted_at":"2025-02-06T03:21:48Z","title":"PINS: Proximal Iterations with Sparse Newton and Sinkhorn for Optimal Transport","version":2},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-05-23T03:25:37.710821Z"},"links":{"cited_paper":"/paper/2106.01963","citing_paper":"/paper/2502.03749"},"observation_digest":"sha256:fab3cf3207c6a7a800dc51243ef7a16577e1ebd9725b183c0516686632ce51cd","observation_id":"301fb68a-482d-425c-a773-8bb9185f6ce2","resolution":{"observed_at":"2026-05-23T03:27:27.193827Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.01963","last_updated":"2021-06-03T16:10:42Z","snapshot_observed_at":"2026-08-11T11:48:41.238766Z","submitted_at":"2021-06-03T16:10:42Z","title":"A Survey on Optimal Transport for Machine Learning: Theory and Applications","version":1},"cited_work":{"arxiv_id":"2106.01963","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2106.01963","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"C., Pereira, L","venue":null,"work_id":"61c27793-cde9-496a-b903-11c7895a97c8","year":2021},"citing_paper":{"arxiv_id":"2509.14521","last_updated":"2026-05-18T12:21:35Z","snapshot_observed_at":"2026-08-01T20:02:47.007665Z","submitted_at":"2025-09-18T01:28:03Z","title":"Geometry-Aware Decentralized Sinkhorn for Wasserstein Barycenters","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-21T23:08:08.096620Z"},"links":{"cited_paper":"/paper/2106.01963","citing_paper":"/paper/2509.14521"},"observation_digest":"sha256:ca502053fcaa309722a2cced94fdc41e61671cb3b7498c2908a8ab8a1d7efd88","observation_id":"7e36de4f-fe84-447f-b1d8-2b60418dd28d","resolution":{"observed_at":"2026-05-21T23:10:44.719476Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2106.01963/citation-record","integrity":"/paper/2106.01963/integrity","json":"/paper/2106.01963/citation-record.json","paper":"/paper/2106.01963"},"outbound":[],"paper":{"arxiv_id":"2106.01963","last_updated":"2021-06-03T16:10:42Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-11T11:48:41.238766Z","submitted_at":"2021-06-03T16:10:42Z","title":"A Survey on Optimal Transport for Machine Learning: Theory and Applications"},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2106.01963."}