{"as_of":"2026-08-15T18:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:41f116b578ed39ace199f0b6894e213414448b440dd45addb0a0a7fcc7c7eebc","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-15T06:32:42.880941+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-14T06:24:14.732455Z","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-14T05:44:01.527771Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1611.00756","last_updated":"2017-02-02T18:56:35Z","snapshot_observed_at":"2026-08-14T21:32:15.012981Z","submitted_at":"2016-11-02T19:58:30Z","title":"Accelerated Methods for Non-Convex Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.00756","snapshot_observed_at":"2026-08-14T06:24:14.732455Z","title":"Duchi, Oliver Hinder, and Aaron Sidfor d","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1909.00171","last_updated":"2019-08-31T09:09:08Z","snapshot_observed_at":"2026-08-14T05:57:40.208303Z","submitted_at":"2019-08-31T09:09:08Z","title":"Near-optimal Approximate Discrete and Continuous Submodular Function Minimization","version":1},"reference_index":1999,"source":"pdf_text","source_observed_at":"2026-08-14T06:24:14.732455Z"},"links":{"cited_paper":"/paper/1611.00756","citing_paper":"/paper/1909.00171"},"observation_digest":"sha256:d0941ae3fca80fffbeb92f348823c23b89f7256cc41eda917fbb61f99e9263c0","observation_id":"a67b4540-c1f3-40c3-8401-23948d68c05d","resolution":{"observed_at":"2026-08-14T06:24:14.732455Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1611.00756","last_updated":"2017-02-02T18:56:35Z","snapshot_observed_at":"2026-08-14T21:32:15.012981Z","submitted_at":"2016-11-02T19:58:30Z","title":"Accelerated Methods for Non-Convex Optimization","version":2},"cited_work":{"arxiv_id":"1611.00756","doi":null,"metadata_source":"pith","pith_arxiv_id":"1611.00756","snapshot_observed_at":"2026-08-14T05:44:01.527771Z","title":"Accelerated Methods for Non-Convex Optimization","venue":"math.OC","work_id":"9fe970ce-10d4-4baf-ae03-c5bd405a3c5e","year":2016},"citing_paper":{"arxiv_id":"1909.00918","last_updated":"2019-09-03T02:11:11Z","snapshot_observed_at":"2026-08-15T06:19:58.300411Z","submitted_at":"2019-09-03T02:11:11Z","title":"Efficiency of Coordinate Descent Methods For Structured Nonconvex Optimization","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T05:44:01.245148Z"},"links":{"cited_paper":"/paper/1611.00756","citing_paper":"/paper/1909.00918"},"observation_digest":"sha256:a59a37ccd7203fd0a828ae710e0d328328d415407d0811df34f46da62c2d1e23","observation_id":"ea564614-5696-47fd-a56c-5e53f576e70e","resolution":{"observed_at":"2026-08-14T05:44:01.532700Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1611.00756/citation-record","integrity":"/paper/1611.00756/integrity","json":"/paper/1611.00756/citation-record.json","paper":"/paper/1611.00756"},"outbound":[],"paper":{"arxiv_id":"1611.00756","last_updated":"2017-02-02T18:56:35Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-14T21:32:15.012981Z","submitted_at":"2016-11-02T19:58:30Z","title":"Accelerated Methods for Non-Convex 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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1611.00756."}