{"as_of":"2026-08-21T20:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e6a7c6b94e15135e7276e85543eb6a1e01ad8e212748fab1ad966af143231f76","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T00:28:36.469338Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1906.05832","last_updated":"2019-10-31T03:46:29Z","snapshot_observed_at":"2026-08-14T16:16:00.194189Z","submitted_at":"2019-06-13T17:29:56Z","title":"The Communication Complexity of Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.05832","snapshot_observed_at":"2026-08-04T00:28:36.469338Z","title":"ArXiv abs/1906.05832 (2019)","venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2511.02082","last_updated":"2026-07-14T18:14:08Z","snapshot_observed_at":"2026-08-21T17:07:21.084747Z","submitted_at":"2025-11-03T21:42:30Z","title":"Tight Lower Bounds for Binary First-Order Oracles for Convex Optimization","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-04T00:28:36.469338Z"},"links":{"cited_paper":"/paper/1906.05832","citing_paper":"/paper/2511.02082"},"observation_digest":"sha256:2d82401530cebfab3a3c98ead6f00dc1a6b3291aba246da9a79145c0f03bd3e4","observation_id":"ada52d6b-492b-4383-9278-f2b219ea4f83","resolution":{"observed_at":"2026-08-04T00:28:36.469338Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1906.05832/citation-record","integrity":"/paper/1906.05832/integrity","json":"/paper/1906.05832/citation-record.json","paper":"/paper/1906.05832"},"outbound":[],"paper":{"arxiv_id":"1906.05832","last_updated":"2019-10-31T03:46:29Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-14T16:16:00.194189Z","submitted_at":"2019-06-13T17:29:56Z","title":"The Communication Complexity of Optimization"},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1906.05832."}