{"as_of":"2026-08-13T11:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:902dbd14132a5779bbe097633cf6f29990422fe81d574e14abd5012f75d99216","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-13T06:32:02.005865+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-12T20:02:14.040232Z","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-10T15:43:47.933249Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2306.16156","last_updated":"2024-08-21T08:44:44Z","snapshot_observed_at":"2026-07-06T15:47:45.886474Z","submitted_at":"2023-06-28T12:37:23Z","title":"Recent Advances in Optimal Transport for Machine Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.16156","snapshot_observed_at":"2026-08-12T20:02:14.040232Z","title":"Recent advances in opti- mal transport for machine learning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.10204","last_updated":"2024-11-15T14:10:52Z","snapshot_observed_at":"2026-08-12T19:48:43.830816Z","submitted_at":"2024-11-15T14:10:52Z","title":"Fused Gromov-Wasserstein Variance Decomposition with Linear Optimal Transport","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-12T20:02:14.040232Z"},"links":{"cited_paper":"/paper/2306.16156","citing_paper":"/paper/2411.10204"},"observation_digest":"sha256:c29546cf2173998f6679182a3c7f81f471301fd7480175277d9a98d00101cb06","observation_id":"a1479c1d-85b2-44f3-8326-20844de462b6","resolution":{"observed_at":"2026-08-12T20:02:14.040232Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.16156","last_updated":"2024-08-21T08:44:44Z","snapshot_observed_at":"2026-07-06T15:47:45.886474Z","submitted_at":"2023-06-28T12:37:23Z","title":"Recent Advances in Optimal Transport for Machine Learning","version":2},"cited_work":{"arxiv_id":"2306.16156","doi":null,"metadata_source":"pith","pith_arxiv_id":"2306.16156","snapshot_observed_at":"2026-08-10T15:43:47.933249Z","title":"Recent Advances in Optimal Transport for Machine Learning","venue":"cs.LG","work_id":"90775f46-ff52-4184-a6d8-a7efaee099ed","year":2023},"citing_paper":{"arxiv_id":"2501.13732","last_updated":"2025-07-07T14:54:25Z","snapshot_observed_at":"2026-08-10T15:37:14.708118Z","submitted_at":"2025-01-23T15:05:51Z","title":"A dimensionality reduction technique based on the Gromov-Wasserstein distance","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T15:43:47.816875Z"},"links":{"cited_paper":"/paper/2306.16156","citing_paper":"/paper/2501.13732"},"observation_digest":"sha256:aa8f6c54e1af09be3883c57101da561f6c243fb0809ae42322d96590d69e2735","observation_id":"de1d3385-7f45-4308-918b-7edaad2f4d45","resolution":{"observed_at":"2026-08-10T15:43:47.939944Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2306.16156/citation-record","integrity":"/paper/2306.16156/integrity","json":"/paper/2306.16156/citation-record.json","paper":"/paper/2306.16156"},"outbound":[],"paper":{"arxiv_id":"2306.16156","last_updated":"2024-08-21T08:44:44Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T15:47:45.886474Z","submitted_at":"2023-06-28T12:37:23Z","title":"Recent Advances in Optimal Transport for Machine Learning"},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2306.16156."}