{"as_of":"2026-08-09T05:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4ef0ac134ac60f21d86c74a9ded1d12993203598869a60cce3d19bfe94b60e0f","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:57:54.022439Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-07T14:57:56.677019Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2201.03949","last_updated":"2022-01-11T13:52:34Z","snapshot_observed_at":"2026-08-07T05:18:08.853325Z","submitted_at":"2022-01-11T13:52:34Z","title":"Entropic Optimal Transport in Random Graphs","version":1},"cited_work":{"arxiv_id":"2201.03949","doi":null,"metadata_source":"pith","pith_arxiv_id":"2201.03949","snapshot_observed_at":"2026-08-07T14:57:56.677019Z","title":"Entropic Optimal Transport in Random Graphs","venue":"stat.ML","work_id":"f090c2fd-d78e-4546-b6e4-3495960a6f2f","year":2022},"citing_paper":{"arxiv_id":"2505.17291","last_updated":"2025-05-22T21:16:22Z","snapshot_observed_at":"2026-08-08T14:20:30.821392Z","submitted_at":"2025-05-22T21:16:22Z","title":"Optimal Transport with Heterogeneously Missing Data","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T14:57:54.022439Z"},"links":{"cited_paper":"/paper/2201.03949","citing_paper":"/paper/2505.17291"},"observation_digest":"sha256:40c7b55eecff04d9d97e2272aaa88207d74098015910df663e30fada1ddd24e2","observation_id":"3fc2c912-aa20-477c-84c9-8a108a96d648","resolution":{"observed_at":"2026-08-07T14:57:56.816013Z","resolver_source":"local_arxiv","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":"2201.03949","last_updated":"2022-01-11T13:52:34Z","snapshot_observed_at":"2026-08-07T05:18:08.853325Z","submitted_at":"2022-01-11T13:52:34Z","title":"Entropic Optimal Transport in Random Graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.03949","snapshot_observed_at":"2026-08-03T11:18:04.559366Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.07144","last_updated":"2026-06-03T09:10:56Z","snapshot_observed_at":"2026-08-08T14:22:12.206234Z","submitted_at":"2026-01-12T02:26:32Z","title":"Optimal Transport under Group Fairness Constraints","version":3},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-03T11:18:04.559366Z"},"links":{"cited_paper":"/paper/2201.03949","citing_paper":"/paper/2601.07144"},"observation_digest":"sha256:50f926866d5a96a4f94e3aff94c72e369d3f6e5bb4017405104425ee833d686a","observation_id":"d982e125-b5a8-4fa1-be15-894699890159","resolution":{"observed_at":"2026-08-03T11:18:04.559366Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2201.03949/citation-record","integrity":"/paper/2201.03949/integrity","json":"/paper/2201.03949/citation-record.json","paper":"/paper/2201.03949"},"outbound":[],"paper":{"arxiv_id":"2201.03949","last_updated":"2022-01-11T13:52:34Z","latest_version":1,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-07T05:18:08.853325Z","submitted_at":"2022-01-11T13:52:34Z","title":"Entropic Optimal Transport in Random Graphs"},"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 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2201.03949."}