{"as_of":"2026-08-04T07:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f1cdad49f7c4911909172ddd563b1ed800b86be058b0e92f74a281c9f3c81546","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-04T06:34:03.388597+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-01T00:57:26.828482Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-15T01:58:29.012902Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2202.03684","last_updated":"2023-05-10T05:03:53Z","snapshot_observed_at":"2026-07-06T12:35:31.877365Z","submitted_at":"2022-02-08T07:10:06Z","title":"Efficiently Escaping Saddle Points in Bilevel Optimization","version":2},"cited_work":{"arxiv_id":"2202.03684","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2202.03684","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2202.03684 , year=","venue":null,"work_id":"06d8a7c5-59db-4651-9363-daa68cba42b0","year":null},"citing_paper":{"arxiv_id":"2605.14409","last_updated":"2026-05-14T05:52:04Z","snapshot_observed_at":"2026-07-06T23:25:49.545418Z","submitted_at":"2026-05-14T05:52:04Z","title":"On the Nature of Regularity Assumptions in Bilevel Optimization with Constrained Lower-level Problem","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-05-15T01:57:37.847553Z"},"links":{"cited_paper":"/paper/2202.03684","citing_paper":"/paper/2605.14409"},"observation_digest":"sha256:6d9ff8d09d2be0fbe62ba379f2e4b20e512e007478b05ac72c5410928fa6289a","observation_id":"e4a1d37b-97a0-462e-a244-126bed3f8979","resolution":{"observed_at":"2026-05-15T01:58:29.014398Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.03684","last_updated":"2023-05-10T05:03:53Z","snapshot_observed_at":"2026-07-06T12:35:31.877365Z","submitted_at":"2022-02-08T07:10:06Z","title":"Efficiently Escaping Saddle Points in Bilevel Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.03684","snapshot_observed_at":"2026-08-01T00:57:26.828482Z","title":"arXiv preprint arXiv:2202.03684 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.26032","last_updated":"2026-07-28T17:42:41Z","snapshot_observed_at":"2026-08-03T04:58:59.899643Z","submitted_at":"2026-07-28T17:42:41Z","title":"Optimization under Persistent State-Dependent Bias: Gradient-based Method and Complexity Analysis","version":1},"reference_index":264,"source":"arxiv_source","source_observed_at":"2026-08-01T00:57:26.828482Z"},"links":{"cited_paper":"/paper/2202.03684","citing_paper":"/paper/2607.26032"},"observation_digest":"sha256:02bdbce28478d96175eb2da49fc2c3339200672c0d09c89c12b5d273c98d45c2","observation_id":"b042a0d4-6472-48ec-92d2-6a2712b7157d","resolution":{"observed_at":"2026-08-01T00:57:26.828482Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2202.03684/citation-record","integrity":"/paper/2202.03684/integrity","json":"/paper/2202.03684/citation-record.json","paper":"/paper/2202.03684"},"outbound":[],"paper":{"arxiv_id":"2202.03684","last_updated":"2023-05-10T05:03:53Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T12:35:31.877365Z","submitted_at":"2022-02-08T07:10:06Z","title":"Efficiently Escaping Saddle Points in Bilevel 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-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"As of 4 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2202.03684."}