{"as_of":"2026-08-08T08:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8f6e6493435d8dbc5678ba2fa2de59c179de8ab261fb281ff6e777db3f0f5b61","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:27:20.216240Z","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-04T19:00:05.197893Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2206.13472","last_updated":"2022-06-27T17:25:47Z","snapshot_observed_at":"2026-07-06T13:25:09.618771Z","submitted_at":"2022-06-27T17:25:47Z","title":"On the sample complexity of entropic optimal transport","version":1},"cited_work":{"arxiv_id":"2206.13472","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2206.13472","snapshot_observed_at":"2026-07-04T19:00:05.197893Z","title":"Rigollet and A","venue":null,"work_id":"dddd8a73-99a6-4b8c-9950-c1f981376282","year":2022},"citing_paper":{"arxiv_id":"2412.12007","last_updated":"2026-04-29T13:38:51Z","snapshot_observed_at":"2026-07-06T20:07:54.727859Z","submitted_at":"2024-12-16T17:34:04Z","title":"The entropic optimal (self-)transport problem: Limit distributions for decreasing regularization with application to score function estimation","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-23T06:56:41.037390Z"},"links":{"cited_paper":"/paper/2206.13472","citing_paper":"/paper/2412.12007"},"observation_digest":"sha256:37cb60d495ecd8793e84a2a2eafd018373dcbf710e614055ade4d50706c3a7f4","observation_id":"8636d267-cf72-464d-86bc-15e951fc086b","resolution":{"observed_at":"2026-05-23T06:57:40.336185Z","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":"2206.13472","last_updated":"2022-06-27T17:25:47Z","snapshot_observed_at":"2026-07-06T13:25:09.618771Z","submitted_at":"2022-06-27T17:25:47Z","title":"On the sample complexity of entropic optimal transport","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.13472","snapshot_observed_at":"2026-08-07T14:27:20.216240Z","title":"Rigollet and A","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.19104","last_updated":"2026-07-13T21:37:54Z","snapshot_observed_at":"2026-08-07T14:18:06.386934Z","submitted_at":"2025-05-25T11:45:36Z","title":"Distributional Limit Theory for Optimal Transport","version":2},"reference_index":100,"source":"pdf_text","source_observed_at":"2026-08-07T14:27:20.216240Z"},"links":{"cited_paper":"/paper/2206.13472","citing_paper":"/paper/2505.19104"},"observation_digest":"sha256:9414e46dcf5ece6ed8509f9ff7ac64c0fb275b1d5b9c6b335bd2c32524885af4","observation_id":"790c1d88-5a61-468e-9e3a-cd57f048f0c3","resolution":{"observed_at":"2026-08-07T14:27:20.216240Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2206.13472","last_updated":"2022-06-27T17:25:47Z","snapshot_observed_at":"2026-07-06T13:25:09.618771Z","submitted_at":"2022-06-27T17:25:47Z","title":"On the sample complexity of entropic optimal transport","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.13472","snapshot_observed_at":"2026-08-03T11:18:04.686984Z","title":"Rigollet and A","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2601.07144","last_updated":"2026-06-03T09:10:56Z","snapshot_observed_at":"2026-08-07T18:25:10.974143Z","submitted_at":"2026-01-12T02:26:32Z","title":"Optimal Transport under Group Fairness Constraints","version":3},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-03T11:18:04.686984Z"},"links":{"cited_paper":"/paper/2206.13472","citing_paper":"/paper/2601.07144"},"observation_digest":"sha256:3e9df4d74819775fe6dc38fb78d8802072f93178dd769fff1ae23efa617cc612","observation_id":"e102520c-13da-4785-b4bb-a0293b42241f","resolution":{"observed_at":"2026-08-03T11:18:04.686984Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2206.13472","last_updated":"2022-06-27T17:25:47Z","snapshot_observed_at":"2026-07-06T13:25:09.618771Z","submitted_at":"2022-06-27T17:25:47Z","title":"On the sample complexity of entropic optimal transport","version":1},"cited_work":{"arxiv_id":"2206.13472","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2206.13472","snapshot_observed_at":"2026-07-04T19:00:05.197893Z","title":"Rigollet and A","venue":null,"work_id":"dddd8a73-99a6-4b8c-9950-c1f981376282","year":2022},"citing_paper":{"arxiv_id":"2604.22670","last_updated":"2026-07-08T18:28:29Z","snapshot_observed_at":"2026-07-12T23:17:30.210371Z","submitted_at":"2026-04-24T15:48:55Z","title":"Curvature of optimal transport with respect to the cost and applications to inverse optimal transport","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-08T11:00:01.736721Z"},"links":{"cited_paper":"/paper/2206.13472","citing_paper":"/paper/2604.22670"},"observation_digest":"sha256:c83074ceaf9e4278c06fbed7805ec7827a955eecb7394a78cff9e7e477ac7379","observation_id":"b6f3ff2c-ba0b-416e-b02d-d3acfa6732d2","resolution":{"observed_at":"2026-05-11T19:46:15.614110Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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":"2206.13472","last_updated":"2022-06-27T17:25:47Z","snapshot_observed_at":"2026-07-06T13:25:09.618771Z","submitted_at":"2022-06-27T17:25:47Z","title":"On the sample complexity of entropic optimal transport","version":1},"cited_work":{"arxiv_id":"2206.13472","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2206.13472","snapshot_observed_at":"2026-07-04T19:00:05.197893Z","title":"Rigollet and A","venue":null,"work_id":"dddd8a73-99a6-4b8c-9950-c1f981376282","year":2022},"citing_paper":{"arxiv_id":"2606.24987","last_updated":"2026-06-23T14:25:47Z","snapshot_observed_at":"2026-08-06T09:36:39.711215Z","submitted_at":"2026-06-23T14:25:47Z","title":"Sample complexity of unbalanced entropic OT","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-25T22:09:11.474342Z"},"links":{"cited_paper":"/paper/2206.13472","citing_paper":"/paper/2606.24987"},"observation_digest":"sha256:95df38d8055850d8056abc042a16d4f251023e44c4b6a5b467114f3ed12ab312","observation_id":"b15cd607-e3f8-49f5-bf73-7d9904ffeefd","resolution":{"observed_at":"2026-07-04T19:00:05.199253Z","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":"2206.13472","last_updated":"2022-06-27T17:25:47Z","snapshot_observed_at":"2026-07-06T13:25:09.618771Z","submitted_at":"2022-06-27T17:25:47Z","title":"On the sample complexity of entropic optimal transport","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.13472","snapshot_observed_at":"2026-08-04T06:35:56.206526Z","title":"arXiv preprint arXiv:2206.13472 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.02487","last_updated":"2026-08-03T16:53:29Z","snapshot_observed_at":"2026-08-08T06:32:19.521130Z","submitted_at":"2026-08-03T16:53:29Z","title":"Computational and Statistical Guarantees of the \\textit{c}-Rectified flow","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-04T06:35:56.206526Z"},"links":{"cited_paper":"/paper/2206.13472","citing_paper":"/paper/2608.02487"},"observation_digest":"sha256:fd7bfa7ad222af80d9dac206ce01a1a8da623898150f1835ca85fcf7786cee10","observation_id":"3d2f3075-f2b2-4e7f-9a65-6f1125532e34","resolution":{"observed_at":"2026-08-04T06:35:56.206526Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2206.13472/citation-record","integrity":"/paper/2206.13472/integrity","json":"/paper/2206.13472/citation-record.json","paper":"/paper/2206.13472"},"outbound":[],"paper":{"arxiv_id":"2206.13472","last_updated":"2022-06-27T17:25:47Z","latest_version":1,"primary_category":"math.ST","snapshot_observed_at":"2026-07-06T13:25:09.618771Z","submitted_at":"2022-06-27T17:25:47Z","title":"On the sample complexity of entropic 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 6 inbound Pith citation observations for arXiv:2206.13472."}