{"as_of":"2026-08-19T23:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:56f828957588b296b51bf336c4b17b29d7f1117b2e81170f35b87645e61f8010","coverage":[{"denominator":106,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T20:49:58.385317Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+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/2602.22573/citation-record","integrity":"/paper/2602.22573/integrity","json":"/paper/2602.22573/citation-record.json","paper":"/paper/2602.22573"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T20:49:47.790264Z","title":null,"venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:47.790264Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:cfaa880540976c7a2787dec578459f81ed5f103bd824a0d17aff31c31189c664","observation_id":"e35bca24-72d3-4073-a559-1b222a70a1fb","resolution":{"observed_at":"2026-08-02T20:49:47.790264Z","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-02T20:49:47.960980Z","title":"Bai and J","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:47.960980Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:6d2a47858edc5db086f24d1a8f9a9b048b62a02091c0e2e58413dc3a4494ac23","observation_id":"75381736-f367-4e3f-9ddf-d37a3c3b273f","resolution":{"observed_at":"2026-08-02T20:49:47.960980Z","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-02T20:49:48.133025Z","title":"Bai and J","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:48.133025Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:f3e3660eb1b92bb621e85498d1e5f0a69d53bafad2be199250ef39cab4707050","observation_id":"2baf1270-c0fd-4721-b068-545b31088db4","resolution":{"observed_at":"2026-08-02T20:49:48.133025Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.03604","last_updated":"2023-11-06T23:16:38Z","snapshot_observed_at":"2026-08-16T14:45:28.674937Z","submitted_at":"2023-11-06T23:16:38Z","title":"Directional derivative of the value function for parametric set-constrained optimization problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.03604","snapshot_observed_at":"2026-08-02T20:49:48.305994Z","title":"Bai and J","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:48.305994Z"},"links":{"cited_paper":"/paper/2311.03604","citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:1663a397e43d97c9ebad95c8df7b4e70363e6cde381f4ce224ba53b48d3f9146","observation_id":"f8c9b878-1e0b-4a0a-9e16-6c3014f766fc","resolution":{"observed_at":"2026-08-02T20:49:48.305994Z","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-02T20:49:48.434839Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:48.434839Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:d7aae6cb60ebd648bb309a6e482b18322ac83bfbd7a1a58fee03b1d39eda3b84","observation_id":"44b324e0-89af-493d-a5a4-de47af788929","resolution":{"observed_at":"2026-08-02T20:49:48.434839Z","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-02T20:49:48.531883Z","title":null,"venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:48.531883Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:44ac075a8dd7623aafd616cfb0b23ab747cce63507a931d5e3cfc49dcbde711d","observation_id":"25a2b26d-2ed3-4eab-bdf8-753e90fea5d4","resolution":{"observed_at":"2026-08-02T20:49:48.531883Z","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-02T20:49:48.661110Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:48.661110Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:25d67c7dfbb537ea425137460a415ea625a52426d19f91099c605c03e975ae7d","observation_id":"8593773d-c7fb-42ab-8b54-efe7540e8e8d","resolution":{"observed_at":"2026-08-02T20:49:48.661110Z","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-02T20:49:48.750766Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:48.750766Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:5da59a98ed091de83298e865dd7a99fcb125acbd0eac4b846a42b709b3f51030","observation_id":"6ba3a678-3a0a-4e74-a72e-a67d2120673b","resolution":{"observed_at":"2026-08-02T20:49:48.750766Z","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-02T20:49:48.837698Z","title":"Bector, S","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:48.837698Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:b97ccc5ead30cda3d0cdc4ce91793e0b721094957ce582067fd2ad19e7bb67f0","observation_id":"28297e71-4515-4e30-ae8e-efff3e6b58bd","resolution":{"observed_at":"2026-08-02T20:49:48.837698Z","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-02T20:49:48.939760Z","title":"Benko, H","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:48.939760Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:ba3c88c1725e3360b6bab128d9e4b15b49b4a7a24c79dbd3b466a7747b1fb727","observation_id":"6be00433-237c-4436-8b4e-a9e07230fdf2","resolution":{"observed_at":"2026-08-02T20:49:48.939760Z","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-02T20:49:49.080707Z","title":"Benko, H","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:49.080707Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:619fd8432cf8aae3ba34d80a8e4743afaed2772af2c9bef6a520642896e9d960","observation_id":"a7612062-8703-4ec4-a050-ca666c0ca30d","resolution":{"observed_at":"2026-08-02T20:49:49.080707Z","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-02T20:49:49.218299Z","title":null,"venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:49.218299Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:4e8689c04237f6b22f0a620a2cbce0433c7ea8ca1c3f8599c92a3ef73556f3f4","observation_id":"861ecbf4-fdce-425c-a35f-ee010316f9df","resolution":{"observed_at":"2026-08-02T20:49:49.218299Z","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-02T20:49:49.404129Z","title":"Bertsekas, A.E","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:49.404129Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:3f5461990d4f3113f0ab9611f21065d4a99890f3ae1395c9f36547388e82553b","observation_id":"43d59d19-68b1-4107-853c-2364e7c550ab","resolution":{"observed_at":"2026-08-02T20:49:49.404129Z","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-02T20:49:49.530533Z","title":"Bertsekas, and A.Nedi c , A.E","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:49.530533Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:b57c875b93198c8765a6928a7f9163991ecf6b0615b25f1f9766df701e55e871","observation_id":"1b18eec1-c81b-45ec-81f6-5d1bb3e78f5b","resolution":{"observed_at":"2026-08-02T20:49:49.530533Z","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-02T20:49:49.698759Z","title":null,"venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:49.698759Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:aa2d374e532aed21ebb6ca3a0a35040fabb9a1539a3b614426050452014bfd0e","observation_id":"ef6dcdba-4ca0-46fa-9755-96e8c08f0077","resolution":{"observed_at":"2026-08-02T20:49:49.698759Z","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-02T20:49:49.776206Z","title":null,"venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:49.776206Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:0693bdb758593ab7169f7b73c9b27c62a093b45cb7e27c098dfc0afb964179d8","observation_id":"55876ee3-5e3a-48a1-8015-783b441626b1","resolution":{"observed_at":"2026-08-02T20:49:49.776206Z","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-02T20:49:49.901470Z","title":"Bracken and J","venue":null,"work_id":null,"year":1973},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:49.901470Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:044f707e297859148ea830d8d7d43b58df2baafe4a22491761f8772a820111f1","observation_id":"6f47c1b7-f2b1-4f69-bf3f-379a779d6c9d","resolution":{"observed_at":"2026-08-02T20:49:49.901470Z","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-02T20:49:50.003923Z","title":null,"venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:50.003923Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:455604f3936a00ede209ba61a3ce8c2c68f939caa0ee7cc350cc2cbb388962dc","observation_id":"3d46d6cf-d5cd-40bb-ac5b-3c58febff83c","resolution":{"observed_at":"2026-08-02T20:49:50.003923Z","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-02T20:49:50.096204Z","title":null,"venue":null,"work_id":null,"year":1980},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:50.096204Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:0da95cf1fd584cd0ebc66a604c96a413294aaedfca20341abb9c121f52e912ec","observation_id":"7da684b0-4a3c-48c5-9755-d3f293137b40","resolution":{"observed_at":"2026-08-02T20:49:50.096204Z","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-02T20:49:50.138569Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:50.138569Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:218cf7d3d1a33943bc9409251195c9463633b526e8567a0b5e139624cf4a4665","observation_id":"1bc3b16a-b044-4c5b-961f-f71a9cfbf6b2","resolution":{"observed_at":"2026-08-02T20:49:50.138569Z","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-02T20:49:50.284362Z","title":null,"venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:50.284362Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:b70a2126830030d7f663aef5d877b6ea64aa247a97e16e0a2a90bf2ae4f28ab4","observation_id":"fb34ce76-2e2a-426f-b5f9-50e4f29e00d5","resolution":{"observed_at":"2026-08-02T20:49:50.284362Z","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-02T20:49:50.393164Z","title":"Dempe , Foundations of bilevel programming , Kluwer Academic, Dordrecht, 2002","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:50.393164Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:f1e268ae0aa0c86426458b3d63028190e8d66a6835de427fb22ae969f737a92a","observation_id":"03b70449-eacb-4e4a-8ae3-ddf1ba83c09a","resolution":{"observed_at":"2026-08-02T20:49:50.393164Z","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-02T20:49:50.523506Z","title":"Dempe , A necessary and sufficient optimality condition for bilevlel programming problems","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:50.523506Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:637c8ba640c619d43ae26c7118e00b976068dcb8acad1d9f016ec4dacd440087","observation_id":"f8f84f7e-bfae-4076-b7f8-c56c0e8a1080","resolution":{"observed_at":"2026-08-02T20:49:50.523506Z","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-02T20:49:50.692786Z","title":"Dempe and J","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:50.692786Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:4b290213072b18f30402c9d06f15e18efa37c5a1b04e8d798ed68bd16ff92282","observation_id":"56007be4-b8c5-44ca-ab0b-c1d588bd692d","resolution":{"observed_at":"2026-08-02T20:49:50.692786Z","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-02T20:49:50.785483Z","title":"Dempe, J","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:50.785483Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:49cf4fd2e641c70599de6ac43e6f6933bd31d7641bb2be5cef1ab68de7554a51","observation_id":"7ab6103f-5024-4260-b95d-0061a76a3d3b","resolution":{"observed_at":"2026-08-02T20:49:50.785483Z","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-02T20:49:50.881661Z","title":"Dempe and A","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:50.881661Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:a2fe20da4838dbc25be95c64433923624e01420304d7d380f7fce90c3ce7bfae","observation_id":"31c66347-a168-458c-bf1a-2e7e318a6d78","resolution":{"observed_at":"2026-08-02T20:49:50.881661Z","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-02T20:49:50.978150Z","title":null,"venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:50.978150Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:ec7b1c8deb9c2d03974a5db5a3088baa6dfe54bf3475b27d455dfa713ee1e4dc","observation_id":"2aea964a-8d57-42c2-a217-e5a4bf1ebbe0","resolution":{"observed_at":"2026-08-02T20:49:50.978150Z","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-02T20:49:51.063409Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:51.063409Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:c300deed7d8928765da87444570082547ac6f357829e9241f469063e045662a3","observation_id":"400e1d05-1a34-4359-95f8-022d4967acf6","resolution":{"observed_at":"2026-08-02T20:49:51.063409Z","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-02T20:49:51.126778Z","title":"Fernández-Blanco, J","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:51.126778Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:52b8b54d1c2c5315e4cc955299e609d30616ccff8565945767f448aaee6eab02","observation_id":"3bd0073f-6c99-40e2-b2d2-fb36b40de021","resolution":{"observed_at":"2026-08-02T20:49:51.126778Z","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-02T20:49:51.225666Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:51.225666Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:10d5aeef3f09056ba85e4927fd885775a3e214ac7ea7c8b1f39012e4b8cce978","observation_id":"77632385-a21b-47b5-bf7d-1d3f596844e6","resolution":{"observed_at":"2026-08-02T20:49:51.225666Z","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-02T20:49:51.353177Z","title":"Gauvin and F","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:51.353177Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:84f60c2964b21096e93cd7b9fb0a20223bce23ec1ab2c2ae584ac518e3268eea","observation_id":"05e19731-64d9-491e-8b70-8e39fa7daedd","resolution":{"observed_at":"2026-08-02T20:49:51.353177Z","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-02T20:49:51.413623Z","title":"Gfrerer , On directional metric subregularity and second-order optimality conditions for a class of nonsmooth mathematical programs , SIAM J","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:51.413623Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:bbe527ceb78d1c23fa0e793a9d6a0786700430d8f298ebbf8625a9f364f619d5","observation_id":"a39a153a-9c33-4db9-a14e-80d121ff71d3","resolution":{"observed_at":"2026-08-02T20:49:51.413623Z","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-02T20:49:51.596275Z","title":"Gfrerer , Second-order optimality conditions for scalar and vector optimization problems in Banach spaces , SIAM J","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:51.596275Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:dcbe632511eba43b17d4fa41319456451600c3dd2515cfbaf545fc241e480411","observation_id":"057cc9ee-71ab-40e8-8f7d-c3eef7faaffd","resolution":{"observed_at":"2026-08-02T20:49:51.596275Z","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-02T20:49:51.672990Z","title":"Gfrerer , On directional metric regularity, subregularity and optimality conditions for nonsmooth mathematical programs","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:51.672990Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:059a3dc8bb8dc6168d582cc6f62a7e431fafaef5b7fcff9c393ee68b53aa24e5","observation_id":"341b474c-a4e1-4ccd-a378-8ef9d793df45","resolution":{"observed_at":"2026-08-02T20:49:51.672990Z","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-02T20:49:51.848167Z","title":"Gfrerer , On metric pseudo-(sub) regularity of multifunctions and optimality conditions for degenerated mathematical programs , Set-Valued Var","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:51.848167Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:f931c86240255bac6c399445dba9df9d911bcc79bdb9a076df5e8eb82c095cde","observation_id":"ec5e88a1-0408-4d6b-87ad-c4f441cba806","resolution":{"observed_at":"2026-08-02T20:49:51.848167Z","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-02T20:49:52.024352Z","title":"Gfrerer , Optimality conditions for disjunctive programs based on generalized differentiation with application to mathematical programs with equilibrium constraints , SIAM J","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:52.024352Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:2e8e3bdd87149048dc138213d0ad3b44f001a2cbb78b828c7ed4cd2cc765f6c5","observation_id":"75158454-60ba-455d-b593-07e39fce39ea","resolution":{"observed_at":"2026-08-02T20:49:52.024352Z","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-02T20:49:52.192184Z","title":"Gfrerer and D","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:52.192184Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:ce412496964af686db912a5d860d12dc8bac207717efdba959d86ad861ad2e65","observation_id":"93a675b5-cde1-4403-b4c6-aa6cd6f18c65","resolution":{"observed_at":"2026-08-02T20:49:52.192184Z","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-02T20:49:52.396775Z","title":"Gfrerer and B","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:52.396775Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:c33a2d64ae54ab987c7b7b264012ffe9673376023134b4fe8c250ea27ed9c75b","observation_id":"afc7d9b4-1cf6-41c6-b57a-64442ad7ea29","resolution":{"observed_at":"2026-08-02T20:49:52.396775Z","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-02T20:49:52.573686Z","title":"Gfrerer and J.J","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:52.573686Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:c010dc43308e671646583ecd2349a39f2be22dd47d44266c2d84cd19621a4988","observation_id":"6807bbd7-5f2e-4123-b81c-2ab727cea544","resolution":{"observed_at":"2026-08-02T20:49:52.573686Z","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-02T20:49:52.697938Z","title":"Gfrerer and J","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:52.697938Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:c70a18dace65d406bb368e75e6958f959bb4e93d7d4651508c636468f77cea1c","observation_id":"951afb4b-bc49-4f93-a276-f4af682a25c6","resolution":{"observed_at":"2026-08-02T20:49:52.697938Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1911.04076","last_updated":"2020-01-14T18:58:03Z","snapshot_observed_at":"2026-08-11T14:17:06.990181Z","submitted_at":"2019-11-11T05:04:41Z","title":"Second-order optimality conditions for non-convex set-constrained optimization problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.04076","snapshot_observed_at":"2026-08-02T20:49:52.793321Z","title":"Gfrerer, J","venue":null,"work_id":null,"year":1911},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:52.793321Z"},"links":{"cited_paper":"/paper/1911.04076","citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:8974da64cf0a71a09edeca5130ce9294cfa68ddebc260c5dfc62eca304fb377c","observation_id":"6de86684-ed0d-41c0-8e73-980d4fff6190","resolution":{"observed_at":"2026-08-02T20:49:52.793321Z","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-02T20:49:52.930803Z","title":"Ginchev and B","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:52.930803Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:7bedcbd03ca67f3b4c6a40d42486e5f19c8c0d2b311704e376f97834cc089481","observation_id":"dc142002-2a51-48d3-baed-f0489cb12538","resolution":{"observed_at":"2026-08-02T20:49:52.930803Z","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-02T20:49:52.992676Z","title":null,"venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:52.992676Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:e6407c235cf857a9d354ea7e1c37367b6511b400ae05989584e0fcaf5712dd4a","observation_id":"ee97494c-e70e-47ee-ab69-ab63137a02d6","resolution":{"observed_at":"2026-08-02T20:49:52.992676Z","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-02T20:49:53.059653Z","title":"Guillemin and A","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:53.059653Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:209a74abc3664bda92b296dec78a3c95101c23fa5fc1b9e9f420d3f106b1236d","observation_id":"4763b5f6-1de6-475c-bbea-8050e2aca142","resolution":{"observed_at":"2026-08-02T20:49:53.059653Z","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-02T20:49:53.150433Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:53.150433Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:29954b6128c628326d835eca068eb15f7e3c3e14daf37e865d69e4f5b3b8ec60","observation_id":"1d1be4c6-53fe-4b70-b634-8005259730d0","resolution":{"observed_at":"2026-08-02T20:49:53.150433Z","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-02T20:49:53.228085Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:53.228085Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:de84e1c9eb07123e1757d6719aa2fe849c12c1d82c0722e62827f4825716b19d","observation_id":"57683468-2d6f-493e-a07b-acd683741bab","resolution":{"observed_at":"2026-08-02T20:49:53.228085Z","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-02T20:49:53.323315Z","title":"Guo, G-H","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:53.323315Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:148b2a4df246792ece799e3716974158bb1e27abeb3e1a2d681d6feb34ce0630","observation_id":"21bf2fc0-7476-4158-a561-26b2b3f6ba27","resolution":{"observed_at":"2026-08-02T20:49:53.323315Z","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-02T20:49:53.414181Z","title":"Hatcher , Algebraic topology , Cambridge University Press, 2002","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:53.414181Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:21c2c898af436979c98aaa8eca36fdfd850833fda66625e210f7cb5126a7aaad","observation_id":"f761ce37-b1fc-4f29-a1c1-4c0e572eb7bd","resolution":{"observed_at":"2026-08-02T20:49:53.414181Z","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-02T20:49:53.516365Z","title":"Henrion, J.V","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:53.516365Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:9d0e0e6d3150ec9386fb56bf8430f5d8e5a7f0ddcf87316db982f6144aa65afd","observation_id":"8ec650a9-4631-43f2-a573-d46ee727df1c","resolution":{"observed_at":"2026-08-02T20:49:53.516365Z","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-02T20:49:53.626862Z","title":"Henrion and T","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:53.626862Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:7abfc1450f1c54d3ea163e98df4519cad9630f5aa65c30c4619e6970130d5748","observation_id":"8d09c3b8-72ff-47e2-8ef4-8ee3cd706e3f","resolution":{"observed_at":"2026-08-02T20:49:53.626862Z","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-02T20:49:53.734382Z","title":null,"venue":null,"work_id":null,"year":1975},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:53.734382Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:4bdd3cb21f0e88a84440d2ade90075f87a962c41cb3848ec6e07875e33b4ca94","observation_id":"ca48ad58-42b7-4754-97ab-23fd915c1e4b","resolution":{"observed_at":"2026-08-02T20:49:53.734382Z","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-02T20:49:53.842405Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:53.842405Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:1c4131ab36937d83d7deffeb48cc5bba363b11d8d843fb3ec7f9ba6fbb4bf9c1","observation_id":"fdb1a062-5bac-46f3-910a-e345e47fd358","resolution":{"observed_at":"2026-08-02T20:49:53.842405Z","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-02T20:49:53.945476Z","title":"Janin , Directional derivative of the marginal function in nonlinear programming , Math","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:53.945476Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:83d5a65c9b837697b11c6ab5a3a66176fdfb36b31576b41471d38f1af14ff187","observation_id":"0f85ca9a-44ac-4a73-a79b-2cd8528e2345","resolution":{"observed_at":"2026-08-02T20:49:53.945476Z","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-02T20:49:54.056245Z","title":"John , Extremum problems with inequalities as subsidiary conditions , Traces and emergence of nonlinear programming (pp","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:54.056245Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:20f4de74569710aee12ae010bea1a1f148329ccd568b177eb56fbf97c09f536b","observation_id":"036ecc40-82bd-41d1-bf1d-0816382ea6ac","resolution":{"observed_at":"2026-08-02T20:49:54.056245Z","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-02T20:49:54.218347Z","title":"Kalashnikov, S","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:54.218347Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:425a0dc84b294dee587c920366d288095593905906991d9ebbf0129cea3143ba","observation_id":"fe4cb3c6-aa85-44f6-a987-4a191f5de418","resolution":{"observed_at":"2026-08-02T20:49:54.218347Z","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-02T20:49:54.339166Z","title":"Ko cvara and J","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:54.339166Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:dd0ecd71b2cb08e692ebd6c26471a33d5868e2d1cf367d814403a852d4661415","observation_id":"357dd566-f5ce-4f07-93cc-3f43aaa459b0","resolution":{"observed_at":"2026-08-02T20:49:54.339166Z","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-02T20:49:54.413864Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:54.413864Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:1abf75a01a7f31ee72da690560e3ecd5ff3a4ea6919489b6a65fd9b0c67840e7","observation_id":"22d07f7a-50f9-4091-9bfb-54ac56da009d","resolution":{"observed_at":"2026-08-02T20:49:54.413864Z","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-02T20:49:54.485499Z","title":"Kirkegaard , Moral hazard and the spanning condition without the first-order approach , Games","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:54.485499Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:f91597fb37169c186837792a9c5a47f9078a819e0d8e201ab35b445af0c9f1c4","observation_id":"4797e2fa-6652-4b25-bd0e-e1b3a16d2734","resolution":{"observed_at":"2026-08-02T20:49:54.485499Z","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-02T20:49:54.623822Z","title":"Kunapuli, K","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:54.623822Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:dc1ce3da992217acaa65ab975ae15a33c2407a3c504f9f9ab367f64a9f5615dc","observation_id":"baff7e9c-80ae-4101-874e-17c6c9efd537","resolution":{"observed_at":"2026-08-02T20:49:54.623822Z","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-02T20:49:54.689245Z","title":"Lachhwani and A","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:54.689245Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:c22169a37f50587651e13ebe62eba7c9c663a5f46c168e9b4a6894a11536ade6","observation_id":"5d77ec4c-3de1-448a-b220-2ff2e8376a82","resolution":{"observed_at":"2026-08-02T20:49:54.689245Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.03083","last_updated":"2021-12-28T01:38:31Z","snapshot_observed_at":"2026-08-14T16:08:16.394756Z","submitted_at":"2019-07-06T06:06:28Z","title":"Task-Oriented Convex Bilevel Optimization with Latent Feasibility","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.03083","snapshot_observed_at":"2026-08-02T20:49:54.803608Z","title":null,"venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:54.803608Z"},"links":{"cited_paper":"/paper/1907.03083","citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:cfc56386e523ed824461a8ad6ad8bb7f7e1e125e9a457aaf44141e7b642e4ac8","observation_id":"690c9285-a6c7-44fc-b9e9-2630813be869","resolution":{"observed_at":"2026-08-02T20:49:54.803608Z","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-02T20:49:54.915444Z","title":"Lang , Fundamentals of differential geometry , Springer-Verlag, New York, 1999","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:54.915444Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:2121aba990f533869439d3a611442191952e541147dd176370197193f6b4aea1","observation_id":"25f8c84e-2264-4c4e-9e45-ed1377e607b9","resolution":{"observed_at":"2026-08-02T20:49:54.915444Z","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-02T20:49:55.029338Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:55.029338Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:caa8ff217ab74c12f6250c949e0f63d3a1d5bff498277d9814ea141e1a54ab3e","observation_id":"28fd7ba6-98bb-4609-aac1-1eb796c4ef39","resolution":{"observed_at":"2026-08-02T20:49:55.029338Z","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-02T20:49:55.175897Z","title":null,"venue":null,"work_id":null,"year":1969},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:55.175897Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:dcf252c46e174fe829b5158c38c8d7ce836051bf21ebe89788ba79c7349c5b97","observation_id":"ae6b233f-03c1-4569-806f-0a547864857c","resolution":{"observed_at":"2026-08-02T20:49:55.175897Z","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-02T20:49:55.271551Z","title":null,"venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:55.271551Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:ceab80daa897af26efa3de37be7eaeb449453634e8a9bd1c9e58c7adaf60af95","observation_id":"f364c0e5-1307-4ae5-85b8-94314c99ac97","resolution":{"observed_at":"2026-08-02T20:49:55.271551Z","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-02T20:49:55.367898Z","title":"Matou e k , Lectures on discrete geometry , Springer-Verlag, New York, 2002","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:55.367898Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:c7e90909b6734cac4afc701e4ac0245d6d2ef487a23458946c740a441129b9f8","observation_id":"5d74a9c6-56ef-4f5a-8113-43b95b5726e1","resolution":{"observed_at":"2026-08-02T20:49:55.367898Z","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-02T20:49:55.429099Z","title":null,"venue":null,"work_id":null,"year":1967},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:55.429099Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:c85c7d148b19c16ae35b032e2c2bda9b173cf0f983212298c6e9b4dd8c78de70","observation_id":"743eb3b6-556e-4106-a815-0c59a4ab514d","resolution":{"observed_at":"2026-08-02T20:49:55.429099Z","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-02T20:49:55.559180Z","title":"Minchenko and S","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:55.559180Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:327cb948a1388584e326fb3c7d9def23ee57224ac601d0ae39d5eda977d26492","observation_id":"37d1ad4b-b112-4220-b83f-8887e6e0b410","resolution":{"observed_at":"2026-08-02T20:49:55.559180Z","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-02T20:49:55.626560Z","title":"Mirrlees , The optimal structure of incentives and authority within an organization , Bell j","venue":null,"work_id":null,"year":1976},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:55.626560Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:5479b7955591f26f480a3227fcf0eeb0d5b1e9d403ee7a9ab4d36207b1ea3ca4","observation_id":"5728a38e-a31b-4e43-9b74-fee8c855a5c5","resolution":{"observed_at":"2026-08-02T20:49:55.626560Z","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-02T20:49:55.726732Z","title":"Mirrlees , The theory of moral hazard and unobservable behaviour: Part I , Rev","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:55.726732Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:0cbdbdc66c332729935e3c678d9eb4a8e0a0786a5ef117c87080a339969ca0cc","observation_id":"55c9a759-aebe-4f60-b6cb-0234e51cbd3a","resolution":{"observed_at":"2026-08-02T20:49:55.726732Z","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-02T20:49:55.819937Z","title":"Mirrlees , The theory of moral hazard and unobservable behaviour-Part I","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:55.819937Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:53e718693e628259427279787d03cad6211b7e4e3f4bb36f2ea9b34983c95ec3","observation_id":"71b46d79-571f-46ce-a030-26a8b9c812d6","resolution":{"observed_at":"2026-08-02T20:49:55.819937Z","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-02T20:49:55.909643Z","title":null,"venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:55.909643Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:7747b74c99288743ab4a62a7ea5b4e5ab4213ee74f1bde0ce5b2ae6dc2bd14ae","observation_id":"c0c0bfc7-0d6b-4290-a718-8f2a95ff0ea5","resolution":{"observed_at":"2026-08-02T20:49:55.909643Z","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-02T20:49:56.002864Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:56.002864Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:bf9c4ba7e108ff873a62f1209725f2ccf8f749f7cee80fd1d9486f0d52fc572f","observation_id":"2f21e4c5-78fb-462a-af89-1260ebf766ba","resolution":{"observed_at":"2026-08-02T20:49:56.002864Z","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-02T20:49:56.084022Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:56.084022Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:69cc669b21693499c855f701da0303deacc1bd45db56c4b8ae04bcf706ac879a","observation_id":"55794991-a1f4-4b61-b5d2-d170cf0aefd4","resolution":{"observed_at":"2026-08-02T20:49:56.084022Z","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-02T20:49:56.234257Z","title":null,"venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:56.234257Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:afff610652a1a44625a8da560663a62c38e8d3ef45cacb1d06286fee3161542a","observation_id":"f810ed00-bfef-4d96-bb2e-34c1880822cb","resolution":{"observed_at":"2026-08-02T20:49:56.234257Z","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-02T20:49:56.327555Z","title":"Nie , Optimality conditions and finite convergence of Lasserre’s hierarchy , Math","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:56.327555Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:7f715ca101ab7fb7424491dcbfde5310ceb1e58e6c1e1c217ddf4c8586553490","observation_id":"f09fd82e-f36f-4655-b807-599ac08eb18d","resolution":{"observed_at":"2026-08-02T20:49:56.327555Z","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-02T20:49:56.394873Z","title":"Nie , The hierarchy of local minimums in polynomial optimization , Math","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:56.394873Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:50cb2778673db93b159f39f1ad7d3d3964c383d56b420cd9d28d9a436a63bc7b","observation_id":"990da74a-4fdf-4316-8535-3f30fec768f2","resolution":{"observed_at":"2026-08-02T20:49:56.394873Z","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-02T20:49:56.524043Z","title":null,"venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:56.524043Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:940aa879ac10ac8500ceb65ed53e5f6b85c9fcb569f93585f5ce3ac013c8d8b6","observation_id":"71894609-e405-45cd-b791-f806d75b5b5d","resolution":{"observed_at":"2026-08-02T20:49:56.524043Z","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-02T20:49:56.621040Z","title":"Ouyang, J","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:56.621040Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:a96411666e8547bdbd638f8c014b709115f7cf66ca457a64649c97101e104d21","observation_id":"6bce7b1b-5980-419e-869b-fff68b15bb66","resolution":{"observed_at":"2026-08-02T20:49:56.621040Z","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-02T20:49:56.719339Z","title":"Renner and K","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:56.719339Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:f113dc33c3355507353d1cb77847d8e4406586be2b3a04cf557dbd2993acb8b9","observation_id":"b1d08aab-2930-4f14-abe9-6c259d5845c4","resolution":{"observed_at":"2026-08-02T20:49:56.719339Z","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-02T20:49:56.820103Z","title":null,"venue":null,"work_id":null,"year":1981},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:56.820103Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:bfb300655761e43d9f12bf70ea516ab0916a240dbf0a125b62d7d33762be3c1c","observation_id":"9f0e953d-52f7-43cb-9ae0-8efc4694b7c6","resolution":{"observed_at":"2026-08-02T20:49:56.820103Z","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-02T20:49:56.883317Z","title":null,"venue":null,"work_id":null,"year":1976},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:56.883317Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:69f9ea9c0ef6242f85d507c66fe84f91d6b7ca9bac7129f17f381b46fed48cbc","observation_id":"4de1fc60-838f-460d-8cae-413c9de3f976","resolution":{"observed_at":"2026-08-02T20:49:56.883317Z","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-02T20:49:56.978591Z","title":null,"venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:56.978591Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:6ad93c71ef7a89d2f5efe1da2dc3196a465ff39885f80db6f926a3d692dfd35d","observation_id":"db839075-6f1a-41d0-a3a1-616b40961d60","resolution":{"observed_at":"2026-08-02T20:49:56.978591Z","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-02T20:49:57.046009Z","title":null,"venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:57.046009Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:ab5304712c892b2839382f1b7682b06125254272c2df27525cfd737b5e5c20b6","observation_id":"99d26e08-e116-4c84-94c7-266a792b76a7","resolution":{"observed_at":"2026-08-02T20:49:57.046009Z","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-02T20:49:57.126817Z","title":null,"venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":85,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:57.126817Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:7b4d37ff7d53777092d7b45a28d6f78c1c4704b768c4fd103066289e49f549b1","observation_id":"aa36c277-ce15-4704-8b7e-c0bc5d528e6e","resolution":{"observed_at":"2026-08-02T20:49:57.126817Z","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-02T20:49:57.181017Z","title":"Scheel and S","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":86,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:57.181017Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:b11df1df7d48779a9b36d799090dff474868dc41d7f7da2c56bc414299b97f27","observation_id":"4d5936e9-14b1-45b6-80c4-e2fd98292589","resolution":{"observed_at":"2026-08-02T20:49:57.181017Z","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-02T20:49:57.284295Z","title":null,"venue":null,"work_id":null,"year":1954},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":87,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:57.284295Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:80102ce69db46d23157005045b950599e830e064edaa60a8402233faa55b1889","observation_id":"8c779f48-e712-4525-97f6-220577427e42","resolution":{"observed_at":"2026-08-02T20:49:57.284295Z","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-02T20:49:57.378873Z","title":"von Stackelberg , Marktform and Gleichgewicht , Springer-Verlag, Berlin, 1934, engl","venue":null,"work_id":null,"year":1934},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":88,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:57.378873Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:7ecbee159de668b074079ad128dd7796ab29a62b24285b50e9240943163f991d","observation_id":"887b194b-0f78-4474-a308-45d1a104985c","resolution":{"observed_at":"2026-08-02T20:49:57.378873Z","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-02T20:49:57.469829Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":89,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:57.469829Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:06577cd54638cd55b8dab15ecb23f253f5dd9d69c7cb89f4eef51c19cdddad70","observation_id":"c1f306e2-d405-429d-be48-9184d2b4aeef","resolution":{"observed_at":"2026-08-02T20:49:57.469829Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.12372","last_updated":"2020-03-23T16:38:25Z","snapshot_observed_at":"2026-08-14T22:50:14.491621Z","submitted_at":"2019-12-28T00:06:55Z","title":"Relaxed constant positive linear dependence constraint qualification and its application to bilevel programs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.12372","snapshot_observed_at":"2026-08-02T20:49:57.528952Z","title":"Xu and J","venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":90,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:57.528952Z"},"links":{"cited_paper":"/paper/1912.12372","citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:97674788c777182f9de63fb422ca01c873b4a0e8b3833b2b2ae8e95f5c762dcf","observation_id":"a91ab204-2d7a-4350-b0ac-b186f6b086cd","resolution":{"observed_at":"2026-08-02T20:49:57.528952Z","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-02T20:49:57.614423Z","title":null,"venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":91,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:57.614423Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:3e1d8f106c0a12867bfc55fd141cb729fcdedf7856d632d8a159c627620138ad","observation_id":"a058b70b-7a3d-4c08-900c-fb01c51625ed","resolution":{"observed_at":"2026-08-02T20:49:57.614423Z","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-02T20:49:57.710892Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":92,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:57.710892Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:92aa54d9c869dd2f062f1ffb96fa252e3b77c1c60622f689350eff7aebf5561a","observation_id":"c03aebfb-b9f6-4c12-8a5e-e6e67336c6a5","resolution":{"observed_at":"2026-08-02T20:49:57.710892Z","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-02T20:49:57.811744Z","title":null,"venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":93,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:57.811744Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:9d8378b697f16d75bead5ffa82dc0021e92ebe2e6b23638414a8865c4986c01b","observation_id":"cbc8298f-d1b8-444d-ae1e-de7b052ff322","resolution":{"observed_at":"2026-08-02T20:49:57.811744Z","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-02T20:49:57.924727Z","title":null,"venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":94,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:57.924727Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:58daa33f977855a354c860afa1f05a622b00e7349a9650813436664e2c37707e","observation_id":"fe8f339a-3598-41af-925f-99fea1c6cda3","resolution":{"observed_at":"2026-08-02T20:49:57.924727Z","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-02T20:49:57.989206Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":95,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:57.989206Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:91e9263e0893155a17c213d90e5ed785a78dd479ab28e11c12491b11ddcecf06","observation_id":"44fb3198-0baa-4cb2-b9ef-a55fe3cb53e6","resolution":{"observed_at":"2026-08-02T20:49:57.989206Z","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-02T20:49:58.064896Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":96,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:58.064896Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:e32702eedf7498845d6b38650bc86977a58399cdfb6f86ecefffa18289e5a9a3","observation_id":"0501cd92-022e-4f31-ae42-0bba13e0bca4","resolution":{"observed_at":"2026-08-02T20:49:58.064896Z","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-02T20:49:58.144032Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":97,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:58.144032Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:4b34d35b5094ea827d3c1ca6730b5aa5df33b64055e8bd9a21e0f26443799689","observation_id":"7078a82b-166e-4d09-b2d0-49790e4f04d7","resolution":{"observed_at":"2026-08-02T20:49:58.144032Z","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-02T20:49:58.229634Z","title":null,"venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":98,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:58.229634Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:4ba5f52f8a45c66f13c04dd968c2efc826b8c4c406fed3356d1d8eee7a94c5c9","observation_id":"3df1f116-2cb4-4551-9312-d49e5e6e2fd4","resolution":{"observed_at":"2026-08-02T20:49:58.229634Z","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-02T20:49:58.307581Z","title":null,"venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":99,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:58.307581Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:d466bc63c2a9356c0080258ca0a368d1e63503f361f8519e38a8d656914a07d4","observation_id":"ab50ba9f-ac18-4e6b-bad8-c46d7f1164cc","resolution":{"observed_at":"2026-08-02T20:49:58.307581Z","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-02T20:49:58.385317Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs","version":2},"reference_index":100,"source":"arxiv_source","source_observed_at":"2026-08-02T20:49:58.385317Z"},"links":{"citing_paper":"/paper/2602.22573"},"observation_digest":"sha256:fc521d43d1f2e6bc81c332873d1abae1aa88e31720d69aae594465456ab418f8","observation_id":"32602063-65b5-49ab-adea-9af009b12c8f","resolution":{"observed_at":"2026-08-02T20:49:58.385317Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2602.22573","last_updated":"2026-06-28T00:31:58Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-19T16:29:11.657023Z","submitted_at":"2026-02-26T03:28:36Z","title":"Directional first order approach for a class of bilevel programs"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":100,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":106},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 100 of 106 outbound references and 0 inbound Pith citation observations for arXiv:2602.22573."}