{"as_of":"2026-08-09T10:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a04700a693bce9e2b335c9458406ff6c4636319cc0545f5558d37b884ecf6a62","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-09T06:31:02.800959+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-07-31T23:09:54.423468Z","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":"2104.06763","last_updated":"2022-10-27T11:31:47Z","snapshot_observed_at":"2026-08-05T20:00:34.350139Z","submitted_at":"2021-04-14T10:42:45Z","title":"Oracle Complexity in Nonsmooth Nonconvex Optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.06763","snapshot_observed_at":"2026-07-31T23:08:26.202757Z","title":"arXiv preprint arXiv:2104.06763 (v1) , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.24120","last_updated":"2026-07-27T07:59:39Z","snapshot_observed_at":"2026-08-05T06:54:11.237978Z","submitted_at":"2026-07-27T07:59:39Z","title":"On the hardness of deterministic second-order optimization of functions with Lipschitz gradients","version":1},"reference_index":112,"source":"arxiv_source","source_observed_at":"2026-07-31T23:08:26.202757Z"},"links":{"cited_paper":"/paper/2104.06763","citing_paper":"/paper/2607.24120"},"observation_digest":"sha256:f4ccb3e2f6aebdeb4fe30a79b3c964da30d51cfe2ddae3ed9e074f771bfffa3a","observation_id":"bbbf5cf0-d8ea-400d-b46f-4c75ec37ad1a","resolution":{"observed_at":"2026-07-31T23:08:26.202757Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.06763","last_updated":"2022-10-27T11:31:47Z","snapshot_observed_at":"2026-08-05T20:00:34.350139Z","submitted_at":"2021-04-14T10:42:45Z","title":"Oracle Complexity in Nonsmooth Nonconvex Optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.06763","snapshot_observed_at":"2026-07-31T23:09:54.423468Z","title":"Kornowski and O","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.24122","last_updated":"2026-07-27T08:01:40Z","snapshot_observed_at":"2026-08-08T09:44:01.073229Z","submitted_at":"2026-07-27T08:01:40Z","title":"On computing Goldstein approximate second-order stationary points of structured nonsmooth nonconvex programs","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-07-31T23:09:54.423468Z"},"links":{"cited_paper":"/paper/2104.06763","citing_paper":"/paper/2607.24122"},"observation_digest":"sha256:d0fe035f54e1d089a8826482789f178ef09ea643910de3d5119c0794d7cf3313","observation_id":"2345fd8d-7923-4b24-a24e-ba6f0b8e3877","resolution":{"observed_at":"2026-07-31T23:09:54.423468Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2104.06763/citation-record","integrity":"/paper/2104.06763/integrity","json":"/paper/2104.06763/citation-record.json","paper":"/paper/2104.06763"},"outbound":[],"paper":{"arxiv_id":"2104.06763","last_updated":"2022-10-27T11:31:47Z","latest_version":3,"primary_category":"math.OC","snapshot_observed_at":"2026-08-05T20:00:34.350139Z","submitted_at":"2021-04-14T10:42:45Z","title":"Oracle Complexity in Nonsmooth Nonconvex 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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2104.06763."}