{"as_of":"2026-08-17T02:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:976a75ad0e8a88e69665c6f47dbe4fe667750a8c819efc4725f054bae0865f34","coverage":[{"denominator":43,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":43,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T14:04:40.962851Z","state":"measured"},{"denominator":43,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":43,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/1908.04040/citation-record","integrity":"/paper/1908.04040/integrity","json":"/paper/1908.04040/citation-record.json","paper":"/paper/1908.04040"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:04:41.467097Z","title":"Bilevel optimization: theory, algorithms and applications,","venue":null,"work_id":"e6f9e66c-d671-42ef-b8d6-b0bd90aff93c","year":2018},"citing_paper":{"arxiv_id":"1908.04040","last_updated":"2024-07-12T08:19:22Z","snapshot_observed_at":"2026-08-16T21:07:36.299888Z","submitted_at":"2019-08-12T07:56:43Z","title":"Robust Bilevel Optimization for Near-Optimal Lower-Level Solutions","version":11},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T14:04:40.802483Z"},"links":{"citing_paper":"/paper/1908.04040"},"observation_digest":"sha256:1f0d6eb6ff502584795b8a6c2019e6cd296130b9c14076d856cd2943f3133eac","observation_id":"75b0ecbf-1d4e-4bdd-9d4d-5b424bf2654e","resolution":{"observed_at":"2026-08-14T14:04:41.470948Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:04:41.456169Z","title":"Pessimistic Bilevel Op- timization,","venue":null,"work_id":"4fc1d1e7-2f84-484d-83d2-003a5172b417","year":2013},"citing_paper":{"arxiv_id":"1908.04040","last_updated":"2024-07-12T08:19:22Z","snapshot_observed_at":"2026-08-16T21:07:36.299888Z","submitted_at":"2019-08-12T07:56:43Z","title":"Robust Bilevel Optimization for Near-Optimal Lower-Level Solutions","version":11},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T14:04:40.807034Z"},"links":{"citing_paper":"/paper/1908.04040"},"observation_digest":"sha256:c0149f5db6e7773cfe71e04a2d19732301543761df38e580c52787a934f3d5dd","observation_id":"39db98a7-6074-401c-a16e-7f52085e4716","resolution":{"observed_at":"2026-08-14T14:04:41.460005Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:04:41.446715Z","title":"Dempe, Foundations of bilevel programming","venue":null,"work_id":"3e9ed8ad-dcc0-4f64-9f34-299801d1c308","year":2002},"citing_paper":{"arxiv_id":"1908.04040","last_updated":"2024-07-12T08:19:22Z","snapshot_observed_at":"2026-08-16T21:07:36.299888Z","submitted_at":"2019-08-12T07:56:43Z","title":"Robust Bilevel Optimization for Near-Optimal Lower-Level Solutions","version":11},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T14:04:40.811057Z"},"links":{"citing_paper":"/paper/1908.04040"},"observation_digest":"sha256:14e4209ee1320effbedc0ef742505aebc17f7a0d75cf11b92214f12f639f49b8","observation_id":"f058cf0c-71bf-4947-bfa9-ba484242883a","resolution":{"observed_at":"2026-08-14T14:04:41.449918Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:04:41.437229Z","title":"Optimal structural design in nonsmooth mechanics,","venue":null,"work_id":"c5259a9a-324f-45f8-9745-48c69ea9a6c8","year":1998},"citing_paper":{"arxiv_id":"1908.04040","last_updated":"2024-07-12T08:19:22Z","snapshot_observed_at":"2026-08-16T21:07:36.299888Z","submitted_at":"2019-08-12T07:56:43Z","title":"Robust Bilevel Optimization for Near-Optimal Lower-Level Solutions","version":11},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T14:04:40.815047Z"},"links":{"citing_paper":"/paper/1908.04040"},"observation_digest":"sha256:a180a5d04df2b84d628e0a718494e365ca0568bebb3f4e4d762968c1927ed7dc","observation_id":"79c26214-7f84-4f01-a7bf-0244f3415177","resolution":{"observed_at":"2026-08-14T14:04:41.440876Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:04:41.427819Z","title":"Optimizing the operations of an aluminium smelter using non-linear bi- level programming,","venue":null,"work_id":"69c9be57-a712-47a7-969d-2f92bbc619e2","year":1998},"citing_paper":{"arxiv_id":"1908.04040","last_updated":"2024-07-12T08:19:22Z","snapshot_observed_at":"2026-08-16T21:07:36.299888Z","submitted_at":"2019-08-12T07:56:43Z","title":"Robust Bilevel Optimization for Near-Optimal Lower-Level Solutions","version":11},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T14:04:40.819763Z"},"links":{"citing_paper":"/paper/1908.04040"},"observation_digest":"sha256:7d290b29a4c7147d33b6fef31113f78d644a48cb6c93adc0f537824bbe05c2ce","observation_id":"c593c4dc-02b6-4b96-b1f4-667778a723e4","resolution":{"observed_at":"2026-08-14T14:04:41.431193Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:04:41.416789Z","title":"Theories of bounded rationality,","venue":null,"work_id":"5fd0cecc-a0a5-4471-b714-5ff8a393ed83","year":1972},"citing_paper":{"arxiv_id":"1908.04040","last_updated":"2024-07-12T08:19:22Z","snapshot_observed_at":"2026-08-16T21:07:36.299888Z","submitted_at":"2019-08-12T07:56:43Z","title":"Robust Bilevel Optimization for Near-Optimal Lower-Level Solutions","version":11},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T14:04:40.823726Z"},"links":{"citing_paper":"/paper/1908.04040"},"observation_digest":"sha256:2d610432f648472d95a68b8232a6d351b5233be1e0b86989a8ee0a1c095b80c3","observation_id":"243cde66-1678-4e2f-a257-1b86fd66036c","resolution":{"observed_at":"2026-08-14T14:04:41.420688Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:04:41.405709Z","title":"Rationality and bounded rationality,","venue":null,"work_id":"3a05ac91-1c7b-492f-9ba1-dae545279b4b","year":1997},"citing_paper":{"arxiv_id":"1908.04040","last_updated":"2024-07-12T08:19:22Z","snapshot_observed_at":"2026-08-16T21:07:36.299888Z","submitted_at":"2019-08-12T07:56:43Z","title":"Robust Bilevel Optimization for Near-Optimal Lower-Level Solutions","version":11},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T14:04:40.827577Z"},"links":{"citing_paper":"/paper/1908.04040"},"observation_digest":"sha256:154e546bf79bfcca53f94257400687f1f987f300bd15e7e041cbb662d565d710","observation_id":"da4ffe3c-b516-4d19-83ab-98ab56aaad8a","resolution":{"observed_at":"2026-08-14T14:04:41.409641Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:04:41.393801Z","title":"Robust game theory,","venue":null,"work_id":"5f903aca-0b63-4924-b1b6-146e3641b492","year":2006},"citing_paper":{"arxiv_id":"1908.04040","last_updated":"2024-07-12T08:19:22Z","snapshot_observed_at":"2026-08-16T21:07:36.299888Z","submitted_at":"2019-08-12T07:56:43Z","title":"Robust Bilevel Optimization for Near-Optimal Lower-Level Solutions","version":11},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T14:04:40.831119Z"},"links":{"citing_paper":"/paper/1908.04040"},"observation_digest":"sha256:d4b5aef77633316749e5ae04dbc04196bab91f770561e5e14f5de66792628f3f","observation_id":"3f541227-5158-4986-aa51-1f4c097a1116","resolution":{"observed_at":"2026-08-14T14:04:41.398128Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:04:41.383432Z","title":"Robust wardrop equilibrium,","venue":null,"work_id":"8ad32c80-40cb-4858-95b9-31f2ad8e78ba","year":2007},"citing_paper":{"arxiv_id":"1908.04040","last_updated":"2024-07-12T08:19:22Z","snapshot_observed_at":"2026-08-16T21:07:36.299888Z","submitted_at":"2019-08-12T07:56:43Z","title":"Robust Bilevel Optimization for Near-Optimal Lower-Level Solutions","version":11},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T14:04:40.835103Z"},"links":{"citing_paper":"/paper/1908.04040"},"observation_digest":"sha256:d0591662f95795e61fac7473b1ae056a6be581b1784cf8a1bf71cc4830087807","observation_id":"edb9ae7b-65d9-406a-9c2b-38e7ad86885a","resolution":{"observed_at":"2026-08-14T14:04:41.387002Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:04:41.372826Z","title":"Robust solutions in stackelberg games: Addressing boundedly rational human preference models,","venue":null,"work_id":"3c4d1c85-1957-4e07-a9b2-118a268de859","year":2008},"citing_paper":{"arxiv_id":"1908.04040","last_updated":"2024-07-12T08:19:22Z","snapshot_observed_at":"2026-08-16T21:07:36.299888Z","submitted_at":"2019-08-12T07:56:43Z","title":"Robust Bilevel Optimization for Near-Optimal Lower-Level Solutions","version":11},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T14:04:40.838914Z"},"links":{"citing_paper":"/paper/1908.04040"},"observation_digest":"sha256:c69d1f03a2ecd32936a5e9be75d657b355095a18f9348694a4df96fc633eb762","observation_id":"cb5459c0-448a-477c-96f2-b42a3277083d","resolution":{"observed_at":"2026-08-14T14:04:41.376610Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:04:41.362963Z","title":"Robust solutions to stackelberg games: Addressing bounded rationality and limited observations in human cognition,","venue":null,"work_id":"86d5323e-d186-4c56-b1ba-2dc8934fd1a4","year":2010},"citing_paper":{"arxiv_id":"1908.04040","last_updated":"2024-07-12T08:19:22Z","snapshot_observed_at":"2026-08-16T21:07:36.299888Z","submitted_at":"2019-08-12T07:56:43Z","title":"Robust Bilevel Optimization for Near-Optimal Lower-Level Solutions","version":11},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T14:04:40.842569Z"},"links":{"citing_paper":"/paper/1908.04040"},"observation_digest":"sha256:37dded6c8a907703e002da108152dcf629051eebdc9ed6afa5d9b183c72d22fa","observation_id":"3b773599-ca9c-4008-bbf3-402872de9462","resolution":{"observed_at":"2026-08-14T14:04:41.366664Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:04:41.352458Z","title":"Decision rule bounds for two-stage stochastic bilevel pro- grams,","venue":null,"work_id":"407a778f-0158-45e0-9cf8-8ed079642744","year":2018},"citing_paper":{"arxiv_id":"1908.04040","last_updated":"2024-07-12T08:19:22Z","snapshot_observed_at":"2026-08-16T21:07:36.299888Z","submitted_at":"2019-08-12T07:56:43Z","title":"Robust Bilevel Optimization for Near-Optimal Lower-Level Solutions","version":11},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T14:04:40.846192Z"},"links":{"citing_paper":"/paper/1908.04040"},"observation_digest":"sha256:61dc11659ac8b9ea650d0a6652252f3466333ad6531fed532ce86b9e495ef55c","observation_id":"335c5170-27df-477e-a467-03fd10b3594f","resolution":{"observed_at":"2026-08-14T14:04:41.356399Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:04:41.341963Z","title":"On a class of bilevel linear mixed- integer programs in adversarial settings,","venue":null,"work_id":"63e66ba6-f2c0-49ca-8438-08266e2ba53a","year":2018},"citing_paper":{"arxiv_id":"1908.04040","last_updated":"2024-07-12T08:19:22Z","snapshot_observed_at":"2026-08-16T21:07:36.299888Z","submitted_at":"2019-08-12T07:56:43Z","title":"Robust Bilevel Optimization for Near-Optimal Lower-Level Solutions","version":11},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T14:04:40.849851Z"},"links":{"citing_paper":"/paper/1908.04040"},"observation_digest":"sha256:3bfe96ae3ef1844be0aa3ad45b0258522613d034d0759286d547234727149efc","observation_id":"b9a00231-d628-4fc0-b786-4f0b047651ba","resolution":{"observed_at":"2026-08-14T14:04:41.345865Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:04:41.330354Z","title":"On bilevel optimization with inexact follower,","venue":null,"work_id":"2183493b-0369-44ec-9340-2b6d19671eb1","year":2020},"citing_paper":{"arxiv_id":"1908.04040","last_updated":"2024-07-12T08:19:22Z","snapshot_observed_at":"2026-08-16T21:07:36.299888Z","submitted_at":"2019-08-12T07:56:43Z","title":"Robust Bilevel Optimization for Near-Optimal Lower-Level Solutions","version":11},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T14:04:40.854091Z"},"links":{"citing_paper":"/paper/1908.04040"},"observation_digest":"sha256:58712e85f88a32096b7c320e9d3feb5c9f499bcb8916869691faee8bfc7cd51e","observation_id":"88ab0642-2cd7-4548-90b8-8e398e277e0c","resolution":{"observed_at":"2026-08-14T14:04:41.334910Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:04:41.319256Z","title":"Dempe, V","venue":null,"work_id":"b6400201-9b13-4091-84f4-c3b76276f496","year":2015},"citing_paper":{"arxiv_id":"1908.04040","last_updated":"2024-07-12T08:19:22Z","snapshot_observed_at":"2026-08-16T21:07:36.299888Z","submitted_at":"2019-08-12T07:56:43Z","title":"Robust Bilevel Optimization for Near-Optimal Lower-Level Solutions","version":11},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T14:04:40.857617Z"},"links":{"citing_paper":"/paper/1908.04040"},"observation_digest":"sha256:1dbe9e2f0a5698cdc358ee1f0f7ea3e1e9d218c7ee92bb9424f7aba71be47d6a","observation_id":"4cb1d9ea-0405-4f7b-9bcf-737660089c62","resolution":{"observed_at":"2026-08-14T14:04:41.322689Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:04:41.309680Z","title":"Generalized semi-infinite programming: Theory and methods,","venue":null,"work_id":"c2369fe6-6ee6-472a-a255-60fc86c25be2","year":1999},"citing_paper":{"arxiv_id":"1908.04040","last_updated":"2024-07-12T08:19:22Z","snapshot_observed_at":"2026-08-16T21:07:36.299888Z","submitted_at":"2019-08-12T07:56:43Z","title":"Robust Bilevel Optimization for Near-Optimal Lower-Level Solutions","version":11},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T14:04:40.860915Z"},"links":{"citing_paper":"/paper/1908.04040"},"observation_digest":"sha256:88a8b575115b5e6f496539c51ba1e3a0505ed164b28919c7e9ada100a19a6e71","observation_id":"9fde638a-9e92-4b05-93f0-e19ba6af02fb","resolution":{"observed_at":"2026-08-14T14:04:41.313206Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10107-006-0715-7","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:04:41.065331Z","title":"A class of stochastic programs with decision depen- dent uncertainty,","venue":null,"work_id":"483f3c88-f53e-42cd-aea0-95b590ffd52a","year":2006},"citing_paper":{"arxiv_id":"1908.04040","last_updated":"2024-07-12T08:19:22Z","snapshot_observed_at":"2026-08-16T21:07:36.299888Z","submitted_at":"2019-08-12T07:56:43Z","title":"Robust Bilevel Optimization for Near-Optimal Lower-Level Solutions","version":11},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T14:04:40.864184Z"},"links":{"citing_paper":"/paper/1908.04040"},"observation_digest":"sha256:7de438fafe08207750b87fc3e21c736abe30ca4f8bbc0e29fa4fe59ac8dba460","observation_id":"38828a9d-61d6-4dd3-89c3-2f6bf861473f","resolution":{"observed_at":"2026-08-14T14:04:41.069452Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:04:41.297876Z","title":"Recent advances in robust optimization: An overview,","venue":null,"work_id":"a58a97ab-e84d-4884-8c74-1408a8bb18e5","year":2014},"citing_paper":{"arxiv_id":"1908.04040","last_updated":"2024-07-12T08:19:22Z","snapshot_observed_at":"2026-08-16T21:07:36.299888Z","submitted_at":"2019-08-12T07:56:43Z","title":"Robust Bilevel Optimization for Near-Optimal Lower-Level Solutions","version":11},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T14:04:40.868430Z"},"links":{"citing_paper":"/paper/1908.04040"},"observation_digest":"sha256:a3ca5da57b14367332ce71fd961e8ec1ad1d80c92754bfdc7974958e6c3808b2","observation_id":"c8265311-194d-4d08-bb06-607e439d4908","resolution":{"observed_at":"2026-08-14T14:04:41.302272Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:04:41.286276Z","title":"Theory and Applications of Robust Optimization,","venue":null,"work_id":"10ad3cfe-ac0c-4fe4-a166-7b51c927ec5b","year":2011},"citing_paper":{"arxiv_id":"1908.04040","last_updated":"2024-07-12T08:19:22Z","snapshot_observed_at":"2026-08-16T21:07:36.299888Z","submitted_at":"2019-08-12T07:56:43Z","title":"Robust Bilevel Optimization for Near-Optimal Lower-Level Solutions","version":11},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T14:04:40.871953Z"},"links":{"citing_paper":"/paper/1908.04040"},"observation_digest":"sha256:b5914977aaeebdd49efa23cc7a221ca56a52e0f08d40b9421ac7d883b9dd1472","observation_id":"6873bcf2-30bd-49b1-ac24-502841b9204e","resolution":{"observed_at":"2026-08-14T14:04:41.290092Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:04:41.275507Z","title":"Weak via strong Stackelberg problem: New results,","venue":null,"work_id":"dd475083-c61f-49ea-a626-b2c892d223f0","year":1996},"citing_paper":{"arxiv_id":"1908.04040","last_updated":"2024-07-12T08:19:22Z","snapshot_observed_at":"2026-08-16T21:07:36.299888Z","submitted_at":"2019-08-12T07:56:43Z","title":"Robust Bilevel Optimization for Near-Optimal Lower-Level Solutions","version":11},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T14:04:40.875464Z"},"links":{"citing_paper":"/paper/1908.04040"},"observation_digest":"sha256:ec2f024fb966cef500da26accccadb43defca90ccdc7bfe5fd0cdd9f2dc970a3","observation_id":"6ffcf4f2-53a2-4bfa-bd19-13a9d1aa9096","resolution":{"observed_at":"2026-08-14T14:04:41.279210Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:04:41.264460Z","title":"Radius of robust feasibility for mixed-integer problems,","venue":null,"work_id":"ad307f41-805b-4f88-bc9e-e5915a4e92f8","year":2019},"citing_paper":{"arxiv_id":"1908.04040","last_updated":"2024-07-12T08:19:22Z","snapshot_observed_at":"2026-08-16T21:07:36.299888Z","submitted_at":"2019-08-12T07:56:43Z","title":"Robust Bilevel Optimization for Near-Optimal Lower-Level Solutions","version":11},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T14:04:40.879610Z"},"links":{"citing_paper":"/paper/1908.04040"},"observation_digest":"sha256:ed27635b68fa682339c542e8ac12e05498eb5125a8b7810db307a0f136a964ef","observation_id":"27e48749-048a-44e4-9383-2af3c9d4890d","resolution":{"observed_at":"2026-08-14T14:04:41.268610Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.orl.2015.11.011","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:04:41.054134Z","title":"Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints,","venue":null,"work_id":"61c2a5f6-7324-4ccc-ab7b-ed5ceb8eff32","year":2016},"citing_paper":{"arxiv_id":"1908.04040","last_updated":"2024-07-12T08:19:22Z","snapshot_observed_at":"2026-08-16T21:07:36.299888Z","submitted_at":"2019-08-12T07:56:43Z","title":"Robust Bilevel Optimization for Near-Optimal Lower-Level Solutions","version":11},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T14:04:40.882957Z"},"links":{"citing_paper":"/paper/1908.04040"},"observation_digest":"sha256:8e32a10aef687c409cf118a5551cd9fee30ebbd8ac6f770661a88442a4713c0b","observation_id":"2dbbf2ef-60c1-412b-9c65-f6417c67d98b","resolution":{"observed_at":"2026-08-14T14:04:41.058336Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:04:41.253278Z","title":"Methods for global concave minimization: A bibliographic survey,","venue":null,"work_id":"00397f56-06d4-47ae-a963-701765441cc9","year":1986},"citing_paper":{"arxiv_id":"1908.04040","last_updated":"2024-07-12T08:19:22Z","snapshot_observed_at":"2026-08-16T21:07:36.299888Z","submitted_at":"2019-08-12T07:56:43Z","title":"Robust Bilevel Optimization for Near-Optimal Lower-Level Solutions","version":11},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T14:04:40.886819Z"},"links":{"citing_paper":"/paper/1908.04040"},"observation_digest":"sha256:63a0c6991805de862d17bf94402f1f7249eebc987bec62ecdbd1383757e3f84c","observation_id":"75661fc5-91bd-4e07-b740-33845c403544","resolution":{"observed_at":"2026-08-14T14:04:41.257128Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:04:41.241604Z","title":"A branch and bound-outer approximation algorithm for con- cave minimization over a convex set,","venue":null,"work_id":"1930fe1a-dedd-4024-bf04-bc7c52bc9d30","year":1991},"citing_paper":{"arxiv_id":"1908.04040","last_updated":"2024-07-12T08:19:22Z","snapshot_observed_at":"2026-08-16T21:07:36.299888Z","submitted_at":"2019-08-12T07:56:43Z","title":"Robust Bilevel Optimization for Near-Optimal Lower-Level Solutions","version":11},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T14:04:40.890399Z"},"links":{"citing_paper":"/paper/1908.04040"},"observation_digest":"sha256:82cfe2c92a9b727510e1a89ec34a9ab12fb6661887b51d865930bac7adb0cdd9","observation_id":"12e927da-3cd9-4121-a90e-7bf1d9acb15e","resolution":{"observed_at":"2026-08-14T14:04:41.245478Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:04:40.893872Z","title":"Boyd and L","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"1908.04040","last_updated":"2024-07-12T08:19:22Z","snapshot_observed_at":"2026-08-16T21:07:36.299888Z","submitted_at":"2019-08-12T07:56:43Z","title":"Robust Bilevel Optimization for Near-Optimal Lower-Level Solutions","version":11},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T14:04:40.893872Z"},"links":{"citing_paper":"/paper/1908.04040"},"observation_digest":"sha256:b8ca4d004be0af3b88aa38e20a173cf4162ed6bada6ef0296587bd86e62a4a1e","observation_id":"021ead36-8270-46b5-9a0e-78dabaf810d7","resolution":{"observed_at":"2026-08-14T14:04:40.893872Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:04:41.217808Z","title":"Computing locally optimal solutions of the bilevel optimization problem using the kkt approach,","venue":null,"work_id":"72e62ea9-8fde-4bae-9cd1-1d04023caff5","year":2019},"citing_paper":{"arxiv_id":"1908.04040","last_updated":"2024-07-12T08:19:22Z","snapshot_observed_at":"2026-08-16T21:07:36.299888Z","submitted_at":"2019-08-12T07:56:43Z","title":"Robust Bilevel Optimization for Near-Optimal Lower-Level Solutions","version":11},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T14:04:40.897299Z"},"links":{"citing_paper":"/paper/1908.04040"},"observation_digest":"sha256:98b36af6ec5b9c7fcaa18adbdda1a112c6970fdee1f2e3417c82cba26bf7cb32","observation_id":"9f754062-1782-4289-a007-aee36f4001c3","resolution":{"observed_at":"2026-08-14T14:04:41.223736Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:04:41.204872Z","title":"Convergence properties of a regularization scheme for mathematical pro- gramswithcomplementarityconstraints,","venue":null,"work_id":"1f095fe5-8157-4014-aba6-e2ec575e8d46","year":2001},"citing_paper":{"arxiv_id":"1908.04040","last_updated":"2024-07-12T08:19:22Z","snapshot_observed_at":"2026-08-16T21:07:36.299888Z","submitted_at":"2019-08-12T07:56:43Z","title":"Robust Bilevel Optimization for Near-Optimal Lower-Level Solutions","version":11},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T14:04:40.901681Z"},"links":{"citing_paper":"/paper/1908.04040"},"observation_digest":"sha256:e6ef068678d52df6b194c05f30e4dba338a8e37264c4b0e370792235e323ae7d","observation_id":"69a49ad4-be87-4cba-8b6e-2d0d6eb1cdca","resolution":{"observed_at":"2026-08-14T14:04:41.210200Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s12532-018-0141-x","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:04:41.042789Z","title":"Computing feasible points for binary MINLPs with MPECs,","venue":null,"work_id":"00fb3f7a-f9e7-4f19-95de-ce527b772795","year":2019},"citing_paper":{"arxiv_id":"1908.04040","last_updated":"2024-07-12T08:19:22Z","snapshot_observed_at":"2026-08-16T21:07:36.299888Z","submitted_at":"2019-08-12T07:56:43Z","title":"Robust Bilevel Optimization for Near-Optimal Lower-Level Solutions","version":11},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T14:04:40.906406Z"},"links":{"citing_paper":"/paper/1908.04040"},"observation_digest":"sha256:08345c045a84e36c04766e66b59f647f4847d1c8a49abac7b87a1265735e85e5","observation_id":"fc414ff1-f356-4d3c-8350-b5e39cb2d3ad","resolution":{"observed_at":"2026-08-14T14:04:41.046549Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:04:41.191813Z","title":"Nesterov and A","venue":null,"work_id":"bfe62f9e-dd62-4292-be42-4b10446a86aa","year":1994},"citing_paper":{"arxiv_id":"1908.04040","last_updated":"2024-07-12T08:19:22Z","snapshot_observed_at":"2026-08-16T21:07:36.299888Z","submitted_at":"2019-08-12T07:56:43Z","title":"Robust Bilevel Optimization for Near-Optimal Lower-Level Solutions","version":11},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T14:04:40.910323Z"},"links":{"citing_paper":"/paper/1908.04040"},"observation_digest":"sha256:9127148dc914fc66a1eb23f29d9e293b18cc2e6238f5d2b5b767a892c473d327","observation_id":"a48fd21c-6e22-4f1c-8b5a-11cf77506775","resolution":{"observed_at":"2026-08-14T14:04:41.195603Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:04:41.181292Z","title":"Mathematical programs with complementarity constraints: Stationarity, optimality, and sensitivity,","venue":null,"work_id":"ce6eb51b-c571-4845-817e-5ccc62fe1fd4","year":2000},"citing_paper":{"arxiv_id":"1908.04040","last_updated":"2024-07-12T08:19:22Z","snapshot_observed_at":"2026-08-16T21:07:36.299888Z","submitted_at":"2019-08-12T07:56:43Z","title":"Robust Bilevel Optimization for Near-Optimal Lower-Level Solutions","version":11},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T14:04:40.913845Z"},"links":{"citing_paper":"/paper/1908.04040"},"observation_digest":"sha256:6df29c7175de910bd547978be23237fce67b96d6e3754278c2baec81e8ac6091","observation_id":"fcdd5ba3-fe0b-4768-a0df-be65880f7b87","resolution":{"observed_at":"2026-08-14T14:04:41.184971Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:04:41.171458Z","title":"There’s no free lunch: On the hardness of choosing a correct big-m in bilevel optimization,","venue":null,"work_id":"d7906f36-7e4a-4a84-a893-8a51c26510c5","year":2019},"citing_paper":{"arxiv_id":"1908.04040","last_updated":"2024-07-12T08:19:22Z","snapshot_observed_at":"2026-08-16T21:07:36.299888Z","submitted_at":"2019-08-12T07:56:43Z","title":"Robust Bilevel Optimization for Near-Optimal Lower-Level Solutions","version":11},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T14:04:40.917678Z"},"links":{"citing_paper":"/paper/1908.04040"},"observation_digest":"sha256:66cb9b826a0c4fd234587bce2527bb7aeb726254727869ff596cfa05a16e7689","observation_id":"4868b7c5-4b9b-4af2-aaea-2207eb2785cd","resolution":{"observed_at":"2026-08-14T14:04:41.174543Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:04:41.162728Z","title":"Solving linear bilevel problems using big-ms: Not all that glitters is gold,","venue":null,"work_id":"5a96013a-ce42-4c81-a5f5-b4b8c01c30b7","year":2019},"citing_paper":{"arxiv_id":"1908.04040","last_updated":"2024-07-12T08:19:22Z","snapshot_observed_at":"2026-08-16T21:07:36.299888Z","submitted_at":"2019-08-12T07:56:43Z","title":"Robust Bilevel Optimization for Near-Optimal Lower-Level Solutions","version":11},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T14:04:40.921468Z"},"links":{"citing_paper":"/paper/1908.04040"},"observation_digest":"sha256:000c0df899746625e0a20ec7a50cd002ad3791972683f1d5ae70f8d31c596c80","observation_id":"7244ab53-100a-43c7-b314-3cf03feef35d","resolution":{"observed_at":"2026-08-14T14:04:41.165919Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:04:41.153458Z","title":"On mathematical programming with indicator constraints,","venue":null,"work_id":"49d5b53f-4071-4900-9a7b-aaaff39406eb","year":null},"citing_paper":{"arxiv_id":"1908.04040","last_updated":"2024-07-12T08:19:22Z","snapshot_observed_at":"2026-08-16T21:07:36.299888Z","submitted_at":"2019-08-12T07:56:43Z","title":"Robust Bilevel Optimization for Near-Optimal Lower-Level Solutions","version":11},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T14:04:40.924974Z"},"links":{"citing_paper":"/paper/1908.04040"},"observation_digest":"sha256:6685c897e98fdd6c6f781f27f9e2bc6d6aa519516bd9345aeb0bf279946794dd","observation_id":"af48d839-9769-4b47-99d0-67feab3ed9cf","resolution":{"observed_at":"2026-08-14T14:04:41.156980Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:04:41.143099Z","title":"Closing the gap in linear bilevel optimization: A new valid primal-dual inequality,","venue":null,"work_id":"dc9dd911-6a18-4a04-b795-b23141920f8c","year":2020},"citing_paper":{"arxiv_id":"1908.04040","last_updated":"2024-07-12T08:19:22Z","snapshot_observed_at":"2026-08-16T21:07:36.299888Z","submitted_at":"2019-08-12T07:56:43Z","title":"Robust Bilevel Optimization for Near-Optimal Lower-Level Solutions","version":11},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T14:04:40.932204Z"},"links":{"citing_paper":"/paper/1908.04040"},"observation_digest":"sha256:4bcf0ac256c36a97fdb9a7578397957cd346134a42be8924224e3518d47f3f12","observation_id":"62429d2a-eccf-40b2-990b-f599340c247f","resolution":{"observed_at":"2026-08-14T14:04:41.146696Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:04:41.131339Z","title":"Bilevel Optimization Problem Library v0.1,","venue":null,"work_id":"d2ec568a-a164-4ff1-9395-611f447719e1","year":2020},"citing_paper":{"arxiv_id":"1908.04040","last_updated":"2024-07-12T08:19:22Z","snapshot_observed_at":"2026-08-16T21:07:36.299888Z","submitted_at":"2019-08-12T07:56:43Z","title":"Robust Bilevel Optimization for Near-Optimal Lower-Level Solutions","version":11},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T14:04:40.936006Z"},"links":{"citing_paper":"/paper/1908.04040"},"observation_digest":"sha256:d2b87e3e66ae200fde8dfc1012e1ee59e97dedbac86aa37650a470ae91b6a9b6","observation_id":"134e2fd3-2058-41b4-a49c-e35822c370a5","resolution":{"observed_at":"2026-08-14T14:04:41.135561Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.5281/zenodo.4009108","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:04:41.019210Z","title":"Near-optimal robust bilevel linear in- stances,","venue":null,"work_id":"39e66e22-1295-4c98-9e29-421c6207e48a","year":2020},"citing_paper":{"arxiv_id":"1908.04040","last_updated":"2024-07-12T08:19:22Z","snapshot_observed_at":"2026-08-16T21:07:36.299888Z","submitted_at":"2019-08-12T07:56:43Z","title":"Robust Bilevel Optimization for Near-Optimal Lower-Level Solutions","version":11},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T14:04:40.940047Z"},"links":{"citing_paper":"/paper/1908.04040"},"observation_digest":"sha256:35db4ceade3fa43134c83bf0b331faf380d65823f19baffc6dc485feb7e68665","observation_id":"decc7ff9-98ac-4b67-8f8f-ed1646bed149","resolution":{"observed_at":"2026-08-14T14:04:41.023699Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:04:41.114067Z","title":"Julia: A Fresh Approach to Numerical Computing,","venue":null,"work_id":"5c8a1150-ad57-4031-9018-c347ac86cba3","year":2017},"citing_paper":{"arxiv_id":"1908.04040","last_updated":"2024-07-12T08:19:22Z","snapshot_observed_at":"2026-08-16T21:07:36.299888Z","submitted_at":"2019-08-12T07:56:43Z","title":"Robust Bilevel Optimization for Near-Optimal Lower-Level Solutions","version":11},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-14T14:04:40.943760Z"},"links":{"citing_paper":"/paper/1908.04040"},"observation_digest":"sha256:93fb8fd736d971b589fd405fe592dadae97e28dd65a9958fc157aeccd47fa1f2","observation_id":"ae284ca6-7e8a-4ce1-b833-a195e0a02d24","resolution":{"observed_at":"2026-08-14T14:04:41.119867Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:04:41.101175Z","title":"JuMP: A Modeling Language for Mathematical Optimization,","venue":null,"work_id":"e71b9c98-946d-4ae7-8342-1fcdc8987a11","year":2017},"citing_paper":{"arxiv_id":"1908.04040","last_updated":"2024-07-12T08:19:22Z","snapshot_observed_at":"2026-08-16T21:07:36.299888Z","submitted_at":"2019-08-12T07:56:43Z","title":"Robust Bilevel Optimization for Near-Optimal Lower-Level Solutions","version":11},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-14T14:04:40.947155Z"},"links":{"citing_paper":"/paper/1908.04040"},"observation_digest":"sha256:d85384c391f6f411e318ae570e6da520bdf0bbd8422af09cc0c1b4477c9893be","observation_id":"4d2a75e6-e005-412a-b57d-53318c108d7d","resolution":{"observed_at":"2026-08-14T14:04:41.105804Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.03447","last_updated":"2026-05-25T02:55:47Z","snapshot_observed_at":"2026-07-06T08:55:54.775109Z","submitted_at":"2020-02-09T21:12:24Z","title":"MathOptInterface: a data structure for mathematical optimization problems","version":3},"cited_work":{"arxiv_id":"2002.03447","doi":null,"metadata_source":"pith","pith_arxiv_id":"2002.03447","snapshot_observed_at":"2026-08-14T14:04:41.078859Z","title":"MathOptInterface: a data structure for mathematical optimization problems","venue":"math.OC","work_id":"b90e4969-e155-4427-acab-c3b2244706d2","year":2020},"citing_paper":{"arxiv_id":"1908.04040","last_updated":"2024-07-12T08:19:22Z","snapshot_observed_at":"2026-08-16T21:07:36.299888Z","submitted_at":"2019-08-12T07:56:43Z","title":"Robust Bilevel Optimization for Near-Optimal Lower-Level Solutions","version":11},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-14T14:04:40.950627Z"},"links":{"cited_paper":"/paper/2002.03447","citing_paper":"/paper/1908.04040"},"observation_digest":"sha256:681c2c2e3332ea810414b9ab5e3eac3581a0af218db6c14ae8af653a815ec625","observation_id":"cc916ce1-00d3-449a-aa69-549c4fa82502","resolution":{"observed_at":"2026-08-14T14:04:41.082824Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:04:41.090440Z","title":"The SCIP Optimization Suite 6.0,","venue":null,"work_id":"710b38b7-afe9-4643-864a-022071d2f4c7","year":2018},"citing_paper":{"arxiv_id":"1908.04040","last_updated":"2024-07-12T08:19:22Z","snapshot_observed_at":"2026-08-16T21:07:36.299888Z","submitted_at":"2019-08-12T07:56:43Z","title":"Robust Bilevel Optimization for Near-Optimal Lower-Level Solutions","version":11},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-14T14:04:40.955106Z"},"links":{"citing_paper":"/paper/1908.04040"},"observation_digest":"sha256:99c9edc9dc096db616e9c723195c1544df8149bf52d8d02049f9979f7770d53f","observation_id":"958dfc1f-e072-4c69-9722-9b2a9c2f3637","resolution":{"observed_at":"2026-08-14T14:04:41.093971Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.5281/zenodo.3066026","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:04:41.008387Z","title":"JuliaPolyhedra/Polyhedra.jl: v0.5.1,","venue":null,"work_id":"c05e704b-4a57-4d01-bd46-0160c2363590","year":2019},"citing_paper":{"arxiv_id":"1908.04040","last_updated":"2024-07-12T08:19:22Z","snapshot_observed_at":"2026-08-16T21:07:36.299888Z","submitted_at":"2019-08-12T07:56:43Z","title":"Robust Bilevel Optimization for Near-Optimal Lower-Level Solutions","version":11},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-14T14:04:40.958833Z"},"links":{"citing_paper":"/paper/1908.04040"},"observation_digest":"sha256:a0b449881b7ff50588855b98c0f3f28f979b4643c366414442deafff517ff4eb","observation_id":"b6c9d053-02d3-4665-bd07-4e1148b8013a","resolution":{"observed_at":"2026-08-14T14:04:41.011249Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.5281/zenodo.2671760","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:04:40.991819Z","title":"JuliaPolyhe- dra/CDDLib.jl: v0.5.2,","venue":null,"work_id":"d30f579a-5ed3-4c10-a1d1-26c94c1d717a","year":2019},"citing_paper":{"arxiv_id":"1908.04040","last_updated":"2024-07-12T08:19:22Z","snapshot_observed_at":"2026-08-16T21:07:36.299888Z","submitted_at":"2019-08-12T07:56:43Z","title":"Robust Bilevel Optimization for Near-Optimal Lower-Level Solutions","version":11},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-14T14:04:40.962851Z"},"links":{"citing_paper":"/paper/1908.04040"},"observation_digest":"sha256:028103fa8b2126fd16cfbc2b8ac56a5b9dbcc978b224a3cf60cf822249e8beac","observation_id":"f9d6c3fd-5262-49d1-8288-be4e42f44bc2","resolution":{"observed_at":"2026-08-14T14:04:40.998021Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10107-015-0891-4","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:04:41.031020Z","title":null,"venue":null,"work_id":"de8d2c45-ef17-4477-93b8-13acca8107cc","year":null},"citing_paper":{"arxiv_id":"1908.04040","last_updated":"2024-07-12T08:19:22Z","snapshot_observed_at":"2026-08-16T21:07:36.299888Z","submitted_at":"2019-08-12T07:56:43Z","title":"Robust Bilevel Optimization for Near-Optimal Lower-Level Solutions","version":11},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-14T14:04:40.928527Z"},"links":{"citing_paper":"/paper/1908.04040"},"observation_digest":"sha256:804ccac38177329d2d14907a4818121f795f75e9e6a1da147ed9edf618d9e8e2","observation_id":"09c3c674-175a-405f-a04f-cfa87a7de106","resolution":{"observed_at":"2026-08-14T14:04:41.035908Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.04040","last_updated":"2024-07-12T08:19:22Z","latest_version":11,"primary_category":"math.OC","snapshot_observed_at":"2026-08-16T21:07:36.299888Z","submitted_at":"2019-08-12T07:56:43Z","title":"Robust Bilevel Optimization for Near-Optimal Lower-Level Solutions"},"reference_resolution":{"displayed":43,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":8,"verified_fuzzy":34},"total_outbound_references":43},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 43 of 43 outbound references and 0 inbound Pith citation observations for arXiv:1908.04040."}