{"as_of":"2026-08-22T16:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:61b7da6074b846dbea8410bc109330247d5e840d68a35c506547fea8c3a40410","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-22T06:32:14.747728+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.204967Z","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":"2203.15260","last_updated":"2024-07-24T11:21:47Z","snapshot_observed_at":"2026-08-16T17:11:04.761360Z","submitted_at":"2022-03-29T06:15:54Z","title":"Efficient Convex Optimization Requires Superlinear Memory","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.15260","snapshot_observed_at":"2026-08-04T00:28:36.204967Z","title":"arXiv preprint arXiv:2203.15260 (2022)","venue":null,"work_id":null,"year":2022},"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":3,"source":"arxiv_source","source_observed_at":"2026-08-04T00:28:36.204967Z"},"links":{"cited_paper":"/paper/2203.15260","citing_paper":"/paper/2511.02082"},"observation_digest":"sha256:06a20a75ef4d17d53ef038a90ae37dcb739fbf0d30eb286c3f022fa309ade42b","observation_id":"3ceab218-3979-4081-99bc-30d42fcd87b7","resolution":{"observed_at":"2026-08-04T00:28:36.204967Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2203.15260/citation-record","integrity":"/paper/2203.15260/integrity","json":"/paper/2203.15260/citation-record.json","paper":"/paper/2203.15260"},"outbound":[],"paper":{"arxiv_id":"2203.15260","last_updated":"2024-07-24T11:21:47Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T17:11:04.761360Z","submitted_at":"2022-03-29T06:15:54Z","title":"Efficient Convex Optimization Requires Superlinear Memory"},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2203.15260."}