{"as_of":"2026-08-23T01:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3a5e81b57e159902380cd45448ed5c86c4eb51ab0e385dccf3082e9bba1aee97","coverage":[{"denominator":1,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T11:15:36.519404Z","state":"measured"},{"denominator":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+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-14T08:04:14.297636Z","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-25T04:40:23.586086Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2507.23155","last_updated":"2025-07-30T23:10:29Z","snapshot_observed_at":"2026-08-16T03:56:44.204953Z","submitted_at":"2025-07-30T23:10:29Z","title":"On the Complexity of Finding Stationary Points in Nonconvex Simple Bilevel Optimization","version":1},"cited_work":{"arxiv_id":"2507.23155","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2507.23155","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"62a82364-07a5-47bc-8e83-86e279f7384e","year":2021},"citing_paper":{"arxiv_id":"2605.23378","last_updated":"2026-05-22T08:46:21Z","snapshot_observed_at":"2026-08-16T12:02:43.388303Z","submitted_at":"2026-05-22T08:46:21Z","title":"Selective Ambulance Dispatch Under Contextual Travel-Time Uncertainty","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-25T04:39:06.576888Z"},"links":{"cited_paper":"/paper/2507.23155","citing_paper":"/paper/2605.23378"},"observation_digest":"sha256:1a17c43e58da18b64256f83db240f6b6cd569824e909a1cb5b6eab6c8752014d","observation_id":"80392a21-07be-44a1-a6cd-1b7d01f78541","resolution":{"observed_at":"2026-05-25T04:40:23.593541Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.23155","last_updated":"2025-07-30T23:10:29Z","snapshot_observed_at":"2026-08-16T03:56:44.204953Z","submitted_at":"2025-07-30T23:10:29Z","title":"On the Complexity of Finding Stationary Points in Nonconvex Simple Bilevel Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.23155","snapshot_observed_at":"2026-07-14T08:04:14.297636Z","title":"On the complexity of finding stationary points in nonconvex simple bilevel optimization.arXiv preprint arXiv:2507.23155, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.10957","last_updated":"2026-07-12T23:23:02Z","snapshot_observed_at":"2026-08-16T14:08:39.748502Z","submitted_at":"2026-07-12T23:23:02Z","title":"Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-14T08:04:14.297636Z"},"links":{"cited_paper":"/paper/2507.23155","citing_paper":"/paper/2607.10957"},"observation_digest":"sha256:2f1da4adca62b9115306ea67a0fa9f1aabb37e8474138a7bb0971bacf629a207","observation_id":"410db751-8297-4be2-827c-5a612321a0bb","resolution":{"observed_at":"2026-07-14T08:04:14.297636Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2507.23155/citation-record","integrity":"/paper/2507.23155/integrity","json":"/paper/2507.23155/citation-record.json","paper":"/paper/2507.23155"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2306.14853","last_updated":"2026-05-25T07:26:53Z","snapshot_observed_at":"2026-08-16T15:54:43.299926Z","submitted_at":"2023-06-26T17:07:54Z","title":"Near-Optimal Nonconvex-Strongly-Convex Bilevel Optimization with Fully First-Order Oracles","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.14853","snapshot_observed_at":"2026-08-06T11:15:36.519404Z","title":"Computing a non- negative matrix factorization–provably","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2507.23155","last_updated":"2025-07-30T23:10:29Z","snapshot_observed_at":"2026-08-16T03:56:44.204953Z","submitted_at":"2025-07-30T23:10:29Z","title":"On the Complexity of Finding Stationary Points in Nonconvex Simple Bilevel Optimization","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T11:15:36.519404Z"},"links":{"cited_paper":"/paper/2306.14853","citing_paper":"/paper/2507.23155"},"observation_digest":"sha256:76d0b56196c7f8bf656d7173ec6e95ef4e03551b91593f1133779b421dfd10a0","observation_id":"417cd09d-c6b0-41d0-ac8b-ab46e97bc7e6","resolution":{"observed_at":"2026-08-06T11:15:36.519404Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2507.23155","last_updated":"2025-07-30T23:10:29Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-16T03:56:44.204953Z","submitted_at":"2025-07-30T23:10:29Z","title":"On the Complexity of Finding Stationary Points in Nonconvex Simple Bilevel Optimization"},"reference_resolution":{"displayed":1,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":1},"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 23 August 2026, this Paper Citation Record lists 1 of 1 outbound references and 2 inbound Pith citation observations for arXiv:2507.23155."}