{"as_of":"2026-08-08T20:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1485dc7752b32a0a94d1c3b790d33f082e6545a815fb28bf644f32f3ee6dc098","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T13:53:20.725357Z","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-06T07:22:29.133722Z","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-07T13:40:24.876362Z","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:2add86978d39b27436b5cfb6b89a9eb593655a03a1052505bd5cce77f72f561a","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-06T07:22:29.133722Z","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-07T18:15:52.592360Z","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:d7928ea8d41d71a119352e4323fd8fc6d37966f42870fe7714a8c65a1158421b","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-06T07:22:29.133722Z","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-06T23:30:38.871230Z","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:20484172fa83000db34a63ede1d8889b32bcdffb957e259a7899c35c7c03b157","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-06T07:22:29.133722Z","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:53f0849e2fc0dd67d44a190c3bcd9df3c4c25a90c7f0fbc79f22c06268809e4e","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-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":"2211.14881","last_updated":"2022-11-27T16:34:58Z","snapshot_observed_at":"2026-08-06T07:22:29.133722Z","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-06T10:22:38.165296Z","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:d8ddacc3151e173d8f5bbde0a19eb7068cbc04ece985abeb20561d62ab33b331","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-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"}}],"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-06T07:22:29.133722Z","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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"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."}