{"as_of":"2026-08-09T21:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a1dc235d4e56b4ee554421ba5d30c2e1290932911cc01ed28c7d5d15c34254e3","coverage":[{"denominator":34,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":34,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:38:17.354058Z","state":"measured"},{"denominator":34,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":34,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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.14647/citation-record","integrity":"/paper/2505.14647/integrity","json":"/paper/2505.14647/citation-record.json","paper":"/paper/2505.14647"},"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-07T15:38:22.910410Z","title":"Bilevel programming for hyperparameter optimization and meta-learning,","venue":null,"work_id":"0ec44296-a79d-4948-8d7a-20a9b49412af","year":2018},"citing_paper":{"arxiv_id":"2505.14647","last_updated":"2025-08-13T21:20:55Z","snapshot_observed_at":"2026-08-08T16:28:33.554416Z","submitted_at":"2025-05-20T17:35:38Z","title":"Sequential QCQP for Bilevel Optimization with Line Search","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T15:38:13.052369Z"},"links":{"citing_paper":"/paper/2505.14647"},"observation_digest":"sha256:07c3b07e424624d21472bf6fa685bcdb95be89f4468a33c55745986c80e9629a","observation_id":"fe447356-b843-44c4-89b3-1508b3235c17","resolution":{"observed_at":"2026-08-07T15:38:22.999855Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T15:38:22.774699Z","title":"Value function based difference-of-convex algorithm for bilevel hyperparameter selection problems,","venue":null,"work_id":"8ec3df75-37c6-406f-86e9-fe1cf0489f86","year":2022},"citing_paper":{"arxiv_id":"2505.14647","last_updated":"2025-08-13T21:20:55Z","snapshot_observed_at":"2026-08-08T16:28:33.554416Z","submitted_at":"2025-05-20T17:35:38Z","title":"Sequential QCQP for Bilevel Optimization with Line Search","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T15:38:13.149174Z"},"links":{"citing_paper":"/paper/2505.14647"},"observation_digest":"sha256:b6e2bb5deb53f683628a45137f83a7f044865aaa7af95ac6a8b08f0ab3f177d3","observation_id":"84e36a64-ea10-4373-965b-dd87760ffa1c","resolution":{"observed_at":"2026-08-07T15:38:22.820965Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T15:38:22.589633Z","title":"Bilevel optimization for planning through contact: A semidirect method,","venue":null,"work_id":"9c14d3c5-a2cd-4834-9084-a9c08b8ae1a7","year":2019},"citing_paper":{"arxiv_id":"2505.14647","last_updated":"2025-08-13T21:20:55Z","snapshot_observed_at":"2026-08-08T16:28:33.554416Z","submitted_at":"2025-05-20T17:35:38Z","title":"Sequential QCQP for Bilevel Optimization with Line Search","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T15:38:13.246024Z"},"links":{"citing_paper":"/paper/2505.14647"},"observation_digest":"sha256:381464943f723976282145e6a9aa29b04c5ca0663938dfa848ef2007d4063732","observation_id":"98eeebc9-bbd9-492b-83fc-bc5724308068","resolution":{"observed_at":"2026-08-07T15:38:22.690952Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T15:38:22.395439Z","title":"Fast uav trajectory optimization using bilevel optimization with analytical gradients,","venue":null,"work_id":"549605ff-5939-49e3-9d4d-36b8e107b4fb","year":2010},"citing_paper":{"arxiv_id":"2505.14647","last_updated":"2025-08-13T21:20:55Z","snapshot_observed_at":"2026-08-08T16:28:33.554416Z","submitted_at":"2025-05-20T17:35:38Z","title":"Sequential QCQP for Bilevel Optimization with Line Search","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T15:38:13.323587Z"},"links":{"citing_paper":"/paper/2505.14647"},"observation_digest":"sha256:ffe6cdb8d7b37ce1767806ed04c722c2cc901e194250b22314e789d01fd49dda","observation_id":"8d0b648d-0f86-4384-b7e9-09fb31fbe0f4","resolution":{"observed_at":"2026-08-07T15:38:22.497153Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.12366","last_updated":"2024-09-18T23:59:29Z","snapshot_observed_at":"2026-08-09T20:41:51.565021Z","submitted_at":"2024-09-18T23:59:29Z","title":"Bilevel Optimization for Real-Time Control with Application to Locomotion Gait Generation","version":1},"cited_work":{"arxiv_id":"2409.12366","doi":null,"metadata_source":"pith","pith_arxiv_id":"2409.12366","snapshot_observed_at":"2026-08-07T15:38:18.185891Z","title":"Bilevel Optimization for Real-Time Control with Application to Locomotion Gait Generation","venue":"eess.SY","work_id":"72ab7a3b-61c3-4e29-ba0d-55855710bd71","year":2024},"citing_paper":{"arxiv_id":"2505.14647","last_updated":"2025-08-13T21:20:55Z","snapshot_observed_at":"2026-08-08T16:28:33.554416Z","submitted_at":"2025-05-20T17:35:38Z","title":"Sequential QCQP for Bilevel Optimization with Line Search","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T15:38:13.437742Z"},"links":{"cited_paper":"/paper/2409.12366","citing_paper":"/paper/2505.14647"},"observation_digest":"sha256:bc811965a192a139821b9437884d8fb3646f075bca0316a84c5d5ee4ec04ed71","observation_id":"47b5700f-2540-4fec-aade-96817e3d7116","resolution":{"observed_at":"2026-08-07T15:38:18.301882Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T15:38:22.264187Z","title":"Hyperparameter optimization with approximate gradient,","venue":null,"work_id":"1095c8b3-e891-4687-a105-a4e4f3895ea5","year":2016},"citing_paper":{"arxiv_id":"2505.14647","last_updated":"2025-08-13T21:20:55Z","snapshot_observed_at":"2026-08-08T16:28:33.554416Z","submitted_at":"2025-05-20T17:35:38Z","title":"Sequential QCQP for Bilevel Optimization with Line Search","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T15:38:13.539941Z"},"links":{"citing_paper":"/paper/2505.14647"},"observation_digest":"sha256:369115fd8ff78aabddb3deb37c364026517a715f9dfc0e00aa8393e5639958be","observation_id":"7afca994-b2bf-4c74-bebe-ad8eb5e6c5cb","resolution":{"observed_at":"2026-08-07T15:38:22.310998Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T15:38:22.120198Z","title":"Generic methods for optimization-based modeling,","venue":null,"work_id":"45ebcb75-9f80-4fbd-96a1-8b814b19afb2","year":2012},"citing_paper":{"arxiv_id":"2505.14647","last_updated":"2025-08-13T21:20:55Z","snapshot_observed_at":"2026-08-08T16:28:33.554416Z","submitted_at":"2025-05-20T17:35:38Z","title":"Sequential QCQP for Bilevel Optimization with Line Search","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T15:38:13.661008Z"},"links":{"citing_paper":"/paper/2505.14647"},"observation_digest":"sha256:bdaef6eb8de80116d3eac168786c9a8c27c1da34211c49abf494030d2f0cde0e","observation_id":"3dec7bd3-227b-42fc-a1e9-0e1b023cbd8b","resolution":{"observed_at":"2026-08-07T15:38:22.199898Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1802.02246","last_updated":"2018-02-06T22:10:14Z","snapshot_observed_at":"2026-07-06T06:22:08.261855Z","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-07T15:38:13.747171Z","title":"Approximation methods for bilevel program- ming,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.14647","last_updated":"2025-08-13T21:20:55Z","snapshot_observed_at":"2026-08-08T16:28:33.554416Z","submitted_at":"2025-05-20T17:35:38Z","title":"Sequential QCQP for Bilevel Optimization with Line Search","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T15:38:13.747171Z"},"links":{"cited_paper":"/paper/1802.02246","citing_paper":"/paper/2505.14647"},"observation_digest":"sha256:5ffd0793be33fe7c962e24a145b480f8ff8459ac0acd25cddc0f315e47c0400d","observation_id":"eccc85a5-8728-40f1-bdc9-cd1f091c5ad3","resolution":{"observed_at":"2026-08-07T15:38:13.747171Z","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-07T15:38:21.956069Z","title":"Bilevel optimization: Convergence analysis and enhanced design,","venue":null,"work_id":"b77acd61-43f2-4116-a9b8-72bd3f3a2537","year":2021},"citing_paper":{"arxiv_id":"2505.14647","last_updated":"2025-08-13T21:20:55Z","snapshot_observed_at":"2026-08-08T16:28:33.554416Z","submitted_at":"2025-05-20T17:35:38Z","title":"Sequential QCQP for Bilevel Optimization with Line Search","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T15:38:13.826646Z"},"links":{"citing_paper":"/paper/2505.14647"},"observation_digest":"sha256:fbc3747589f733e1715896c0f48a8b6fdc066caf49f50d854488c720f18dbe73","observation_id":"c8fc0311-5006-4a8e-a52c-36262a5e6002","resolution":{"observed_at":"2026-08-07T15:38:22.030656Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T15:38:21.819031Z","title":"Truncated back- propagation for bilevel optimization,","venue":null,"work_id":"9044ee60-92ce-43d9-b3af-775a1bf6563d","year":2019},"citing_paper":{"arxiv_id":"2505.14647","last_updated":"2025-08-13T21:20:55Z","snapshot_observed_at":"2026-08-08T16:28:33.554416Z","submitted_at":"2025-05-20T17:35:38Z","title":"Sequential QCQP for Bilevel Optimization with Line Search","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T15:38:13.979473Z"},"links":{"citing_paper":"/paper/2505.14647"},"observation_digest":"sha256:5547c6d8be2a1c314b64ab800bd152b9fb2df1139d29204c11e379641f335f7c","observation_id":"9b21d706-588b-4ed0-ae26-b7a4dad17c11","resolution":{"observed_at":"2026-08-07T15:38:21.872496Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T15:38:21.676014Z","title":"On the iteration complexity of hypergradient computation,","venue":null,"work_id":"6150020f-d5c0-4c8e-86bc-3f1f43e0daa0","year":2020},"citing_paper":{"arxiv_id":"2505.14647","last_updated":"2025-08-13T21:20:55Z","snapshot_observed_at":"2026-08-08T16:28:33.554416Z","submitted_at":"2025-05-20T17:35:38Z","title":"Sequential QCQP for Bilevel Optimization with Line Search","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T15:38:14.095038Z"},"links":{"citing_paper":"/paper/2505.14647"},"observation_digest":"sha256:4eaafb148c5cee4bcd9b0d1bf1d3f3a8882cc0688b0a3fb4f65268e6c8b01421","observation_id":"701d802e-1fd3-4ecd-a1a1-98c7ba361015","resolution":{"observed_at":"2026-08-07T15:38:21.749106Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T15:38:21.545315Z","title":"Big hype: Best intervention in games via distributed hypergradient descent,","venue":null,"work_id":"bac9cb4b-2dd7-4c43-acce-c7b0a423f212","year":2024},"citing_paper":{"arxiv_id":"2505.14647","last_updated":"2025-08-13T21:20:55Z","snapshot_observed_at":"2026-08-08T16:28:33.554416Z","submitted_at":"2025-05-20T17:35:38Z","title":"Sequential QCQP for Bilevel Optimization with Line Search","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T15:38:14.267209Z"},"links":{"citing_paper":"/paper/2505.14647"},"observation_digest":"sha256:f8359dc2962119708b21f723f43b092d01801a344dfb84ebdff35431ab73ee2d","observation_id":"ec013f5a-6c2e-4a6f-9216-702e97c01457","resolution":{"observed_at":"2026-08-07T15:38:21.595835Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.10148","last_updated":"2024-08-26T01:08:49Z","snapshot_observed_at":"2026-07-06T18:31:08.584682Z","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-07T15:38:14.371812Z","title":"A primal-dual-assisted penalty approach to bilevel optimization with coupled constraints,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.14647","last_updated":"2025-08-13T21:20:55Z","snapshot_observed_at":"2026-08-08T16:28:33.554416Z","submitted_at":"2025-05-20T17:35:38Z","title":"Sequential QCQP for Bilevel Optimization with Line Search","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T15:38:14.371812Z"},"links":{"cited_paper":"/paper/2406.10148","citing_paper":"/paper/2505.14647"},"observation_digest":"sha256:871842b08e899a23ceb9d34ebd1ce6a119e151ca49be0c14a8bf3a2ce067f473","observation_id":"ab513e4c-6cc7-4802-bec8-572c1d3a806a","resolution":{"observed_at":"2026-08-07T15:38:14.371812Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.01123","last_updated":"2022-06-08T16:36:24Z","snapshot_observed_at":"2026-07-06T12:43:17.428867Z","submitted_at":"2022-03-01T18:20:01Z","title":"A Primal-Dual Approach to Bilevel Optimization with Multiple Inner Minima","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.01123","snapshot_observed_at":"2026-08-07T15:38:14.507699Z","title":"A primal-dual approach to bilevel optimization with multiple inner minima,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.14647","last_updated":"2025-08-13T21:20:55Z","snapshot_observed_at":"2026-08-08T16:28:33.554416Z","submitted_at":"2025-05-20T17:35:38Z","title":"Sequential QCQP for Bilevel Optimization with Line Search","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T15:38:14.507699Z"},"links":{"cited_paper":"/paper/2203.01123","citing_paper":"/paper/2505.14647"},"observation_digest":"sha256:30d8fe8e77666cb26b6a8bb4bbe318051b79e856c5173cacb20c56097e58c8c0","observation_id":"995c59da-9f85-4b75-9fa1-a9fd5f85d562","resolution":{"observed_at":"2026-08-07T15:38:14.507699Z","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-07T15:38:21.321912Z","title":"On penalty-based bilevel gradient descent method,","venue":null,"work_id":"c0acde90-d232-471f-bbe0-b65c45452fc7","year":2023},"citing_paper":{"arxiv_id":"2505.14647","last_updated":"2025-08-13T21:20:55Z","snapshot_observed_at":"2026-08-08T16:28:33.554416Z","submitted_at":"2025-05-20T17:35:38Z","title":"Sequential QCQP for Bilevel Optimization with Line Search","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T15:38:14.628818Z"},"links":{"citing_paper":"/paper/2505.14647"},"observation_digest":"sha256:269a87888afdaa53b2765940d9982afa03a66ae44f0cf79258bda3f29fb6ef6e","observation_id":"42a9f5d7-0f41-406d-84ef-f91a0f6ef692","resolution":{"observed_at":"2026-08-07T15:38:21.383284Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T15:38:21.152477Z","title":"Penalty method for inversion-free deep bilevel optimization,","venue":null,"work_id":"19a28e3d-b76c-4f1a-a6db-79dc8e6b9348","year":2021},"citing_paper":{"arxiv_id":"2505.14647","last_updated":"2025-08-13T21:20:55Z","snapshot_observed_at":"2026-08-08T16:28:33.554416Z","submitted_at":"2025-05-20T17:35:38Z","title":"Sequential QCQP for Bilevel Optimization with Line Search","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T15:38:14.763589Z"},"links":{"citing_paper":"/paper/2505.14647"},"observation_digest":"sha256:30f7a92f31b860b68540aa2fb513bfc652ba73dd4f45144a73c0c3281c579d10","observation_id":"2c49f701-9ec6-4f9d-96b7-838ce154c806","resolution":{"observed_at":"2026-08-07T15:38:21.243342Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T15:38:20.971705Z","title":"Bome! bilevel optimization made easy: A simple first-order approach,","venue":null,"work_id":"49d1e672-fd27-46e5-8613-7ad8db7e858e","year":2022},"citing_paper":{"arxiv_id":"2505.14647","last_updated":"2025-08-13T21:20:55Z","snapshot_observed_at":"2026-08-08T16:28:33.554416Z","submitted_at":"2025-05-20T17:35:38Z","title":"Sequential QCQP for Bilevel Optimization with Line Search","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T15:38:14.897205Z"},"links":{"citing_paper":"/paper/2505.14647"},"observation_digest":"sha256:9868c30af2d1191250e67f2fd025ee55e603558f9cf1a39c78204e7c0ad36d41","observation_id":"81c71a36-5e31-46c2-aa80-3204f7b045ba","resolution":{"observed_at":"2026-08-07T15:38:21.056363Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T15:38:20.816897Z","title":"A fully first-order method for stochastic bilevel optimization,","venue":null,"work_id":"bd08384c-ea1e-4326-84ca-d81884774a08","year":2023},"citing_paper":{"arxiv_id":"2505.14647","last_updated":"2025-08-13T21:20:55Z","snapshot_observed_at":"2026-08-08T16:28:33.554416Z","submitted_at":"2025-05-20T17:35:38Z","title":"Sequential QCQP for Bilevel Optimization with Line Search","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T15:38:15.017469Z"},"links":{"citing_paper":"/paper/2505.14647"},"observation_digest":"sha256:e6c6b2313669d5358d451f52e9dcaf78db04a9bea71e8a950a1e6da6e25349c6","observation_id":"8f73b99f-3e9f-45f1-b428-34bd6e79e554","resolution":{"observed_at":"2026-08-07T15:38:20.887240Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1709.03014","last_updated":"2017-09-09T22:50:15Z","snapshot_observed_at":"2026-08-02T08:11:43.375129Z","submitted_at":"2017-09-09T22:50:15Z","title":"Global Convergence of Arbitrary-Block Gradient Methods for Generalized Polyak-{\\L}ojasiewicz Functions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1709.03014","snapshot_observed_at":"2026-08-07T15:38:15.168199Z","title":"Global convergence of arbitrary-block gradient methods for generalized polyak- {\\L} ojasiewicz functions,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.14647","last_updated":"2025-08-13T21:20:55Z","snapshot_observed_at":"2026-08-08T16:28:33.554416Z","submitted_at":"2025-05-20T17:35:38Z","title":"Sequential QCQP for Bilevel Optimization with Line Search","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T15:38:15.168199Z"},"links":{"cited_paper":"/paper/1709.03014","citing_paper":"/paper/2505.14647"},"observation_digest":"sha256:3f3c7c91a7588d5021f8e610b5e4833481997dd3062468ac2f7d6e5b97286114","observation_id":"1ff73340-dc10-4b85-b601-99fed2304b76","resolution":{"observed_at":"2026-08-07T15:38:15.168199Z","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-07T15:38:15.282705Z","title":"Control barrier function based quadratic programs for safety critical systems,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.14647","last_updated":"2025-08-13T21:20:55Z","snapshot_observed_at":"2026-08-08T16:28:33.554416Z","submitted_at":"2025-05-20T17:35:38Z","title":"Sequential QCQP for Bilevel Optimization with Line Search","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T15:38:15.282705Z"},"links":{"citing_paper":"/paper/2505.14647"},"observation_digest":"sha256:a397a8a1e9bd8abab9a20699114d7534388e758688053ef8f3ff934a69e75b08","observation_id":"03ae1afc-050d-4444-9881-80c693ef1e06","resolution":{"observed_at":"2026-08-07T15:38:15.282705Z","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-07T15:38:20.549282Z","title":"Orthog- onal directions constrained gradient method: from non-linear equality constraints to stiefel manifold,","venue":null,"work_id":"2ae6bb64-7a2e-480e-80bd-8a8e64787c4d","year":2023},"citing_paper":{"arxiv_id":"2505.14647","last_updated":"2025-08-13T21:20:55Z","snapshot_observed_at":"2026-08-08T16:28:33.554416Z","submitted_at":"2025-05-20T17:35:38Z","title":"Sequential QCQP for Bilevel Optimization with Line Search","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T15:38:15.419517Z"},"links":{"citing_paper":"/paper/2505.14647"},"observation_digest":"sha256:756d7bc65313f3f062a25734983ccc4774d607202c6d2b52351586e496056144","observation_id":"acc57a25-144c-4178-b21c-ea1ec4fcc676","resolution":{"observed_at":"2026-08-07T15:38:20.640094Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T15:38:20.325492Z","title":"Control barrier function-based design of gra- dient flows for constrained nonlinear programming,","venue":null,"work_id":"1a73fb14-b199-4b81-856e-ce4eacaf1324","year":2023},"citing_paper":{"arxiv_id":"2505.14647","last_updated":"2025-08-13T21:20:55Z","snapshot_observed_at":"2026-08-08T16:28:33.554416Z","submitted_at":"2025-05-20T17:35:38Z","title":"Sequential QCQP for Bilevel Optimization with Line Search","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T15:38:15.641674Z"},"links":{"citing_paper":"/paper/2505.14647"},"observation_digest":"sha256:b4c7d7e0a38c838a27ed9bdf0ddb40e9a7e4a3e1a922b2e869f280fc227d94f9","observation_id":"5eb0a764-7bb7-4c84-9a6d-b63f8f5d8b48","resolution":{"observed_at":"2026-08-07T15:38:20.418208Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.16520","last_updated":"2025-03-21T19:49:45Z","snapshot_observed_at":"2026-07-06T20:27:04.664873Z","submitted_at":"2025-01-27T21:39:25Z","title":"Safe Gradient Flow for Bilevel Optimization","version":2},"cited_work":{"arxiv_id":"2501.16520","doi":null,"metadata_source":"pith","pith_arxiv_id":"2501.16520","snapshot_observed_at":"2026-08-07T15:38:17.872115Z","title":"Safe Gradient Flow for Bilevel Optimization","venue":"math.OC","work_id":"68bd7dd6-7199-421d-afe7-7e71aa3f2c08","year":2025},"citing_paper":{"arxiv_id":"2505.14647","last_updated":"2025-08-13T21:20:55Z","snapshot_observed_at":"2026-08-08T16:28:33.554416Z","submitted_at":"2025-05-20T17:35:38Z","title":"Sequential QCQP for Bilevel Optimization with Line Search","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T15:38:15.769543Z"},"links":{"cited_paper":"/paper/2501.16520","citing_paper":"/paper/2505.14647"},"observation_digest":"sha256:2fdb8082d2aee260439b2c071e14f04f8ed2fb2492afab9d8e93e2ebbd899f58","observation_id":"67418ff0-04ef-4284-b128-8936d9fe138e","resolution":{"observed_at":"2026-08-07T15:38:17.950378Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T15:38:20.102627Z","title":"Practical considerations for discrete-time implementations of continuous-time control barrier function-based safety filters,","venue":null,"work_id":"91c44219-0a01-4f2b-a429-f10a5890714f","year":2024},"citing_paper":{"arxiv_id":"2505.14647","last_updated":"2025-08-13T21:20:55Z","snapshot_observed_at":"2026-08-08T16:28:33.554416Z","submitted_at":"2025-05-20T17:35:38Z","title":"Sequential QCQP for Bilevel Optimization with Line Search","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T15:38:15.907829Z"},"links":{"citing_paper":"/paper/2505.14647"},"observation_digest":"sha256:b135173d1606c60c83d02133bb1adf6a90af71df4fc6cb0c510d216f2d814510","observation_id":"5f6330ac-9bb5-4b45-a393-7c1198c7c199","resolution":{"observed_at":"2026-08-07T15:38:20.176668Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T15:38:19.983376Z","title":"Nesterov,Lectures on convex optimization , vol","venue":null,"work_id":"65a9ff07-e543-4f10-b147-c90e393c2a13","year":2018},"citing_paper":{"arxiv_id":"2505.14647","last_updated":"2025-08-13T21:20:55Z","snapshot_observed_at":"2026-08-08T16:28:33.554416Z","submitted_at":"2025-05-20T17:35:38Z","title":"Sequential QCQP for Bilevel Optimization with Line Search","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T15:38:16.066636Z"},"links":{"citing_paper":"/paper/2505.14647"},"observation_digest":"sha256:17692424f18ca8bba828b6001e64e1ebf97680b82b2c17f2a2c6cc7790ac3832","observation_id":"9a4e6050-8e4a-48df-b2bd-eb2303370a37","resolution":{"observed_at":"2026-08-07T15:38:20.040533Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T15:38:19.783601Z","title":"Discrete control barrier functions for safety-critical control of discrete systems with application to bipedal robot navigation.,","venue":null,"work_id":"7387f32a-b177-4a2b-a9ca-8327f753ccc4","year":2017},"citing_paper":{"arxiv_id":"2505.14647","last_updated":"2025-08-13T21:20:55Z","snapshot_observed_at":"2026-08-08T16:28:33.554416Z","submitted_at":"2025-05-20T17:35:38Z","title":"Sequential QCQP for Bilevel Optimization with Line Search","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T15:38:16.197901Z"},"links":{"citing_paper":"/paper/2505.14647"},"observation_digest":"sha256:2e5ab19cdec59284490cb309c1486e7f7c6bde5b0fb5f05560ee0109bfd5a502","observation_id":"a613f474-4c83-4340-9d3c-27251d446b5e","resolution":{"observed_at":"2026-08-07T15:38:19.894829Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.07469","last_updated":"2023-02-23T19:43:23Z","snapshot_observed_at":"2026-07-06T14:52:00.105177Z","submitted_at":"2023-02-15T04:47:03Z","title":"Robust Safety under Stochastic Uncertainty with Discrete-Time Control Barrier Functions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.07469","snapshot_observed_at":"2026-08-07T15:38:16.341932Z","title":"Robust safety under stochastic uncertainty with discrete-time control barrier functions,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.14647","last_updated":"2025-08-13T21:20:55Z","snapshot_observed_at":"2026-08-08T16:28:33.554416Z","submitted_at":"2025-05-20T17:35:38Z","title":"Sequential QCQP for Bilevel Optimization with Line Search","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T15:38:16.341932Z"},"links":{"cited_paper":"/paper/2302.07469","citing_paper":"/paper/2505.14647"},"observation_digest":"sha256:3fc13120d51a9e4ede24621536a1e867940e8246f8563776b4adf47486d61a4e","observation_id":"7c11278b-75e9-430c-83ea-9774c35ed480","resolution":{"observed_at":"2026-08-07T15:38:16.341932Z","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-07T15:38:19.538208Z","title":"MNIST handwritten digit database,","venue":null,"work_id":"73066224-0e9f-4fc8-bd45-908559a385d9","year":2010},"citing_paper":{"arxiv_id":"2505.14647","last_updated":"2025-08-13T21:20:55Z","snapshot_observed_at":"2026-08-08T16:28:33.554416Z","submitted_at":"2025-05-20T17:35:38Z","title":"Sequential QCQP for Bilevel Optimization with Line Search","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T15:38:16.473878Z"},"links":{"citing_paper":"/paper/2505.14647"},"observation_digest":"sha256:0a2b696f34996578a150ac224f4254ec4dd2bc3d6b3a6ea9da450a6c79d7545f","observation_id":"5cdfa4c1-f4f6-4e80-8bf7-1f47ba0b6a37","resolution":{"observed_at":"2026-08-07T15:38:19.624630Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T15:38:19.314113Z","title":"Forward and reverse gradient-based hyperparameter optimization,","venue":null,"work_id":"b1dc3d6c-12ed-4d35-856a-22e9cd81dd24","year":2017},"citing_paper":{"arxiv_id":"2505.14647","last_updated":"2025-08-13T21:20:55Z","snapshot_observed_at":"2026-08-08T16:28:33.554416Z","submitted_at":"2025-05-20T17:35:38Z","title":"Sequential QCQP for Bilevel Optimization with Line Search","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T15:38:16.592234Z"},"links":{"citing_paper":"/paper/2505.14647"},"observation_digest":"sha256:5e9afc278bf939e948810313b2cba5e80af0a2126336ef26f04198580825ac31","observation_id":"a4967189-fd69-45c0-a36f-044a0eb0ffab","resolution":{"observed_at":"2026-08-07T15:38:19.412334Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T15:38:19.055329Z","title":"A moving balls approximation method for a class of smooth constrained minimization problems,","venue":null,"work_id":"6139ddfb-1ffc-4db5-8109-329dfd3bd161","year":2010},"citing_paper":{"arxiv_id":"2505.14647","last_updated":"2025-08-13T21:20:55Z","snapshot_observed_at":"2026-08-08T16:28:33.554416Z","submitted_at":"2025-05-20T17:35:38Z","title":"Sequential QCQP for Bilevel Optimization with Line Search","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T15:38:16.776019Z"},"links":{"citing_paper":"/paper/2505.14647"},"observation_digest":"sha256:55ca69b023b68ea33e512b6cd81bf5f0bdd528382e889ebf16fa4da142823e29","observation_id":"29e81d52-907e-4dbf-8117-a8204fbccf8d","resolution":{"observed_at":"2026-08-07T15:38:19.169090Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T15:38:18.817923Z","title":"Augmented lagrangians with constrained subproblems and convergence to second-order stationary points,","venue":null,"work_id":"a10e688d-d2b1-4d2c-a842-560f383dd1c8","year":2018},"citing_paper":{"arxiv_id":"2505.14647","last_updated":"2025-08-13T21:20:55Z","snapshot_observed_at":"2026-08-08T16:28:33.554416Z","submitted_at":"2025-05-20T17:35:38Z","title":"Sequential QCQP for Bilevel Optimization with Line Search","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T15:38:16.946418Z"},"links":{"citing_paper":"/paper/2505.14647"},"observation_digest":"sha256:0fbf7c7fb732585d776588dbbd288aee9586df4bb221756877b0d3282b2db9ad","observation_id":"ba188ce4-f736-4dab-b5be-9bc3d56f4c8c","resolution":{"observed_at":"2026-08-07T15:38:18.937801Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.17215","last_updated":"2025-04-24T03:07:23Z","snapshot_observed_at":"2026-08-09T17:14:04.011735Z","submitted_at":"2025-04-24T03:07:23Z","title":"Perturbed Gradient Descent via Convex Quadratic Approximation for Nonconvex Bilevel Optimization","version":1},"cited_work":{"arxiv_id":"2504.17215","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.17215","snapshot_observed_at":"2026-08-07T15:38:17.519570Z","title":"Perturbed Gradient Descent via Convex Quadratic Approximation for Nonconvex Bilevel Optimization","venue":"math.OC","work_id":"481c687b-d77e-4d27-ae35-ecb1f1522c63","year":2025},"citing_paper":{"arxiv_id":"2505.14647","last_updated":"2025-08-13T21:20:55Z","snapshot_observed_at":"2026-08-08T16:28:33.554416Z","submitted_at":"2025-05-20T17:35:38Z","title":"Sequential QCQP for Bilevel Optimization with Line Search","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T15:38:17.075746Z"},"links":{"cited_paper":"/paper/2504.17215","citing_paper":"/paper/2505.14647"},"observation_digest":"sha256:b8a710f06c50c725514bfb4501d471873577b7ccd1f23e03d08cf805f4970d5e","observation_id":"921bd417-9a0f-4e72-8d20-edcce1504ac1","resolution":{"observed_at":"2026-08-07T15:38:17.613560Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T15:38:18.644203Z","title":"Abbott, Understanding analysis","venue":null,"work_id":"214760ad-19a7-4c0d-be75-d97a9e80fcd1","year":2015},"citing_paper":{"arxiv_id":"2505.14647","last_updated":"2025-08-13T21:20:55Z","snapshot_observed_at":"2026-08-08T16:28:33.554416Z","submitted_at":"2025-05-20T17:35:38Z","title":"Sequential QCQP for Bilevel Optimization with Line Search","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T15:38:17.198162Z"},"links":{"citing_paper":"/paper/2505.14647"},"observation_digest":"sha256:8c5f7ebd07cb128d5dd1454cc48761f9cb5be22b11c42689b81616f1e6ec4808","observation_id":"1fadb0e8-3da8-42c8-9da5-d6ed190e795c","resolution":{"observed_at":"2026-08-07T15:38:18.712738Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T15:38:18.474685Z","title":null,"venue":null,"work_id":"602c73a3-2d94-4789-9809-068c544aa662","year":2000},"citing_paper":{"arxiv_id":"2505.14647","last_updated":"2025-08-13T21:20:55Z","snapshot_observed_at":"2026-08-08T16:28:33.554416Z","submitted_at":"2025-05-20T17:35:38Z","title":"Sequential QCQP for Bilevel Optimization with Line Search","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T15:38:17.354058Z"},"links":{"citing_paper":"/paper/2505.14647"},"observation_digest":"sha256:971d91cdd95c46eaa5896f0e70d1e27bcfc053eb065eeb448daa62d6b7221cce","observation_id":"2ee76385-a842-4023-b082-17c4a098c96d","resolution":{"observed_at":"2026-08-07T15:38:18.555717Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.14647","last_updated":"2025-08-13T21:20:55Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-08T16:28:33.554416Z","submitted_at":"2025-05-20T17:35:38Z","title":"Sequential QCQP for Bilevel Optimization with Line Search"},"reference_resolution":{"displayed":34,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":3,"verified_fuzzy":24},"total_outbound_references":34},"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 34 of 34 outbound references and 0 inbound Pith citation observations for arXiv:2505.14647."}