Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-12T11:14:33.171907Z
Paper Citation Record · LEDGER
On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy
As of 13 August 2026, this Paper Citation Record lists 38 of 38 outbound references and 0 inbound Pith citation observations for arXiv:2411.18590.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-13T06:32:02.005865+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links
A source-named dated measurement, never combined with another source.
Source: cited_works
Reference resolution
38 of 38 outbound references displayed
- verified exact20
- verified fuzzy6
- unresolved12
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation 3c6e050d-11df-4b48-8087-2088787f6f41 · outbound
This paper cites Computational Complexity - A Modern Approach.
On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy Computational Complexity - A Modern Approach
Reference 1
- Resolution
- unresolved
- no resolver link, observed 2026-08-12T11:14:32.975982Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation c46137da-6d1c-43b7-81af-a872b1363c4d · outbound
This paper cites Robust Optimization , volume 28 of Princeton Series in Applied Mathematics.
On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy Robust Optimization , volume 28 of Princeton Series in Applied Mathematics
Reference 2
- Resolution
- unresolved
- no resolver link, observed 2026-08-12T11:14:32.982290Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 0025482d-cba5-481c-8fe7-b70115d28158 · outbound
This paper cites Robust discrete optimization and network flows.
On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy Robust discrete optimization and network flows
Reference 3
- Resolution
- verified exact
- doi, observed 2026-08-12T11:14:33.843442Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 66c71493-459f-47ef-825c-4fb661dd4041 · outbound
This paper cites Investigating the recoverable robust single machine scheduling problem under interval uncertainty.
On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy Investigating the recoverable robust single machine scheduling problem under interval uncertainty
Reference 4
- Resolution
- unresolved
- no resolver link, observed 2026-08-12T11:14:32.993167Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation f9e90536-bf2c-42f3-a51d-5dc7a3e69fb8 · outbound
This paper cites Recoverable robustness in combinatorial optimization.
On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy Recoverable robustness in combinatorial optimization
Reference 5
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T11:14:33.962545Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 758c15d5-86f9-4ef2-b360-6f347730574b · outbound
This paper cites Recoverable robust shortest path problems.
On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy Recoverable robust shortest path problems
Reference 6
- Resolution
- verified exact
- doi, observed 2026-08-12T11:14:33.817301Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation d4da000c-cbd5-4fee-8dfe-41639d58d676 · outbound
This paper cites an unresolved cited work.
On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy Unresolved cited work
Reference 7
- Resolution
- verified exact
- doi, observed 2026-08-12T11:14:33.802113Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 2f9b0942-a5c1-4192-8b06-7e50a405fbb2 · outbound
This paper cites an unresolved cited work.
On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy Unresolved cited work
Reference 8
- Resolution
- verified exact
- doi, observed 2026-08-12T11:14:33.786051Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 4226c523-d1a2-4801-8921-b7ca9cc2b3d0 · outbound
This paper cites an unresolved cited work.
On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy Unresolved cited work
Reference 9
- Resolution
- verified exact
- doi, observed 2026-08-12T11:14:33.768243Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 87f38116-7da8-4b0d-9fc8-dba3f8548cf0 · outbound
This paper cites Chassein and Marc Goerigk.
On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy Chassein and Marc Goerigk
Reference 10
- Resolution
- verified exact
- doi, observed 2026-08-12T11:14:33.752591Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 2da85d04-2a5c-40f8-bbd8-caa95b109314 · outbound
This paper cites Chassein, Marc Goerigk, Adam Kasperski, and Pawel Zielinski.
On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy Chassein, Marc Goerigk, Adam Kasperski, and Pawel Zielinski
Reference 11
- Resolution
- verified exact
- doi, observed 2026-08-12T11:14:33.736436Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 72a9ad08-ed75-4abe-8481-225168cba087 · outbound
This paper cites The uncapicitated facility location problem.
On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy The uncapicitated facility location problem
Reference 12
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T11:14:33.947402Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation a7ff315c-79c2-4191-951e-8ed86e75c9b5 · outbound
This paper cites Robust recoverable perfect matchings.
On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy Robust recoverable perfect matchings
Reference 13
- Resolution
- verified exact
- doi, observed 2026-08-12T11:14:33.717357Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 71cf0820-1e22-4f72-9ff3-2fef474b7383 · outbound
This paper cites Hartmann, Stefan Lendl, and Gerhard J.
On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy Hartmann, Stefan Lendl, and Gerhard J
Reference 14
- Resolution
- verified exact
- doi, observed 2026-08-12T11:14:33.699808Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 65597c3e-c184-42b3-b743-403d92b5135d · outbound
This paper cites Hopcroft, and James Wyllie.
On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy Hopcroft, and James Wyllie
Reference 15
- Resolution
- unresolved
- no resolver link, observed 2026-08-12T11:14:33.052659Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation b0bdb8a4-3f81-439d-a745-a3e6755a9961 · outbound
This paper cites an unresolved cited work.
On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy Unresolved cited work
Reference 16
- Resolution
- unresolved
- no resolver link, observed 2026-08-12T11:14:33.057300Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation cf625dad-62f2-4b0d-bbc5-29d3905d3e0e · outbound
This paper cites An Introduction to Robust Combinatorial Optimization , volume 361 of International Series in Operations Research & Management Science.
On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy An Introduction to Robust Combinatorial Optimization , volume 361 of International Series in Operations Research & Management Science
Reference 17
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T11:14:33.923730Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 9430d33a-75ec-476a-8a20-4ed35486e5c9 · outbound
This paper cites Recoverable robust representatives selection problems with discrete budgeted uncertainty.
On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy Recoverable robust representatives selection problems with discrete budgeted uncertainty
Reference 18
- Resolution
- verified exact
- doi, observed 2026-08-12T11:14:33.672746Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 01d676da-fc11-4d57-b67a-2da981a7c941 · outbound
This paper cites On the complexity of robust multi-stage problems with discrete recourse.
On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy On the complexity of robust multi-stage problems with discrete recourse
Reference 19
- Resolution
- verified exact
- doi, observed 2026-08-12T11:14:33.655564Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 8d5126a3-75e6-4df1-80e7-92d010009daa · outbound
This paper cites The complexity classes of hamming distance recoverable robust problems.
On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy The complexity classes of hamming distance recoverable robust problems
Reference 20
- Resolution
- unresolved
- no resolver link, observed 2026-08-12T11:14:33.076870Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 94681277-968c-44c6-aacf-c3534b973a70 · outbound
This paper cites Completeness in the polynomial hierarchy for many natural problems in bilevel and robust optimization.
On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy Completeness in the polynomial hierarchy for many natural problems in bilevel and robust optimization
Reference 21
- Resolution
- verified exact
- doi, observed 2026-08-12T11:14:33.626976Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation d80895c5-2a2b-4708-a778-66a397d4da98 · outbound
This paper cites Recoverable Robust Optimization with Commitment.
On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy Recoverable Robust Optimization with Commitment
Reference 22
- Resolution
- verified exact
- local_arxiv, observed 2026-08-12T11:14:33.552827Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation c47ef51b-d807-4d42-ad4d-7fc15ea032b1 · outbound
This paper cites Recoverable robust spanning tree problem under interval uncertainty representations.
On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy Recoverable robust spanning tree problem under interval uncertainty representations
Reference 23
- Resolution
- verified exact
- doi, observed 2026-08-12T11:14:33.529032Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 280ec647-c344-45d9-a241-3350efc89f45 · outbound
This paper cites The recoverable robust spanning tree problem with interval costs is polynomially solvable.
On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy The recoverable robust spanning tree problem with interval costs is polynomially solvable
Reference 24
- Resolution
- verified exact
- doi, observed 2026-08-12T11:14:33.511684Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 57fdfcd1-57cf-4e87-aa57-35ddb0f8570c · outbound
This paper cites Computational Complexity of the Recoverable Robust Shortest Path Problem with Discrete Recourse.
On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy Computational Complexity of the Recoverable Robust Shortest Path Problem with Discrete Recourse
Reference 25
- Resolution
- unresolved
- no resolver link, observed 2026-08-12T11:14:33.102691Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation c7a0321f-10b4-43a0-935e-ac2022219a4e · outbound
This paper cites Recoverable robust shortest path problem under interval uncertainty representations.
On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy Recoverable robust shortest path problem under interval uncertainty representations
Reference 26
- Resolution
- verified exact
- doi, observed 2026-08-12T11:14:33.478178Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 5e04d5b6-ab3d-4a6a-825a-7dcb38d2e05c · outbound
This paper cites Jeroslow.
On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy Jeroslow
Reference 27
- Resolution
- unresolved
- no resolver link, observed 2026-08-12T11:14:33.113045Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 1f480d9a-d7e8-45c8-b91c-de18787a3d0e · outbound
This paper cites New classes of complete problems for the second level of the polynomial hierarchy.
On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy New classes of complete problems for the second level of the polynomial hierarchy
Reference 28
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T11:14:33.909386Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 0c64390b-a928-4f89-8a1f-e44f76f917b5 · outbound
This paper cites an unresolved cited work.
On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy Unresolved cited work
Reference 29
- Resolution
- unresolved
- no resolver link, observed 2026-08-12T11:14:33.123263Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 036c2f42-801a-419f-a616-e2b7683dddd4 · outbound
This paper cites Robust recoverable and two-stage selection problems.
On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy Robust recoverable and two-stage selection problems
Reference 30
- Resolution
- verified exact
- doi, observed 2026-08-12T11:14:33.284548Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 6774ad4c-472c-4725-8376-69a13dd81b36 · outbound
This paper cites Robust discrete optimization and its applications , volume 14.
On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy Robust discrete optimization and its applications , volume 14
Reference 31
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T11:14:33.894359Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation e71a51b6-b808-4b5f-acbe-537641130c86 · outbound
This paper cites Woeginger.
On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy Woeginger
Reference 32
- Resolution
- verified exact
- doi, observed 2026-08-12T11:14:33.266765Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation a10a0234-8d1b-45d7-ad13-2666b0772415 · outbound
This paper cites Matroid bases with cardinality constraints on the intersection.
On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy Matroid bases with cardinality constraints on the intersection
Reference 33
- Resolution
- verified exact
- doi, observed 2026-08-12T11:14:33.249618Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 31fec214-d11f-4ada-8b82-bc8b3211b729 · outbound
This paper cites u bbecke, Rolf H. M \.
On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy u bbecke, Rolf H. M \
Reference 34
- Resolution
- verified exact
- doi, observed 2026-08-12T11:14:33.231906Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 23baa6fe-2cef-4059-aa76-ec4416e39e6c · outbound
This paper cites Papadimitriou.
On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy Papadimitriou
Reference 35
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T11:14:33.878901Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 112fca25-98eb-4776-bd2c-6173dbe8d507 · outbound
This paper cites Introduction to the theory of computation.
On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy Introduction to the theory of computation
Reference 36
- Resolution
- unresolved
- no resolver link, observed 2026-08-12T11:14:33.161377Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 0f71ea51-fc6f-47de-af8b-a61d624ae487 · outbound
This paper cites Stockmeyer.
On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy Stockmeyer
Reference 37
- Resolution
- unresolved
- no resolver link, observed 2026-08-12T11:14:33.166660Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 99a283c5-2fd8-4862-978f-d23d4e23699d · outbound
This paper cites Woeginger.
On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy Woeginger
Reference 38
- Resolution
- unresolved
- no resolver link, observed 2026-08-12T11:14:33.171907Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Pith citing papers
No inbound Pith citation observations are available.