{"as_of":"2026-08-17T00:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7018a8df1592cd356ec606a61f90fc0a6e165feb80511763cefc797de83fb619","coverage":[{"denominator":40,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":40,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T21:12:39.040133Z","state":"measured"},{"denominator":40,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":40,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"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":[],"links":{"evidence":"/evidence","html":"/paper/2505.10830/citation-record","integrity":"/paper/2505.10830/integrity","json":"/paper/2505.10830/citation-record.json","paper":"/paper/2505.10830"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:12:39.833705Z","title":"Pappas, Hamed Hassani, and Volkan Cevher","venue":null,"work_id":"3f64d30c-0aa8-4dcb-b802-6c1d7d76dd4b","year":2024},"citing_paper":{"arxiv_id":"2505.10830","last_updated":"2025-05-16T04:00:31Z","snapshot_observed_at":"2026-08-16T15:52:14.512473Z","submitted_at":"2025-05-16T04:00:31Z","title":"A Discretization Approach for Bilevel Optimization with Low-Dimensional and Non-Convex Lower-Level","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:38.882942Z"},"links":{"citing_paper":"/paper/2505.10830"},"observation_digest":"sha256:b8101af07c5f94a2c54c046abb8e39fe8cffc2e36b28780a06176ab9e0f9647c","observation_id":"cc88d2ce-cf71-40cd-9549-baf185a209d2","resolution":{"observed_at":"2026-08-15T21:12:39.837538Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:12:39.821131Z","title":"Revisiting and advancing fast adversarial training through the lens of bi-level optimization","venue":null,"work_id":"84496341-e2c1-4074-bd14-d3b33fe63f8f","year":2022},"citing_paper":{"arxiv_id":"2505.10830","last_updated":"2025-05-16T04:00:31Z","snapshot_observed_at":"2026-08-16T15:52:14.512473Z","submitted_at":"2025-05-16T04:00:31Z","title":"A Discretization Approach for Bilevel Optimization with Low-Dimensional and Non-Convex Lower-Level","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:38.887709Z"},"links":{"citing_paper":"/paper/2505.10830"},"observation_digest":"sha256:d74afb2c873a8ef8a5fd3d3890e32d385c58d633b3cb0b0364d9f9684528436d","observation_id":"a09a41df-8819-4d54-a7e9-21ae243e7109","resolution":{"observed_at":"2026-08-15T21:12:39.825312Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2022.31433","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:12:39.476112Z","title":"Learning to continuously optimize wireless resource in a dynamic environment: A bilevel optimiza- tion perspective","venue":null,"work_id":"447b8461-8fa4-4cfc-b1ac-625796e60c74","year":1900},"citing_paper":{"arxiv_id":"2505.10830","last_updated":"2025-05-16T04:00:31Z","snapshot_observed_at":"2026-08-16T15:52:14.512473Z","submitted_at":"2025-05-16T04:00:31Z","title":"A Discretization Approach for Bilevel Optimization with Low-Dimensional and Non-Convex Lower-Level","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:38.891757Z"},"links":{"citing_paper":"/paper/2505.10830"},"observation_digest":"sha256:25c5015cea8add1fa46cbb4895474778a6e4f1267becfeed1e044ba91c39a0aa","observation_id":"34f93449-3d24-4c27-8ace-964643d2a61f","resolution":{"observed_at":"2026-08-15T21:12:39.483164Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:12:39.809987Z","title":"Predicting flat-fading channels via meta-learned closed-form linear filters and equilibrium propagation, 2022","venue":null,"work_id":"cb3c4176-b9f6-481c-93a0-21cbd440f4b6","year":2022},"citing_paper":{"arxiv_id":"2505.10830","last_updated":"2025-05-16T04:00:31Z","snapshot_observed_at":"2026-08-16T15:52:14.512473Z","submitted_at":"2025-05-16T04:00:31Z","title":"A Discretization Approach for Bilevel Optimization with Low-Dimensional and Non-Convex Lower-Level","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:38.895856Z"},"links":{"citing_paper":"/paper/2505.10830"},"observation_digest":"sha256:58d30d301aa14d43d206082c209c53d2af745b2508354fe52090aded5a1a221a","observation_id":"4bd1d324-b665-4f08-85e8-c040d6140e7b","resolution":{"observed_at":"2026-08-15T21:12:39.814170Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:12:38.899552Z","title":"Channel estimation for mimo-ofdm systems by modal analysis/filtering","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2505.10830","last_updated":"2025-05-16T04:00:31Z","snapshot_observed_at":"2026-08-16T15:52:14.512473Z","submitted_at":"2025-05-16T04:00:31Z","title":"A Discretization Approach for Bilevel Optimization with Low-Dimensional and Non-Convex Lower-Level","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:38.899552Z"},"links":{"citing_paper":"/paper/2505.10830"},"observation_digest":"sha256:c45b89d9d00357df61282746a8d5f90bc669d0a06da999fff6e2b6f510d7e16b","observation_id":"84d80df2-72fc-495a-b9cc-69e81b61bbed","resolution":{"observed_at":"2026-08-15T21:12:38.899552Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.04630","last_updated":"2019-09-10T17:14:14Z","snapshot_observed_at":"2026-08-15T05:14:25.819371Z","submitted_at":"2019-09-10T17:14:14Z","title":"Meta-Learning with Implicit Gradients","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.04630","snapshot_observed_at":"2026-08-15T21:12:38.904031Z","title":"Kakade, and Sergey Levine","venue":null,"work_id":null,"year":1909},"citing_paper":{"arxiv_id":"2505.10830","last_updated":"2025-05-16T04:00:31Z","snapshot_observed_at":"2026-08-16T15:52:14.512473Z","submitted_at":"2025-05-16T04:00:31Z","title":"A Discretization Approach for Bilevel Optimization with Low-Dimensional and Non-Convex Lower-Level","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:38.904031Z"},"links":{"cited_paper":"/paper/1909.04630","citing_paper":"/paper/2505.10830"},"observation_digest":"sha256:bd35edf6a4948706229db3836f33de4f3fe758174944573c3f196bb3e787269f","observation_id":"9c0ff6ab-fdb7-4bdb-9f75-3a6ed5d01834","resolution":{"observed_at":"2026-08-15T21:12:38.904031Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:12:38.908835Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.10830","last_updated":"2025-05-16T04:00:31Z","snapshot_observed_at":"2026-08-16T15:52:14.512473Z","submitted_at":"2025-05-16T04:00:31Z","title":"A Discretization Approach for Bilevel Optimization with Low-Dimensional and Non-Convex Lower-Level","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:38.908835Z"},"links":{"citing_paper":"/paper/2505.10830"},"observation_digest":"sha256:0bab2dace9fb3a57ff7c66f19cb40206ae83c654e7c49496c022d2cfcf6ed21f","observation_id":"5ce710bf-2ec1-4aec-9435-b0bc2d61b925","resolution":{"observed_at":"2026-08-15T21:12:38.908835Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:12:38.912461Z","title":"Hyperparameter optimization with approximate gradient, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.10830","last_updated":"2025-05-16T04:00:31Z","snapshot_observed_at":"2026-08-16T15:52:14.512473Z","submitted_at":"2025-05-16T04:00:31Z","title":"A Discretization Approach for Bilevel Optimization with Low-Dimensional and Non-Convex Lower-Level","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:38.912461Z"},"links":{"citing_paper":"/paper/2505.10830"},"observation_digest":"sha256:bd421fbf86a51cd6431e3bf0190d9cb90e2d09a78ee0f9008915071704efa473","observation_id":"6244fe99-99a4-4e52-bf27-e3063bb526a0","resolution":{"observed_at":"2026-08-15T21:12:38.912461Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:12:39.785231Z","title":"Bilevel programming for hyperparameter optimization and meta-learning, 2018","venue":null,"work_id":"32db5a0d-fd93-42ff-abe2-ee846118698a","year":2018},"citing_paper":{"arxiv_id":"2505.10830","last_updated":"2025-05-16T04:00:31Z","snapshot_observed_at":"2026-08-16T15:52:14.512473Z","submitted_at":"2025-05-16T04:00:31Z","title":"A Discretization Approach for Bilevel Optimization with Low-Dimensional and Non-Convex Lower-Level","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:38.917494Z"},"links":{"citing_paper":"/paper/2505.10830"},"observation_digest":"sha256:b0dbd2bd346a31e6cc96410c4bfd306503a3e3c04a2a1fcc3e53bb1f77be1879","observation_id":"e8931574-c50c-442f-bc86-f3957d55a6fc","resolution":{"observed_at":"2026-08-15T21:12:39.788998Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:12:38.921654Z","title":"A two-timescale stochastic algorithm framework for bilevel optimization: Complexity analysis and ap- plication to actor-critic","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.10830","last_updated":"2025-05-16T04:00:31Z","snapshot_observed_at":"2026-08-16T15:52:14.512473Z","submitted_at":"2025-05-16T04:00:31Z","title":"A Discretization Approach for Bilevel Optimization with Low-Dimensional and Non-Convex Lower-Level","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:38.921654Z"},"links":{"citing_paper":"/paper/2505.10830"},"observation_digest":"sha256:d580d19c3bb62d7829d9cc68c72515f555430e4e6e7d4f1093abd7fe610c0302","observation_id":"35399bb5-f214-4ec0-94b2-50f0ab252b0a","resolution":{"observed_at":"2026-08-15T21:12:38.921654Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1802.02246","last_updated":"2018-02-06T22:10:14Z","snapshot_observed_at":"2026-08-16T15:51:37.195604Z","submitted_at":"2018-02-06T22:10:14Z","title":"Approximation Methods for Bilevel Programming","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1802.02246","snapshot_observed_at":"2026-08-15T21:12:38.925537Z","title":"Approximation methods for bilevel programming","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.10830","last_updated":"2025-05-16T04:00:31Z","snapshot_observed_at":"2026-08-16T15:52:14.512473Z","submitted_at":"2025-05-16T04:00:31Z","title":"A Discretization Approach for Bilevel Optimization with Low-Dimensional and Non-Convex Lower-Level","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:38.925537Z"},"links":{"cited_paper":"/paper/1802.02246","citing_paper":"/paper/2505.10830"},"observation_digest":"sha256:e661ae07b4c6d1b84ad453e3de81893f36bbd3e08e20ce39e3ad92e56990fe95","observation_id":"0dbd1fe6-060c-4de5-9904-96fec83d79c2","resolution":{"observed_at":"2026-08-15T21:12:38.925537Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:12:39.770623Z","title":"A near-optimal algorithm for stochastic bilevel optimization via double- momentum","venue":null,"work_id":"c9bbde3b-3f9f-42fd-a0bc-23773cedeaa6","year":2021},"citing_paper":{"arxiv_id":"2505.10830","last_updated":"2025-05-16T04:00:31Z","snapshot_observed_at":"2026-08-16T15:52:14.512473Z","submitted_at":"2025-05-16T04:00:31Z","title":"A Discretization Approach for Bilevel Optimization with Low-Dimensional and Non-Convex Lower-Level","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:38.929728Z"},"links":{"citing_paper":"/paper/2505.10830"},"observation_digest":"sha256:5407343c15fcd38e94d3193e805bdbab2c96a4bdc86640b35688c7b29da9833e","observation_id":"c640310a-00ce-4a90-bbdb-bb8054f23eb4","resolution":{"observed_at":"2026-08-15T21:12:39.775870Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:12:39.756652Z","title":"A value- function-based interior-point method for non-convex bi-level optimization, 2021","venue":null,"work_id":"312f1d3f-452c-4ad9-a85c-dea57ba6f637","year":2021},"citing_paper":{"arxiv_id":"2505.10830","last_updated":"2025-05-16T04:00:31Z","snapshot_observed_at":"2026-08-16T15:52:14.512473Z","submitted_at":"2025-05-16T04:00:31Z","title":"A Discretization Approach for Bilevel Optimization with Low-Dimensional and Non-Convex Lower-Level","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:38.933251Z"},"links":{"citing_paper":"/paper/2505.10830"},"observation_digest":"sha256:f927bf8b30ea5088ed013eded010c01bfd8e5b164f5834e2122d948f060b0e6f","observation_id":"0dc41344-e3d7-4ec9-9d5f-4a943f14629e","resolution":{"observed_at":"2026-08-15T21:12:39.761568Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:12:39.742487Z","title":"Bome! bilevel optimiza- tion made easy: A simple first-order approach, 2022","venue":null,"work_id":"39cb3430-b3b6-4836-83ac-b3d4284f860d","year":2022},"citing_paper":{"arxiv_id":"2505.10830","last_updated":"2025-05-16T04:00:31Z","snapshot_observed_at":"2026-08-16T15:52:14.512473Z","submitted_at":"2025-05-16T04:00:31Z","title":"A Discretization Approach for Bilevel Optimization with Low-Dimensional and Non-Convex Lower-Level","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:38.936808Z"},"links":{"citing_paper":"/paper/2505.10830"},"observation_digest":"sha256:1fb00ee733901183b04caf23c98571c59cd1af6b25699a3f056dbf5b35d49ce1","observation_id":"8e418fba-f1e6-4140-8bf6-6c4c59b93739","resolution":{"observed_at":"2026-08-15T21:12:39.747204Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:12:39.729397Z","title":"Gao, Jane J","venue":null,"work_id":"f0545e2d-3912-44a9-9b5c-0a298a81c729","year":2024},"citing_paper":{"arxiv_id":"2505.10830","last_updated":"2025-05-16T04:00:31Z","snapshot_observed_at":"2026-08-16T15:52:14.512473Z","submitted_at":"2025-05-16T04:00:31Z","title":"A Discretization Approach for Bilevel Optimization with Low-Dimensional and Non-Convex Lower-Level","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:38.940582Z"},"links":{"citing_paper":"/paper/2505.10830"},"observation_digest":"sha256:a75e19223350436184797aa4d072c778f96d7479dd1496d94d9a27b54b3b7d8c","observation_id":"0e4460d3-4e92-41f9-a759-166e388b2de3","resolution":{"observed_at":"2026-08-15T21:12:39.733223Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:12:39.715457Z","title":"Value-function- based sequential minimization for bi-level optimization","venue":null,"work_id":"b6ac061e-1edf-4698-a70f-01f2d88e5fec","year":2023},"citing_paper":{"arxiv_id":"2505.10830","last_updated":"2025-05-16T04:00:31Z","snapshot_observed_at":"2026-08-16T15:52:14.512473Z","submitted_at":"2025-05-16T04:00:31Z","title":"A Discretization Approach for Bilevel Optimization with Low-Dimensional and Non-Convex Lower-Level","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:38.944558Z"},"links":{"citing_paper":"/paper/2505.10830"},"observation_digest":"sha256:a9621bf0261dcdaf4818811e5682ce04174b5202973936ec739b20728db06d3a","observation_id":"f445ccab-a484-40c1-be5c-4a22ff246c25","resolution":{"observed_at":"2026-08-15T21:12:39.720280Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:12:39.703448Z","title":"On penalty-based bilevel gradient descent method","venue":null,"work_id":"58f92be7-0074-4bfa-a690-b537e8a2db72","year":2023},"citing_paper":{"arxiv_id":"2505.10830","last_updated":"2025-05-16T04:00:31Z","snapshot_observed_at":"2026-08-16T15:52:14.512473Z","submitted_at":"2025-05-16T04:00:31Z","title":"A Discretization Approach for Bilevel Optimization with Low-Dimensional and Non-Convex Lower-Level","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:38.948163Z"},"links":{"citing_paper":"/paper/2505.10830"},"observation_digest":"sha256:233bca2d0b1cc1a457a4d28a5930896e9b51744a720af5b61b0ecf5b94440591","observation_id":"a4d1ad32-e9a6-41eb-adaf-07ec5e517527","resolution":{"observed_at":"2026-08-15T21:12:39.707538Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"2406.10148","last_updated":"2024-08-26T01:08:49Z","snapshot_observed_at":"2026-08-16T13:42:54.072615Z","submitted_at":"2024-06-14T15:59:36Z","title":"A Primal-Dual-Assisted Penalty Approach to Bilevel Optimization with Coupled Constraints","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.10148","snapshot_observed_at":"2026-08-15T21:12:38.952238Z","title":"Tenorio, Fernando Real-Rojas, Antonio G","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.10830","last_updated":"2025-05-16T04:00:31Z","snapshot_observed_at":"2026-08-16T15:52:14.512473Z","submitted_at":"2025-05-16T04:00:31Z","title":"A Discretization Approach for Bilevel Optimization with Low-Dimensional and Non-Convex Lower-Level","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:38.952238Z"},"links":{"cited_paper":"/paper/2406.10148","citing_paper":"/paper/2505.10830"},"observation_digest":"sha256:6e05fffdd560f5271083ace0c69865fb130637ed531627e0150b6502bf0605c7","observation_id":"7b813a10-231e-4522-a22d-aa759e4e7788","resolution":{"observed_at":"2026-08-15T21:12:38.952238Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:12:38.956198Z","title":"An introduction to bilevel optimization: Foundations and applications in signal processing and machine learning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.10830","last_updated":"2025-05-16T04:00:31Z","snapshot_observed_at":"2026-08-16T15:52:14.512473Z","submitted_at":"2025-05-16T04:00:31Z","title":"A Discretization Approach for Bilevel Optimization with Low-Dimensional and Non-Convex Lower-Level","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:38.956198Z"},"links":{"citing_paper":"/paper/2505.10830"},"observation_digest":"sha256:d8ce4a514a9649cc8ef27f8b91ce08403d0e9fbead9a85d405e086338cfcb6f2","observation_id":"27ec5806-2d47-4fc7-b916-e32def36ff14","resolution":{"observed_at":"2026-08-15T21:12:38.956198Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/0-387-34221-4","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:12:39.083297Z","title":"Path-based formulations of a bilevel toll setting problem , pages 29–50","venue":null,"work_id":"d8c024f3-473a-45d7-b4ef-ad1b81aafeb1","year":2006},"citing_paper":{"arxiv_id":"2505.10830","last_updated":"2025-05-16T04:00:31Z","snapshot_observed_at":"2026-08-16T15:52:14.512473Z","submitted_at":"2025-05-16T04:00:31Z","title":"A Discretization Approach for Bilevel Optimization with Low-Dimensional and Non-Convex Lower-Level","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:38.960053Z"},"links":{"citing_paper":"/paper/2505.10830"},"observation_digest":"sha256:121ba3136d8740eaea294043c864e895879d37eb7a60a6abe2e926fd6641906f","observation_id":"d6455240-cb4e-48a9-a5d7-99eb82d65d53","resolution":{"observed_at":"2026-08-15T21:12:39.088470Z","resolver_source":"doi","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:12:39.690652Z","title":"Vyacheslav Kalashnikov, Jos´ e-Fernando Camacho-Vallejo, Ronald Askin, and Na- taliya Kalashnykova","venue":null,"work_id":"7b8bdbb3-420d-407e-ba9c-30515c55712d","year":2010},"citing_paper":{"arxiv_id":"2505.10830","last_updated":"2025-05-16T04:00:31Z","snapshot_observed_at":"2026-08-16T15:52:14.512473Z","submitted_at":"2025-05-16T04:00:31Z","title":"A Discretization Approach for Bilevel Optimization with Low-Dimensional and Non-Convex Lower-Level","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:38.963900Z"},"links":{"citing_paper":"/paper/2505.10830"},"observation_digest":"sha256:ccb44d6bbb2961458c54f0a871304e1fb0ca407031c19560b85972a265f412b8","observation_id":"76bd8191-6134-4f4d-98c5-4303c940d51f","resolution":{"observed_at":"2026-08-15T21:12:39.694755Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:12:39.677038Z","title":"Graph theory","venue":null,"work_id":"dcd97eb7-259b-4a31-8714-967a9c75c4e4","year":2017},"citing_paper":{"arxiv_id":"2505.10830","last_updated":"2025-05-16T04:00:31Z","snapshot_observed_at":"2026-08-16T15:52:14.512473Z","submitted_at":"2025-05-16T04:00:31Z","title":"A Discretization Approach for Bilevel Optimization with Low-Dimensional and Non-Convex Lower-Level","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:38.967849Z"},"links":{"citing_paper":"/paper/2505.10830"},"observation_digest":"sha256:41cc9ba1d1fb2957b51e305e3d8a769678c6dfc69bc708a8cce4ca8c710e9dae","observation_id":"bfd74c4a-226f-4a8f-8c27-7590a86598b2","resolution":{"observed_at":"2026-08-15T21:12:39.681084Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:12:38.971233Z","title":"Stacked generalization","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2505.10830","last_updated":"2025-05-16T04:00:31Z","snapshot_observed_at":"2026-08-16T15:52:14.512473Z","submitted_at":"2025-05-16T04:00:31Z","title":"A Discretization Approach for Bilevel Optimization with Low-Dimensional and Non-Convex Lower-Level","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:38.971233Z"},"links":{"citing_paper":"/paper/2505.10830"},"observation_digest":"sha256:0c65196425959d1c9969a494be391a728690b05adcf653528f2fc09eb0077cec","observation_id":"58f51552-d01f-46d0-b222-efb82ccb297d","resolution":{"observed_at":"2026-08-15T21:12:38.971233Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:12:39.654505Z","title":"Provably faster algorithms for bilevel opti- mization, 2021","venue":null,"work_id":"7c942a6c-73f4-49c2-804f-6114779c396d","year":2021},"citing_paper":{"arxiv_id":"2505.10830","last_updated":"2025-05-16T04:00:31Z","snapshot_observed_at":"2026-08-16T15:52:14.512473Z","submitted_at":"2025-05-16T04:00:31Z","title":"A Discretization Approach for Bilevel Optimization with Low-Dimensional and Non-Convex Lower-Level","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:38.974763Z"},"links":{"citing_paper":"/paper/2505.10830"},"observation_digest":"sha256:9a91f99633cf541e9159a417b342aa282f7ba7a56c57812dd12548812f585ffb","observation_id":"f7f18e37-6b2c-49de-bb22-9dea19fdef05","resolution":{"observed_at":"2026-08-15T21:12:39.659460Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:12:39.641135Z","title":"Bilevel optimization: Convergence analysis and enhanced design","venue":null,"work_id":"d3cc5d88-4299-48cc-b973-56fa0e23ecca","year":null},"citing_paper":{"arxiv_id":"2505.10830","last_updated":"2025-05-16T04:00:31Z","snapshot_observed_at":"2026-08-16T15:52:14.512473Z","submitted_at":"2025-05-16T04:00:31Z","title":"A Discretization Approach for Bilevel Optimization with Low-Dimensional and Non-Convex Lower-Level","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:38.978613Z"},"links":{"citing_paper":"/paper/2505.10830"},"observation_digest":"sha256:ab55b9323a962b4b85dfbeb1c27c249c59181a7a8ef72715897ea1a89341794f","observation_id":"c591a2c2-cb24-4bb5-b37b-9b0ba5695b92","resolution":{"observed_at":"2026-08-15T21:12:39.645325Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:12:39.628036Z","title":"Alternating implicit projected sgd and its efficient variants for equality-constrained bilevel optimization, 2023","venue":null,"work_id":"9c32f1aa-7a09-4ea0-82f9-5943c21cf040","year":2023},"citing_paper":{"arxiv_id":"2505.10830","last_updated":"2025-05-16T04:00:31Z","snapshot_observed_at":"2026-08-16T15:52:14.512473Z","submitted_at":"2025-05-16T04:00:31Z","title":"A Discretization Approach for Bilevel Optimization with Low-Dimensional and Non-Convex Lower-Level","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:38.983589Z"},"links":{"citing_paper":"/paper/2505.10830"},"observation_digest":"sha256:e36551f9e0b0729780704289cb589f2cb7ec52b1b55677cf540d0206340ce4dd","observation_id":"4bc0e140-7191-48c3-9d2e-455e157ac784","resolution":{"observed_at":"2026-08-15T21:12:39.632198Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:12:39.614408Z","title":"Linearly constrained bilevel optimization: A smoothed implicit gradient approach","venue":null,"work_id":"109c1b5b-5f2d-424b-93a5-c1c33378cb6f","year":2023},"citing_paper":{"arxiv_id":"2505.10830","last_updated":"2025-05-16T04:00:31Z","snapshot_observed_at":"2026-08-16T15:52:14.512473Z","submitted_at":"2025-05-16T04:00:31Z","title":"A Discretization Approach for Bilevel Optimization with Low-Dimensional and Non-Convex Lower-Level","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:38.987571Z"},"links":{"citing_paper":"/paper/2505.10830"},"observation_digest":"sha256:5d769f3f207d3762f68b27d2aa0fad49205d5c188a73fb622358f6db407ae9d3","observation_id":"32fc4650-1c10-4a04-b526-4f53f7a71e32","resolution":{"observed_at":"2026-08-15T21:12:39.619513Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:12:39.601756Z","title":"An implicit gradient-type method for linearly constrained bilevel problems","venue":null,"work_id":"38b2b312-04f4-4e38-b1b2-349983aeb583","year":2022},"citing_paper":{"arxiv_id":"2505.10830","last_updated":"2025-05-16T04:00:31Z","snapshot_observed_at":"2026-08-16T15:52:14.512473Z","submitted_at":"2025-05-16T04:00:31Z","title":"A Discretization Approach for Bilevel Optimization with Low-Dimensional and Non-Convex Lower-Level","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:38.993542Z"},"links":{"citing_paper":"/paper/2505.10830"},"observation_digest":"sha256:fac8e68cd0f891c2d5a4f257fc1f20d27034f0d6ba633e230bf435a1530dd61b","observation_id":"5e16c6a8-165c-48f3-a1c1-b6f2d97c0ccc","resolution":{"observed_at":"2026-08-15T21:12:39.605915Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"2406.12771","last_updated":"2025-04-20T04:04:26Z","snapshot_observed_at":"2026-08-16T13:41:45.537931Z","submitted_at":"2024-06-18T16:41:21Z","title":"First-Order Methods for Linearly Constrained Bilevel Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.12771","snapshot_observed_at":"2026-08-15T21:12:38.997441Z","title":"First-order methods for linearly constrained bilevel optimization","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.10830","last_updated":"2025-05-16T04:00:31Z","snapshot_observed_at":"2026-08-16T15:52:14.512473Z","submitted_at":"2025-05-16T04:00:31Z","title":"A Discretization Approach for Bilevel Optimization with Low-Dimensional and Non-Convex Lower-Level","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:38.997441Z"},"links":{"cited_paper":"/paper/2406.12771","citing_paper":"/paper/2505.10830"},"observation_digest":"sha256:c407fec2c783ce737f48a0752c0287f357bdc28b83c45aba33f44282417b521e","observation_id":"2a0c486b-e581-4dc0-9523-dc8cb58e6623","resolution":{"observed_at":"2026-08-15T21:12:38.997441Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:12:39.589164Z","title":"White and Anand Anandalingam","venue":null,"work_id":"cc884201-e220-4104-ba90-b1481a5316f6","year":1993},"citing_paper":{"arxiv_id":"2505.10830","last_updated":"2025-05-16T04:00:31Z","snapshot_observed_at":"2026-08-16T15:52:14.512473Z","submitted_at":"2025-05-16T04:00:31Z","title":"A Discretization Approach for Bilevel Optimization with Low-Dimensional and Non-Convex Lower-Level","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:39.001458Z"},"links":{"citing_paper":"/paper/2505.10830"},"observation_digest":"sha256:d4ee2c8417525f360072bee352268b3dbb8011158993b8d79730ab2f0847dddf","observation_id":"b3b86095-21d4-4a5e-9adf-7f749f863cc5","resolution":{"observed_at":"2026-08-15T21:12:39.593005Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/9.58565","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:12:39.068801Z","title":"Anandalingam and D.J","venue":null,"work_id":"791b1576-3012-4813-9069-1260a9e29761","year":1990},"citing_paper":{"arxiv_id":"2505.10830","last_updated":"2025-05-16T04:00:31Z","snapshot_observed_at":"2026-08-16T15:52:14.512473Z","submitted_at":"2025-05-16T04:00:31Z","title":"A Discretization Approach for Bilevel Optimization with Low-Dimensional and Non-Convex Lower-Level","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:39.005039Z"},"links":{"citing_paper":"/paper/2505.10830"},"observation_digest":"sha256:118a78e277bdc1963229cc2f29de6787a508f29244490f8f64f9cca68eb5c734","observation_id":"d2f9dbbc-9488-4bb8-9e3e-938b8763d9e3","resolution":{"observed_at":"2026-08-15T21:12:39.074294Z","resolver_source":"doi","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:12:39.576030Z","title":"Ye, Daoli Zhu, and Qiji Jim Zhu","venue":null,"work_id":"4f1d8859-7a16-4b32-b50c-ae52fd24c6f0","year":null},"citing_paper":{"arxiv_id":"2505.10830","last_updated":"2025-05-16T04:00:31Z","snapshot_observed_at":"2026-08-16T15:52:14.512473Z","submitted_at":"2025-05-16T04:00:31Z","title":"A Discretization Approach for Bilevel Optimization with Low-Dimensional and Non-Convex Lower-Level","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:39.009336Z"},"links":{"citing_paper":"/paper/2505.10830"},"observation_digest":"sha256:6bfb012ca646643a33fce097e7173e96fc02bb2ea9f04f972b61a0e90f7d909c","observation_id":"67b3e94d-5138-454f-bb5b-e00078f6301f","resolution":{"observed_at":"2026-08-15T21:12:39.580143Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:12:39.549093Z","title":"Double penalty method for bilevel optimization problems","venue":null,"work_id":"d85849d2-ee06-4717-82b5-6b97a5332dab","year":1992},"citing_paper":{"arxiv_id":"2505.10830","last_updated":"2025-05-16T04:00:31Z","snapshot_observed_at":"2026-08-16T15:52:14.512473Z","submitted_at":"2025-05-16T04:00:31Z","title":"A Discretization Approach for Bilevel Optimization with Low-Dimensional and Non-Convex Lower-Level","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:39.016963Z"},"links":{"citing_paper":"/paper/2505.10830"},"observation_digest":"sha256:9a7ddf20f8f982293ab030cb59952c6f8350a703465033eb0e6c7d24d889a544","observation_id":"16c5282f-e7d4-41c6-8795-64f300a3fee9","resolution":{"observed_at":"2026-08-15T21:12:39.554456Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:12:39.020571Z","title":"A solution method for the static constrained stackelberg problem via penalty method","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2505.10830","last_updated":"2025-05-16T04:00:31Z","snapshot_observed_at":"2026-08-16T15:52:14.512473Z","submitted_at":"2025-05-16T04:00:31Z","title":"A Discretization Approach for Bilevel Optimization with Low-Dimensional and Non-Convex Lower-Level","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:39.020571Z"},"links":{"citing_paper":"/paper/2505.10830"},"observation_digest":"sha256:1143c3bfbbf2eb95da83379b36a430e8e874b10f6555cdb9d8873b3c7774e998","observation_id":"31a695d5-4a40-49fd-b6a8-2527ceedc82b","resolution":{"observed_at":"2026-08-15T21:12:39.020571Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:12:39.534203Z","title":"On solving simple bilevel programs with a nonconvex lower level program","venue":null,"work_id":"503db4de-6c19-41e2-82b6-87efc61cc45a","year":2014},"citing_paper":{"arxiv_id":"2505.10830","last_updated":"2025-05-16T04:00:31Z","snapshot_observed_at":"2026-08-16T15:52:14.512473Z","submitted_at":"2025-05-16T04:00:31Z","title":"A Discretization Approach for Bilevel Optimization with Low-Dimensional and Non-Convex Lower-Level","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:39.024828Z"},"links":{"citing_paper":"/paper/2505.10830"},"observation_digest":"sha256:be6efa573ecd5e6dba0259662530a32f5b8fa4e191d23a213c54492bb55acf3d","observation_id":"43d83514-dd2e-4fb4-a839-232282e576c4","resolution":{"observed_at":"2026-08-15T21:12:39.539050Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:12:39.521374Z","title":"On penalty-based bilevel gradient descent method, 2023","venue":null,"work_id":"a095dc76-ec2f-4f9f-a3c3-19cae1c0f565","year":2023},"citing_paper":{"arxiv_id":"2505.10830","last_updated":"2025-05-16T04:00:31Z","snapshot_observed_at":"2026-08-16T15:52:14.512473Z","submitted_at":"2025-05-16T04:00:31Z","title":"A Discretization Approach for Bilevel Optimization with Low-Dimensional and Non-Convex Lower-Level","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:39.028588Z"},"links":{"citing_paper":"/paper/2505.10830"},"observation_digest":"sha256:2e0c6f498eeda7c7bd9aa79235c04d3b4c57325df501c24212439282a8dddc0c","observation_id":"c18d9717-f9d8-4e4f-b01e-4c3d17131328","resolution":{"observed_at":"2026-08-15T21:12:39.525708Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"2102.04671","last_updated":"2022-03-31T02:39:25Z","snapshot_observed_at":"2026-08-16T18:46:51.217943Z","submitted_at":"2021-02-09T06:35:30Z","title":"A Single-Timescale Method for Stochastic Bilevel Optimization","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2102.04671","snapshot_observed_at":"2026-08-15T21:12:39.032340Z","title":"A single-timescale stochastic bilevel opti- mization method","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.10830","last_updated":"2025-05-16T04:00:31Z","snapshot_observed_at":"2026-08-16T15:52:14.512473Z","submitted_at":"2025-05-16T04:00:31Z","title":"A Discretization Approach for Bilevel Optimization with Low-Dimensional and Non-Convex Lower-Level","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:39.032340Z"},"links":{"cited_paper":"/paper/2102.04671","citing_paper":"/paper/2505.10830"},"observation_digest":"sha256:f0dfb6eb4fc32c2dd3d9012840baf43ef847a9db016fb42df1d0e976f9aab557","observation_id":"47757dba-ef86-4b20-a769-5437b1fd990a","resolution":{"observed_at":"2026-08-15T21:12:39.032340Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:12:39.036336Z","title":"Understanding machine learning: From theory to algorithms","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2505.10830","last_updated":"2025-05-16T04:00:31Z","snapshot_observed_at":"2026-08-16T15:52:14.512473Z","submitted_at":"2025-05-16T04:00:31Z","title":"A Discretization Approach for Bilevel Optimization with Low-Dimensional and Non-Convex Lower-Level","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:39.036336Z"},"links":{"citing_paper":"/paper/2505.10830"},"observation_digest":"sha256:ce874ff091f91682a0df39d06e020c5fa37d599ac8a5bd14ade695a732b2a781","observation_id":"b4d2fcf0-65c5-4165-b12b-7a03d6526ad2","resolution":{"observed_at":"2026-08-15T21:12:39.036336Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:12:39.491418Z","title":"On a theorem of Danskin with an application to a theorem of von neumann-sion","venue":null,"work_id":"bbe0b8e6-c4fc-44da-a980-8242cef7c3e0","year":1995},"citing_paper":{"arxiv_id":"2505.10830","last_updated":"2025-05-16T04:00:31Z","snapshot_observed_at":"2026-08-16T15:52:14.512473Z","submitted_at":"2025-05-16T04:00:31Z","title":"A Discretization Approach for Bilevel Optimization with Low-Dimensional and Non-Convex Lower-Level","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:39.040133Z"},"links":{"citing_paper":"/paper/2505.10830"},"observation_digest":"sha256:c956c8145af8667df318289ba5129477353f9e0a03f5f3e17d9926250e73aa9a","observation_id":"9d12eed6-fd72-4329-95d2-8af77f9756d2","resolution":{"observed_at":"2026-08-15T21:12:39.496353Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:12:39.563203Z","title":null,"venue":null,"work_id":"ce8917c0-2ead-46cc-b303-e1aa80463503","year":null},"citing_paper":{"arxiv_id":"2505.10830","last_updated":"2025-05-16T04:00:31Z","snapshot_observed_at":"2026-08-16T15:52:14.512473Z","submitted_at":"2025-05-16T04:00:31Z","title":"A Discretization Approach for Bilevel Optimization with Low-Dimensional and Non-Convex Lower-Level","version":1},"reference_index":1997,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:39.013031Z"},"links":{"citing_paper":"/paper/2505.10830"},"observation_digest":"sha256:c4da68f6571aa87b1bd2ec570114cc43e719526c59eadbbeaab3dea1f9c44d44","observation_id":"8b8cdd07-6a52-42e0-b713-6f7cc92425cf","resolution":{"observed_at":"2026-08-15T21:12:39.567216Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}}],"paper":{"arxiv_id":"2505.10830","last_updated":"2025-05-16T04:00:31Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-16T15:52:14.512473Z","submitted_at":"2025-05-16T04:00:31Z","title":"A Discretization Approach for Bilevel Optimization with Low-Dimensional and Non-Convex Lower-Level"},"reference_resolution":{"displayed":40,"state_counts":{"malformed_identifier":2,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":13,"verified_exact":2,"verified_fuzzy":22},"total_outbound_references":40},"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 17 August 2026, this Paper Citation Record lists 40 of 40 outbound references and 0 inbound Pith citation observations for arXiv:2505.10830."}