{"as_of":"2026-08-09T10:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:79e266f92b0504e7af4c80120f829856ce3f77ddca9f24c5580401edaf2ff023","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-09T06:31:02.800959+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-06T21:42:47.709422Z","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-04T23:25:19.805216Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.08890","last_updated":"2024-10-11T15:07:32Z","snapshot_observed_at":"2026-07-06T19:31:53.397265Z","submitted_at":"2024-10-11T15:07:32Z","title":"Relaxed Proximal Point Algorithm: Tight Complexity Bounds and Acceleration without Momentum","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.08890","snapshot_observed_at":"2026-08-06T21:42:47.709422Z","title":"Relaxed proximal point algorithm: Tight complexity bounds and acceleration without momentum","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:47.709422Z"},"links":{"cited_paper":"/paper/2410.08890","citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:88b5f990e3ef2d9375441dffaa1558628bb195ca1d5104c71f1709878d6b5cb1","observation_id":"10e15512-0dac-4f1a-9a71-603e3cb55c5f","resolution":{"observed_at":"2026-08-06T21:42:47.709422Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.08890","last_updated":"2024-10-11T15:07:32Z","snapshot_observed_at":"2026-07-06T19:31:53.397265Z","submitted_at":"2024-10-11T15:07:32Z","title":"Relaxed Proximal Point Algorithm: Tight Complexity Bounds and Acceleration without Momentum","version":1},"cited_work":{"arxiv_id":"2410.08890","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.08890","snapshot_observed_at":"2026-08-04T23:25:19.805216Z","title":"Relaxed Proximal Point Algorithm: Tight Complexity Bounds and Acceleration without Momentum","venue":"math.OC","work_id":"ca561319-2098-4330-a0be-c3d4239a1e77","year":2024},"citing_paper":{"arxiv_id":"2509.06676","last_updated":"2025-09-13T01:38:34Z","snapshot_observed_at":"2026-08-09T01:26:42.702686Z","submitted_at":"2025-09-08T13:35:41Z","title":"On the convergence rate of the Douglas-Rachford splitting algorithm","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-04T23:25:19.755221Z"},"links":{"cited_paper":"/paper/2410.08890","citing_paper":"/paper/2509.06676"},"observation_digest":"sha256:5eaa651ee88533c34cb2eb23fd08999d5bb8e8cb2ac2c9d45605bffa371c3350","observation_id":"9c123e69-c5be-42d3-bba0-65c7c3ce43c4","resolution":{"observed_at":"2026-08-04T23:25:19.810648Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2410.08890/citation-record","integrity":"/paper/2410.08890/integrity","json":"/paper/2410.08890/citation-record.json","paper":"/paper/2410.08890"},"outbound":[],"paper":{"arxiv_id":"2410.08890","last_updated":"2024-10-11T15:07:32Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-07-06T19:31:53.397265Z","submitted_at":"2024-10-11T15:07:32Z","title":"Relaxed Proximal Point Algorithm: Tight Complexity Bounds and Acceleration without Momentum"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2410.08890."}