{"as_of":"2026-08-15T21:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:64048142a8a9bcf7dca9cca455b755acea95663e0003d5aa0085df0259282e1c","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":10,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":10,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":10,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":10,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T23:47:10.768370Z","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-07-04T08:49:42.358008Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2309.01753","last_updated":"2024-02-11T08:10:01Z","snapshot_observed_at":"2026-08-13T10:20:37.324747Z","submitted_at":"2023-09-04T18:25:43Z","title":"On Penalty Methods for Nonconvex Bilevel Optimization and First-Order Stochastic Approximation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.01753","snapshot_observed_at":"2026-08-10T23:47:10.768370Z","title":"On penalty methods for nonconvex bilevel optimization and first-order stochastic approximation","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.768370Z"},"links":{"cited_paper":"/paper/2309.01753","citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:85dc5dbd5d29d27ea2b1bacee0f560f7ca3d9c28598fcde0b918045a28051f9a","observation_id":"39c9b54b-6224-4cff-a86a-d5c8a4ef40a8","resolution":{"observed_at":"2026-08-10T23:47:10.768370Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.01753","last_updated":"2024-02-11T08:10:01Z","snapshot_observed_at":"2026-08-13T10:20:37.324747Z","submitted_at":"2023-09-04T18:25:43Z","title":"On Penalty Methods for Nonconvex Bilevel Optimization and First-Order Stochastic Approximation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.01753","snapshot_observed_at":"2026-08-04T22:56:02.518758Z","title":"On penalty methods for noncon- vex bilevel optimization and first-order stochastic approximation.arXiv preprint arXiv:2309.01753,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.06948","last_updated":"2026-05-30T09:01:09Z","snapshot_observed_at":"2026-08-04T22:56:01.963927Z","submitted_at":"2025-09-08T17:58:02Z","title":"Beyond Two-Stage Training: Cooperative SFT and RL for LLM Reasoning","version":3},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-04T22:56:02.518758Z"},"links":{"cited_paper":"/paper/2309.01753","citing_paper":"/paper/2509.06948"},"observation_digest":"sha256:a603baea418b6b3319a964d9b2dbc3ba0a635f468c8059d6cb1faf1b190af4fa","observation_id":"2dcbc11d-e793-4583-90c3-c32ea1004636","resolution":{"observed_at":"2026-08-04T22:56:02.518758Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.01753","last_updated":"2024-02-11T08:10:01Z","snapshot_observed_at":"2026-08-13T10:20:37.324747Z","submitted_at":"2023-09-04T18:25:43Z","title":"On Penalty Methods for Nonconvex Bilevel Optimization and First-Order Stochastic Approximation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.01753","snapshot_observed_at":"2026-08-04T16:23:19.284782Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.15543","last_updated":"2026-05-25T16:32:52Z","snapshot_observed_at":"2026-08-15T13:49:23.485775Z","submitted_at":"2025-09-19T02:51:19Z","title":"Nonconvex Decentralized Stochastic Bilevel Optimization under Heavy-Tailed Noise","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-04T16:23:19.284782Z"},"links":{"cited_paper":"/paper/2309.01753","citing_paper":"/paper/2509.15543"},"observation_digest":"sha256:fea5013c65a3ede8f442839d2a34535f119be8364df289dc1d0637fd1cf3aaa4","observation_id":"0c725faa-1879-4d54-86de-ea55fdf2b2a6","resolution":{"observed_at":"2026-08-04T16:23:19.284782Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.01753","last_updated":"2024-02-11T08:10:01Z","snapshot_observed_at":"2026-08-13T10:20:37.324747Z","submitted_at":"2023-09-04T18:25:43Z","title":"On Penalty Methods for Nonconvex Bilevel Optimization and First-Order Stochastic Approximation","version":2},"cited_work":{"arxiv_id":"2309.01753","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2309.01753","snapshot_observed_at":"2026-07-04T08:49:42.358008Z","title":"arXiv preprint arXiv:2309.01753 , year=","venue":null,"work_id":"80ca96fe-b7f6-48a0-8d5e-88d90dd17d93","year":2023},"citing_paper":{"arxiv_id":"2605.06431","last_updated":"2026-05-07T15:35:15Z","snapshot_observed_at":"2026-08-02T06:24:15.531785Z","submitted_at":"2026-05-07T15:35:15Z","title":"Second-Order Bilevel Optimization with Accelerated Convergence Rates","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-08T08:08:45.069685Z"},"links":{"cited_paper":"/paper/2309.01753","citing_paper":"/paper/2605.06431"},"observation_digest":"sha256:dfa0c42aa3b1722dd0a03282a7a69e6acb6281d0b841a4f9d3af02bfd71394af","observation_id":"6593323f-ad9a-4ee6-ad24-ff79e727ef54","resolution":{"observed_at":"2026-05-11T20:46:11.025487Z","resolver_source":"arxiv_id","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"}},{"citation":{"cited_paper":{"arxiv_id":"2309.01753","last_updated":"2024-02-11T08:10:01Z","snapshot_observed_at":"2026-08-13T10:20:37.324747Z","submitted_at":"2023-09-04T18:25:43Z","title":"On Penalty Methods for Nonconvex Bilevel Optimization and First-Order Stochastic Approximation","version":2},"cited_work":{"arxiv_id":"2309.01753","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2309.01753","snapshot_observed_at":"2026-07-04T08:49:42.358008Z","title":"arXiv preprint arXiv:2309.01753 , year=","venue":null,"work_id":"80ca96fe-b7f6-48a0-8d5e-88d90dd17d93","year":2023},"citing_paper":{"arxiv_id":"2605.10288","last_updated":"2026-05-12T10:19:03Z","snapshot_observed_at":"2026-08-14T19:46:29.121523Z","submitted_at":"2026-05-11T09:50:10Z","title":"BROS: Bias-Corrected Randomized Subspaces for Memory-Efficient Single-Loop Bilevel Optimization","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-12T04:47:04.868735Z"},"links":{"cited_paper":"/paper/2309.01753","citing_paper":"/paper/2605.10288"},"observation_digest":"sha256:a2c40e7612095866483b103e6a3cd5224cc85680adc2d765bd88897838f205c1","observation_id":"431ece44-ed2e-4245-9223-1e1e68ecb7da","resolution":{"observed_at":"2026-05-12T05:56:26.497677Z","resolver_source":"arxiv_id","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"}},{"citation":{"cited_paper":{"arxiv_id":"2309.01753","last_updated":"2024-02-11T08:10:01Z","snapshot_observed_at":"2026-08-13T10:20:37.324747Z","submitted_at":"2023-09-04T18:25:43Z","title":"On Penalty Methods for Nonconvex Bilevel Optimization and First-Order Stochastic Approximation","version":2},"cited_work":{"arxiv_id":"2309.01753","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2309.01753","snapshot_observed_at":"2026-07-04T08:49:42.358008Z","title":"arXiv preprint arXiv:2309.01753 , year=","venue":null,"work_id":"80ca96fe-b7f6-48a0-8d5e-88d90dd17d93","year":2023},"citing_paper":{"arxiv_id":"2605.10288","last_updated":"2026-05-12T10:19:03Z","snapshot_observed_at":"2026-08-14T19:46:29.121523Z","submitted_at":"2026-05-11T09:50:10Z","title":"BROS: Bias-Corrected Randomized Subspaces for Memory-Efficient Single-Loop Bilevel Optimization","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-13T06:20:42.781613Z"},"links":{"cited_paper":"/paper/2309.01753","citing_paper":"/paper/2605.10288"},"observation_digest":"sha256:3947e5f02695460f4e94d6d577ee3dfe3eece1bb22d66b21bdc07afd25d72ca0","observation_id":"3f20aff1-f0b2-4a51-a17b-34b9b843d380","resolution":{"observed_at":"2026-05-13T06:22:23.290073Z","resolver_source":"arxiv_id","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"}},{"citation":{"cited_paper":{"arxiv_id":"2309.01753","last_updated":"2024-02-11T08:10:01Z","snapshot_observed_at":"2026-08-13T10:20:37.324747Z","submitted_at":"2023-09-04T18:25:43Z","title":"On Penalty Methods for Nonconvex Bilevel Optimization and First-Order Stochastic Approximation","version":2},"cited_work":{"arxiv_id":"2309.01753","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2309.01753","snapshot_observed_at":"2026-07-04T08:49:42.358008Z","title":"arXiv preprint arXiv:2309.01753 , year=","venue":null,"work_id":"80ca96fe-b7f6-48a0-8d5e-88d90dd17d93","year":2023},"citing_paper":{"arxiv_id":"2605.14409","last_updated":"2026-05-14T05:52:04Z","snapshot_observed_at":"2026-08-15T08:23:53.435073Z","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":74,"source":"arxiv_source","source_observed_at":"2026-05-15T01:57:37.847553Z"},"links":{"cited_paper":"/paper/2309.01753","citing_paper":"/paper/2605.14409"},"observation_digest":"sha256:ec83fe6caf7a135debfed95a85dae4bdac8ffffac3dc768b28b5be892292b2ac","observation_id":"66fe6240-dbec-4e8c-a9c3-e77d94ee901d","resolution":{"observed_at":"2026-05-15T01:58:28.996075Z","resolver_source":"arxiv_id","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"}},{"citation":{"cited_paper":{"arxiv_id":"2309.01753","last_updated":"2024-02-11T08:10:01Z","snapshot_observed_at":"2026-08-13T10:20:37.324747Z","submitted_at":"2023-09-04T18:25:43Z","title":"On Penalty Methods for Nonconvex Bilevel Optimization and First-Order Stochastic Approximation","version":2},"cited_work":{"arxiv_id":"2309.01753","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2309.01753","snapshot_observed_at":"2026-07-04T08:49:42.358008Z","title":"arXiv preprint arXiv:2309.01753 , year=","venue":null,"work_id":"80ca96fe-b7f6-48a0-8d5e-88d90dd17d93","year":2023},"citing_paper":{"arxiv_id":"2606.22433","last_updated":"2026-06-21T10:53:32Z","snapshot_observed_at":"2026-08-10T03:12:44.310421Z","submitted_at":"2026-06-21T10:53:32Z","title":"Escaping the Variance Trap: Jacobian-Free Dynamics for Root-Finding Bilevel Optimization","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-06-26T10:56:26.951886Z"},"links":{"cited_paper":"/paper/2309.01753","citing_paper":"/paper/2606.22433"},"observation_digest":"sha256:214f0e00d76027917d3c5fa5913dd3ba52b993c9c844722e8e8735181bc7b735","observation_id":"4f9585a1-d5a8-4765-b36a-e566f187fd3e","resolution":{"observed_at":"2026-07-04T08:49:42.359911Z","resolver_source":"arxiv_id","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"}},{"citation":{"cited_paper":{"arxiv_id":"2309.01753","last_updated":"2024-02-11T08:10:01Z","snapshot_observed_at":"2026-08-13T10:20:37.324747Z","submitted_at":"2023-09-04T18:25:43Z","title":"On Penalty Methods for Nonconvex Bilevel Optimization and First-Order Stochastic Approximation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.01753","snapshot_observed_at":"2026-07-14T13:04:23.482075Z","title":"arXiv preprint arXiv:2309.01753 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.10263","last_updated":"2026-07-11T11:41:42Z","snapshot_observed_at":"2026-08-14T15:26:53.806625Z","submitted_at":"2026-07-11T11:41:42Z","title":"Sharper Analysis of Single-Loop Methods for Bilevel Optimization","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-07-14T13:04:23.482075Z"},"links":{"cited_paper":"/paper/2309.01753","citing_paper":"/paper/2607.10263"},"observation_digest":"sha256:3a638c09b07b7144661babd992cc543c73acf7d8136d8f4a958bb31f16100cc1","observation_id":"b8b0c433-88f8-4b7d-b868-cbc097d4b374","resolution":{"observed_at":"2026-07-14T13:04:23.482075Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.01753","last_updated":"2024-02-11T08:10:01Z","snapshot_observed_at":"2026-08-13T10:20:37.324747Z","submitted_at":"2023-09-04T18:25:43Z","title":"On Penalty Methods for Nonconvex Bilevel Optimization and First-Order Stochastic Approximation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.01753","snapshot_observed_at":"2026-07-14T08:04:14.297636Z","title":"On penalty methods for nonconvex bilevel optimization and first-order stochastic approximation.arXiv preprint arXiv:2309.01753, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.10957","last_updated":"2026-07-12T23:23:02Z","snapshot_observed_at":"2026-08-14T12:46:23.758525Z","submitted_at":"2026-07-12T23:23:02Z","title":"Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-07-14T08:04:14.297636Z"},"links":{"cited_paper":"/paper/2309.01753","citing_paper":"/paper/2607.10957"},"observation_digest":"sha256:6946bd6f99ce4ea3aed60c073431119ffc0db94ceac4d27e28d8624c2c801047","observation_id":"b23586e6-f3ee-408b-9a89-5c49d06f8c7b","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/2309.01753/citation-record","integrity":"/paper/2309.01753/integrity","json":"/paper/2309.01753/citation-record.json","paper":"/paper/2309.01753"},"outbound":[],"paper":{"arxiv_id":"2309.01753","last_updated":"2024-02-11T08:10:01Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-13T10:20:37.324747Z","submitted_at":"2023-09-04T18:25:43Z","title":"On Penalty Methods for Nonconvex Bilevel Optimization and First-Order Stochastic Approximation"},"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 10 inbound Pith citation observations for arXiv:2309.01753."}