{"as_of":"2026-08-15T13:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:40e07144427aa2f60e73b6073f6370b27f56cef3d03d8bc65c79a82d57a5b1f9","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-15T06:32:42.880941+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-10T13:51:31.352042Z","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-07-09T06:36:02.193543Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2211.14881","last_updated":"2022-11-27T16:34:58Z","snapshot_observed_at":"2026-08-14T11:53:37.075055Z","submitted_at":"2022-11-27T16:34:58Z","title":"An Efficient HPR Algorithm for the Wasserstein Barycenter Problem with $O({Dim(P)}/\\varepsilon)$ Computational Complexity","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.14881","snapshot_observed_at":"2026-08-10T13:51:31.352042Z","title":"An efficient H P R algorithm for the W asserstein barycenter problem with O ( D im( P )/ ) computational complexity","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.15964","last_updated":"2025-01-27T11:14:06Z","snapshot_observed_at":"2026-08-15T13:17:18.742338Z","submitted_at":"2025-01-27T11:14:06Z","title":"PyClustrPath: An efficient Python package for generating clustering paths with GPU acceleration","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-10T13:51:31.352042Z"},"links":{"cited_paper":"/paper/2211.14881","citing_paper":"/paper/2501.15964"},"observation_digest":"sha256:6e0504d1fe79746ff8f9fde5796b43f19693447cc2126a5f94c5e9e20d584287","observation_id":"8a2e57ff-68b1-45e4-8e6f-369d1e365b3b","resolution":{"observed_at":"2026-08-10T13:51:31.352042Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.14881","last_updated":"2022-11-27T16:34:58Z","snapshot_observed_at":"2026-08-14T11:53:37.075055Z","submitted_at":"2022-11-27T16:34:58Z","title":"An Efficient HPR Algorithm for the Wasserstein Barycenter Problem with $O({Dim(P)}/\\varepsilon)$ Computational Complexity","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.14881","snapshot_observed_at":"2026-08-07T13:53:20.725357Z","title":"arXiv preprint arXiv:2211.14881","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.20991","last_updated":"2025-05-27T10:25:10Z","snapshot_observed_at":"2026-08-13T16:32:54.638101Z","submitted_at":"2025-05-27T10:25:10Z","title":"An accelerated semi-proximal ADMM with applications to multi-block sparse optimization problems","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T13:53:20.725357Z"},"links":{"cited_paper":"/paper/2211.14881","citing_paper":"/paper/2505.20991"},"observation_digest":"sha256:e4e0b2f7dfec976dffd786eb7531262cceec07e0881382ea5763b0a48d285cd9","observation_id":"f5efd4b8-568c-44db-9349-7cecb8acab98","resolution":{"observed_at":"2026-08-07T13:53:20.725357Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.14881","last_updated":"2022-11-27T16:34:58Z","snapshot_observed_at":"2026-08-14T11:53:37.075055Z","submitted_at":"2022-11-27T16:34:58Z","title":"An Efficient HPR Algorithm for the Wasserstein Barycenter Problem with $O({Dim(P)}/\\varepsilon)$ Computational Complexity","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.14881","snapshot_observed_at":"2026-08-06T20:37:47.316397Z","title":"Zhang, Y","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.02470","last_updated":"2025-07-03T09:28:29Z","snapshot_observed_at":"2026-08-15T03:14:20.111220Z","submitted_at":"2025-07-03T09:28:29Z","title":"HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-06T20:37:47.316397Z"},"links":{"cited_paper":"/paper/2211.14881","citing_paper":"/paper/2507.02470"},"observation_digest":"sha256:6060b7a76c706e48cd582bc469f9f3f52f282e0574892b2a3e471d4ebc33371a","observation_id":"e46aaaa6-65f9-4eb9-a612-7c9b06254c70","resolution":{"observed_at":"2026-08-06T20:37:47.316397Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.14881","last_updated":"2022-11-27T16:34:58Z","snapshot_observed_at":"2026-08-14T11:53:37.075055Z","submitted_at":"2022-11-27T16:34:58Z","title":"An Efficient HPR Algorithm for the Wasserstein Barycenter Problem with $O({Dim(P)}/\\varepsilon)$ Computational Complexity","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.14881","snapshot_observed_at":"2026-08-04T06:37:36.425817Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.02084","last_updated":"2026-08-03T09:34:41Z","snapshot_observed_at":"2026-08-13T22:48:08.914749Z","submitted_at":"2026-01-05T13:12:29Z","title":"A Perturbed DCA for Computing d-Stationary Points of Nonsmooth DC Programs","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-04T06:37:36.425817Z"},"links":{"cited_paper":"/paper/2211.14881","citing_paper":"/paper/2601.02084"},"observation_digest":"sha256:d87dce6c39b38f1407e4660bc15595805c0f14ec2b1c8b9eb256f3e6c37ac2a3","observation_id":"1495434b-2dec-4b16-9db0-9010a8f78dfc","resolution":{"observed_at":"2026-08-04T06:37:36.425817Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.14881","last_updated":"2022-11-27T16:34:58Z","snapshot_observed_at":"2026-08-14T11:53:37.075055Z","submitted_at":"2022-11-27T16:34:58Z","title":"An Efficient HPR Algorithm for the Wasserstein Barycenter Problem with $O({Dim(P)}/\\varepsilon)$ Computational Complexity","version":1},"cited_work":{"arxiv_id":"2211.14881","doi":null,"metadata_source":"pith","pith_arxiv_id":"2211.14881","snapshot_observed_at":"2026-07-09T06:36:02.193543Z","title":"2211.14881v1 , primaryclass =","venue":"math.OC","work_id":"5fc7f218-2aca-4249-8cc3-d1e09d06cbd8","year":2022},"citing_paper":{"arxiv_id":"2605.12881","last_updated":"2026-05-13T01:53:00Z","snapshot_observed_at":"2026-08-07T15:12:33.757723Z","submitted_at":"2026-05-13T01:53:00Z","title":"Change-point detection in variance-covariance matrix","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-05-14T19:06:02.366767Z"},"links":{"cited_paper":"/paper/2211.14881","citing_paper":"/paper/2605.12881"},"observation_digest":"sha256:df6ff664ffc4b26850acd5cdffab8da23dd1e352278a23c3a5c1858513695a5f","observation_id":"9fb509ae-f839-4ee3-9afd-988570150ac8","resolution":{"observed_at":"2026-05-14T19:07:51.220899Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2211.14881","last_updated":"2022-11-27T16:34:58Z","snapshot_observed_at":"2026-08-14T11:53:37.075055Z","submitted_at":"2022-11-27T16:34:58Z","title":"An Efficient HPR Algorithm for the Wasserstein Barycenter Problem with $O({Dim(P)}/\\varepsilon)$ Computational Complexity","version":1},"cited_work":{"arxiv_id":"2211.14881","doi":null,"metadata_source":"pith","pith_arxiv_id":"2211.14881","snapshot_observed_at":"2026-07-09T06:36:02.193543Z","title":"2211.14881v1 , primaryclass =","venue":"math.OC","work_id":"5fc7f218-2aca-4249-8cc3-d1e09d06cbd8","year":2022},"citing_paper":{"arxiv_id":"2607.07585","last_updated":"2026-07-08T16:07:24Z","snapshot_observed_at":"2026-08-13T12:25:59.805723Z","submitted_at":"2026-07-08T16:07:24Z","title":"Convergence Analysis of the Restarted Moving-Anchored Extra-Gradient Method in the Absence of Local Lipschitz Continuity","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-07-09T06:27:25.912336Z"},"links":{"cited_paper":"/paper/2211.14881","citing_paper":"/paper/2607.07585"},"observation_digest":"sha256:415faa3ba90807b2608a9fd10c00163ffe9ead050eaad6ccae4c306df2d8647b","observation_id":"e3880227-2c1c-4243-b2d7-2af39d4f4786","resolution":{"observed_at":"2026-07-09T06:36:02.195921Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2211.14881/citation-record","integrity":"/paper/2211.14881/integrity","json":"/paper/2211.14881/citation-record.json","paper":"/paper/2211.14881"},"outbound":[],"paper":{"arxiv_id":"2211.14881","last_updated":"2022-11-27T16:34:58Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-14T11:53:37.075055Z","submitted_at":"2022-11-27T16:34:58Z","title":"An Efficient HPR Algorithm for the Wasserstein Barycenter Problem with $O({Dim(P)}/\\varepsilon)$ Computational Complexity"},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2211.14881."}