{"as_of":"2026-08-16T09:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a981f6b59338991d44bb07b35f23df8e9431ce532f6177d23fabf8dd2d051bd7","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-16T06:30:59.297886+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-14T14:45:51.704667Z","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-14T12:38:57.806557Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1709.03384","last_updated":"2020-05-30T14:57:50Z","snapshot_observed_at":"2026-08-15T21:50:39.931164Z","submitted_at":"2017-09-11T14:05:55Z","title":"Ghost Penalties in Nonconvex Constrained Optimization: Diminishing Stepsizes and Iteration Complexity","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1709.03384","snapshot_observed_at":"2026-08-14T14:45:51.704667Z","title":"Ghost penalties in nonconvex constrained optimization: Diminishing stepsizes and itera tion complexity","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.02734","last_updated":"2022-01-27T00:38:36Z","snapshot_observed_at":"2026-08-15T20:12:31.772332Z","submitted_at":"2019-08-07T17:10:52Z","title":"Stochastic First-order Methods for Convex and Nonconvex Functional Constrained Optimization","version":4},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T14:45:51.704667Z"},"links":{"cited_paper":"/paper/1709.03384","citing_paper":"/paper/1908.02734"},"observation_digest":"sha256:fe3c87baea8bede7f7bda9ba20423045bad5e968d7319be335463d746df62ac3","observation_id":"6357ab16-8291-40ba-9ba0-0a3eae3373ef","resolution":{"observed_at":"2026-08-14T14:45:51.704667Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1709.03384","last_updated":"2020-05-30T14:57:50Z","snapshot_observed_at":"2026-08-15T21:50:39.931164Z","submitted_at":"2017-09-11T14:05:55Z","title":"Ghost Penalties in Nonconvex Constrained Optimization: Diminishing Stepsizes and Iteration Complexity","version":3},"cited_work":{"arxiv_id":"1709.03384","doi":null,"metadata_source":"pith","pith_arxiv_id":"1709.03384","snapshot_observed_at":"2026-08-14T12:38:57.806557Z","title":"Ghost Penalties in Nonconvex Constrained Optimization: Diminishing Stepsizes and Iteration Complexity","venue":"math.OC","work_id":"1256c069-7c6f-4da9-82a1-90d916176b15","year":2017},"citing_paper":{"arxiv_id":"1908.07023","last_updated":"2019-08-19T18:56:40Z","snapshot_observed_at":"2026-08-15T23:57:27.394411Z","submitted_at":"2019-08-19T18:56:40Z","title":"Second-Order Guarantees of Stochastic Gradient Descent in Non-Convex Optimization","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T12:38:57.588833Z"},"links":{"cited_paper":"/paper/1709.03384","citing_paper":"/paper/1908.07023"},"observation_digest":"sha256:d84ddd23acefc2b2d2981e36eac07629efc39c5d853dea8aa49e45de63e21fa2","observation_id":"3e940f5d-0b60-472a-ab28-e8631f7b3bae","resolution":{"observed_at":"2026-08-14T12:38:57.813743Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1709.03384/citation-record","integrity":"/paper/1709.03384/integrity","json":"/paper/1709.03384/citation-record.json","paper":"/paper/1709.03384"},"outbound":[],"paper":{"arxiv_id":"1709.03384","last_updated":"2020-05-30T14:57:50Z","latest_version":3,"primary_category":"math.OC","snapshot_observed_at":"2026-08-15T21:50:39.931164Z","submitted_at":"2017-09-11T14:05:55Z","title":"Ghost Penalties in Nonconvex Constrained Optimization: Diminishing Stepsizes and Iteration Complexity"},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1709.03384."}