{"as_of":"2026-08-17T22:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d0a7cf8b730a9972ac750ebeb114cb88ee03e8d1be0638d49df93c785f12138a","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-17T06:30:58.91139+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-15T21:53:54.141230Z","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-11T05:57:33.320487Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1808.03880","last_updated":"2019-11-20T19:29:57Z","snapshot_observed_at":"2026-08-17T01:46:08.930354Z","submitted_at":"2018-08-12T01:56:17Z","title":"Parallelization does not Accelerate Convex Optimization: Adaptivity Lower Bounds for Non-smooth Convex Minimization","version":2},"cited_work":{"arxiv_id":"1808.03880","doi":null,"metadata_source":"pith","pith_arxiv_id":"1808.03880","snapshot_observed_at":"2026-08-11T05:57:33.320487Z","title":"Parallelization does not Accelerate Convex Optimization: Adaptivity Lower Bounds for Non-smooth Convex Minimization","venue":"cs.LG","work_id":"0887056e-c285-45fc-8bf5-59d61daa5ea7","year":2018},"citing_paper":{"arxiv_id":"2412.17082","last_updated":"2024-12-22T16:18:34Z","snapshot_observed_at":"2026-08-12T19:19:25.502191Z","submitted_at":"2024-12-22T16:18:34Z","title":"MARINA-P: Superior Performance in Non-smooth Federated Optimization with Adaptive Stepsizes","version":1},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-11T05:57:33.125535Z"},"links":{"cited_paper":"/paper/1808.03880","citing_paper":"/paper/2412.17082"},"observation_digest":"sha256:20df4e02582d5abf117161fb315f6498975c6adb2ee04772e2ee4e80b3b93480","observation_id":"f04b0e5d-1853-4898-b001-30c4221f2a44","resolution":{"observed_at":"2026-08-11T05:57:33.328756Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1808.03880","last_updated":"2019-11-20T19:29:57Z","snapshot_observed_at":"2026-08-17T01:46:08.930354Z","submitted_at":"2018-08-12T01:56:17Z","title":"Parallelization does not Accelerate Convex Optimization: Adaptivity Lower Bounds for Non-smooth Convex Minimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1808.03880","snapshot_observed_at":"2026-08-15T21:53:54.141230Z","title":"Parallelization does not accelerate convex optimization: Adaptivity lower bounds for non-smooth convex minimization","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.09045","last_updated":"2025-05-14T00:54:49Z","snapshot_observed_at":"2026-08-15T21:39:21.843370Z","submitted_at":"2025-05-14T00:54:49Z","title":"The Adaptive Complexity of Finding a Stationary Point","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-15T21:53:54.141230Z"},"links":{"cited_paper":"/paper/1808.03880","citing_paper":"/paper/2505.09045"},"observation_digest":"sha256:48ebd531f7bff80a9936f23db43ef4a19f59a7cb411be8f80ccca625e838a7a8","observation_id":"f6d2b953-7b0b-4601-b219-c26a9d26767f","resolution":{"observed_at":"2026-08-15T21:53:54.141230Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1808.03880/citation-record","integrity":"/paper/1808.03880/integrity","json":"/paper/1808.03880/citation-record.json","paper":"/paper/1808.03880"},"outbound":[],"paper":{"arxiv_id":"1808.03880","last_updated":"2019-11-20T19:29:57Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-17T01:46:08.930354Z","submitted_at":"2018-08-12T01:56:17Z","title":"Parallelization does not Accelerate Convex Optimization: Adaptivity Lower Bounds for Non-smooth Convex Minimization"},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1808.03880."}