{"as_of":"2026-08-11T13:20:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:755bfe79c1195b704dd96885e6ad5b03c204ab56e37ab9917a41266b91f51b97","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-11T06:34:44.6726+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-10T00:04:41.601642Z","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-10T00:04:42.152655Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1910.07568","last_updated":"2022-02-08T18:39:59Z","snapshot_observed_at":"2026-07-06T08:30:07.818602Z","submitted_at":"2019-10-16T18:52:28Z","title":"On the Computational Complexity of Finding a Sparse Wasserstein Barycenter","version":3},"cited_work":{"arxiv_id":"1910.07568","doi":null,"metadata_source":"pith","pith_arxiv_id":"1910.07568","snapshot_observed_at":"2026-08-10T00:04:42.152655Z","title":"On the Computational Complexity of Finding a Sparse Wasserstein Barycenter","venue":"math.OC","work_id":"a7f2995f-4393-405d-a496-d95738ee34be","year":2019},"citing_paper":{"arxiv_id":"2501.18312","last_updated":"2025-01-30T12:40:57Z","snapshot_observed_at":"2026-08-09T23:53:48.642642Z","submitted_at":"2025-01-30T12:40:57Z","title":"Decentralised convex optimisation with probability-proportional-to-size quantization","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T00:04:41.601642Z"},"links":{"cited_paper":"/paper/1910.07568","citing_paper":"/paper/2501.18312"},"observation_digest":"sha256:1f23eaab7e63871a7e22a5064c466401f8cb2ee566c5eb4baa926b14aa0409fe","observation_id":"3ed405f7-345c-4b76-8efe-02a2e77dde35","resolution":{"observed_at":"2026-08-10T00:04:42.157108Z","resolver_source":"local_arxiv","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":"1910.07568","last_updated":"2022-02-08T18:39:59Z","snapshot_observed_at":"2026-07-06T08:30:07.818602Z","submitted_at":"2019-10-16T18:52:28Z","title":"On the Computational Complexity of Finding a Sparse Wasserstein Barycenter","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.07568","snapshot_observed_at":"2026-08-01T19:23:58.306268Z","title":"arXiv:1910.07568 , year=","venue":null,"work_id":null,"year":1910},"citing_paper":{"arxiv_id":"2607.16991","last_updated":"2026-07-18T22:45:23Z","snapshot_observed_at":"2026-08-10T16:54:35.871082Z","submitted_at":"2026-07-18T22:45:23Z","title":"Compositional Synthetic Controls","version":1},"reference_index":141,"source":"arxiv_source","source_observed_at":"2026-08-01T19:23:58.306268Z"},"links":{"cited_paper":"/paper/1910.07568","citing_paper":"/paper/2607.16991"},"observation_digest":"sha256:e6887fb700bfad216f558803cc4b8026647f2ae15b33f1369de52b6f3666c1ca","observation_id":"3cc1ce8f-7e6e-4ac7-acb9-57d70b5d136d","resolution":{"observed_at":"2026-08-01T19:23:58.306268Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1910.07568/citation-record","integrity":"/paper/1910.07568/integrity","json":"/paper/1910.07568/citation-record.json","paper":"/paper/1910.07568"},"outbound":[],"paper":{"arxiv_id":"1910.07568","last_updated":"2022-02-08T18:39:59Z","latest_version":3,"primary_category":"math.OC","snapshot_observed_at":"2026-07-06T08:30:07.818602Z","submitted_at":"2019-10-16T18:52:28Z","title":"On the Computational Complexity of Finding a Sparse Wasserstein Barycenter"},"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 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1910.07568."}