Paper Citation Record · LEDGER

An Efficient HPR Algorithm for the Wasserstein Barycenter Problem with $O({Dim(P)}/\varepsilon)$ Computational Complexity

As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2211.14881.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2211.14881 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 5 of 5 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-08T06:32:00.761636+00:00

measured 5 of 5 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-07T13:53:20.725357Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: pith, observed 2026-07-09T06:36:02.193543Z

Reference resolution

0 of 0 outbound references displayed

verified exact0
verified fuzzy0
unresolved0
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation f5efd4b8-568c-44db-9349-7cecb8acab98 · inbound

An accelerated semi-proximal ADMM with applications to multi-block sparse optimization problems cites this paper.

An accelerated semi-proximal ADMM with applications to multi-block sparse optimization problems An Efficient HPR Algorithm for the Wasserstein Barycenter Problem with $O({Dim(P)}/\varepsilon)$ Computational Complexity

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-07T13:53:20.725357Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e46aaaa6-65f9-4eb9-a612-7c9b06254c70 · inbound

HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming cites this paper.

HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming An Efficient HPR Algorithm for the Wasserstein Barycenter Problem with $O({Dim(P)}/\varepsilon)$ Computational Complexity

Reference 47

Resolution: malformed identifier; no resolver link, observed 2026-08-06T20:37:47.316397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1495434b-2dec-4b16-9db0-9010a8f78dfc · inbound

A Perturbed DCA for Computing d-Stationary Points of Nonsmooth DC Programs cites this paper.

A Perturbed DCA for Computing d-Stationary Points of Nonsmooth DC Programs An Efficient HPR Algorithm for the Wasserstein Barycenter Problem with $O({Dim(P)}/\varepsilon)$ Computational Complexity

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-04T06:37:36.425817Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9fb509ae-f839-4ee3-9afd-988570150ac8 · inbound

Change-point detection in variance-covariance matrix cites this paper.

Change-point detection in variance-covariance matrix An Efficient HPR Algorithm for the Wasserstein Barycenter Problem with $O({Dim(P)}/\varepsilon)$ Computational Complexity

Reference 68

Resolution: verified exact; arxiv_id, observed 2026-05-14T19:07:51.220899Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation e3880227-2c1c-4243-b2d7-2af39d4f4786 · inbound

Convergence Analysis of the Restarted Moving-Anchored Extra-Gradient Method in the Absence of Local Lipschitz Continuity cites this paper.

Convergence Analysis of the Restarted Moving-Anchored Extra-Gradient Method in the Absence of Local Lipschitz Continuity An Efficient HPR Algorithm for the Wasserstein Barycenter Problem with $O({Dim(P)}/\varepsilon)$ Computational Complexity

Reference 46

Resolution: metadata mismatch; local_arxiv, observed 2026-07-09T06:36:02.195921Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.