{"as_of":"2026-08-13T05:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:947d187e22916658fceb2778f3cba5cd7d001c49e16fb45971fb35d4feddcd15","coverage":[{"denominator":38,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":38,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T11:14:33.171907Z","state":"measured"},{"denominator":38,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":38,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+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/2411.18590/citation-record","integrity":"/paper/2411.18590/integrity","json":"/paper/2411.18590/citation-record.json","paper":"/paper/2411.18590"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:14:32.975982Z","title":"Computational Complexity - A Modern Approach","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2411.18590","last_updated":"2024-11-27T18:32:56Z","snapshot_observed_at":"2026-08-12T10:59:56.414589Z","submitted_at":"2024-11-27T18:32:56Z","title":"On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-12T11:14:32.975982Z"},"links":{"citing_paper":"/paper/2411.18590"},"observation_digest":"sha256:19ed5f6af2f98b4fd3fe5adc9a161e077c95be0a16c1b8beac85bdf267cdbc2d","observation_id":"3c6e050d-11df-4b48-8087-2088787f6f41","resolution":{"observed_at":"2026-08-12T11:14:32.975982Z","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-12T11:14:32.982290Z","title":"Robust Optimization , volume 28 of Princeton Series in Applied Mathematics","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2411.18590","last_updated":"2024-11-27T18:32:56Z","snapshot_observed_at":"2026-08-12T10:59:56.414589Z","submitted_at":"2024-11-27T18:32:56Z","title":"On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-12T11:14:32.982290Z"},"links":{"citing_paper":"/paper/2411.18590"},"observation_digest":"sha256:f98c1f3b35daff016d1f14396f4df6fe02e2cd061e1692689ee5d2028303afdf","observation_id":"c46137da-6d1c-43b7-81af-a872b1363c4d","resolution":{"observed_at":"2026-08-12T11:14:32.982290Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10107-003-0396-4","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:14:33.838168Z","title":"Robust discrete optimization and network flows","venue":null,"work_id":"726bbaed-7687-4613-ae11-0703ade6ac85","year":2003},"citing_paper":{"arxiv_id":"2411.18590","last_updated":"2024-11-27T18:32:56Z","snapshot_observed_at":"2026-08-12T10:59:56.414589Z","submitted_at":"2024-11-27T18:32:56Z","title":"On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-12T11:14:32.987767Z"},"links":{"citing_paper":"/paper/2411.18590"},"observation_digest":"sha256:1ba17cbb54e4508c4328f7d1d3c422e58e0d720735a657b629222fd8c04ed3ea","observation_id":"0025482d-cba5-481c-8fe7-b70115d28158","resolution":{"observed_at":"2026-08-12T11:14:33.843442Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T11:14:32.993167Z","title":"Investigating the recoverable robust single machine scheduling problem under interval uncertainty","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.18590","last_updated":"2024-11-27T18:32:56Z","snapshot_observed_at":"2026-08-12T10:59:56.414589Z","submitted_at":"2024-11-27T18:32:56Z","title":"On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-12T11:14:32.993167Z"},"links":{"citing_paper":"/paper/2411.18590"},"observation_digest":"sha256:1123b31380f3b0aafa910ded7c4ca6125a1c474cbc02fde8cf863db6d29bac6b","observation_id":"66c71493-459f-47ef-825c-4fb661dd4041","resolution":{"observed_at":"2026-08-12T11:14:32.993167Z","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-12T11:14:33.956874Z","title":"Recoverable robustness in combinatorial optimization","venue":null,"work_id":"ec8e0405-5be4-4d22-ab3d-aa14d71af13e","year":2011},"citing_paper":{"arxiv_id":"2411.18590","last_updated":"2024-11-27T18:32:56Z","snapshot_observed_at":"2026-08-12T10:59:56.414589Z","submitted_at":"2024-11-27T18:32:56Z","title":"On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-12T11:14:32.999373Z"},"links":{"citing_paper":"/paper/2411.18590"},"observation_digest":"sha256:dc18530bfea35626dcfcecdceb5bc4764a18304e4a9ca9e369712c06d88d08e3","observation_id":"f9e90536-bf2c-42f3-a51d-5dc7a3e69fb8","resolution":{"observed_at":"2026-08-12T11:14:33.962545Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1002/net.20487","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:14:33.812303Z","title":"Recoverable robust shortest path problems","venue":null,"work_id":"85ceb4bc-2bed-4d97-ba03-22fc92ce6986","year":2012},"citing_paper":{"arxiv_id":"2411.18590","last_updated":"2024-11-27T18:32:56Z","snapshot_observed_at":"2026-08-12T10:59:56.414589Z","submitted_at":"2024-11-27T18:32:56Z","title":"On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-12T11:14:33.005354Z"},"links":{"citing_paper":"/paper/2411.18590"},"observation_digest":"sha256:7a3493b1e55ac1a1a671d72235cfd069baac4d79a4b2232168bbe30b439df49a","observation_id":"758c15d5-86f9-4ef2-b360-6f347730574b","resolution":{"observed_at":"2026-08-12T11:14:33.817301Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s13675-018-0107-9","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:14:33.797092Z","title":null,"venue":null,"work_id":"0147f379-ea75-434a-b1a8-36b43e58e5b9","year":2019},"citing_paper":{"arxiv_id":"2411.18590","last_updated":"2024-11-27T18:32:56Z","snapshot_observed_at":"2026-08-12T10:59:56.414589Z","submitted_at":"2024-11-27T18:32:56Z","title":"On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-12T11:14:33.010948Z"},"links":{"citing_paper":"/paper/2411.18590"},"observation_digest":"sha256:5659d0fa4c2a2c80f504dc52d9c1ff34f67b724d3cf1c11a1940214efc39a8fd","observation_id":"d4da000c-cbd5-4fee-8dfe-41639d58d676","resolution":{"observed_at":"2026-08-12T11:14:33.802113Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-642-21527-8","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:14:33.780388Z","title":null,"venue":null,"work_id":"8bc440c2-3310-4d98-82dd-74353d4ae196","year":2011},"citing_paper":{"arxiv_id":"2411.18590","last_updated":"2024-11-27T18:32:56Z","snapshot_observed_at":"2026-08-12T10:59:56.414589Z","submitted_at":"2024-11-27T18:32:56Z","title":"On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-12T11:14:33.016184Z"},"links":{"citing_paper":"/paper/2411.18590"},"observation_digest":"sha256:bde5e3fb9e1d2e2148123a10e22381e8d8203a93ea1da096dfaf67b14f8fc984","observation_id":"2f9b0942-a5c1-4192-8b06-7e50a405fbb2","resolution":{"observed_at":"2026-08-12T11:14:33.786051Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s11590-011-0307-1","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:14:33.763574Z","title":null,"venue":null,"work_id":"4d3a4d4a-c5b7-4592-808b-bd11ff2dbfbf","year":2011},"citing_paper":{"arxiv_id":"2411.18590","last_updated":"2024-11-27T18:32:56Z","snapshot_observed_at":"2026-08-12T10:59:56.414589Z","submitted_at":"2024-11-27T18:32:56Z","title":"On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-12T11:14:33.020859Z"},"links":{"citing_paper":"/paper/2411.18590"},"observation_digest":"sha256:31bc97f786b1e29ed0fcd226780bb75dec889b59a60776a678416c6ade5d2ed0","observation_id":"4226c523-d1a2-4801-8921-b7ca9cc2b3d0","resolution":{"observed_at":"2026-08-12T11:14:33.768243Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s11590-015-0949-5","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:14:33.747385Z","title":"Chassein and Marc Goerigk","venue":null,"work_id":"ec62e191-33e7-4ef2-86c3-e65c89013e2b","year":2016},"citing_paper":{"arxiv_id":"2411.18590","last_updated":"2024-11-27T18:32:56Z","snapshot_observed_at":"2026-08-12T10:59:56.414589Z","submitted_at":"2024-11-27T18:32:56Z","title":"On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-12T11:14:33.026218Z"},"links":{"citing_paper":"/paper/2411.18590"},"observation_digest":"sha256:3c900257fa2124f25ff99fa8e90859c554d99afcb4b6dea781bf5d87edf77257","observation_id":"87f38116-7da8-4b0d-9fc8-dba3f8548cf0","resolution":{"observed_at":"2026-08-12T11:14:33.752591Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.ejor.2017.08.013","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:14:33.730328Z","title":"Chassein, Marc Goerigk, Adam Kasperski, and Pawel Zielinski","venue":null,"work_id":"e1252ff8-8502-46c4-8271-3e70a71f87bc","year":2018},"citing_paper":{"arxiv_id":"2411.18590","last_updated":"2024-11-27T18:32:56Z","snapshot_observed_at":"2026-08-12T10:59:56.414589Z","submitted_at":"2024-11-27T18:32:56Z","title":"On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-12T11:14:33.031015Z"},"links":{"citing_paper":"/paper/2411.18590"},"observation_digest":"sha256:b5e555a12e476a84f6b91bdaf66df44af0e41d2df4af7f514bfa90a79a073edf","observation_id":"2da85d04-2a5c-40f8-bbd8-caa95b109314","resolution":{"observed_at":"2026-08-12T11:14:33.736436Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T11:14:33.942860Z","title":"The uncapicitated facility location problem","venue":null,"work_id":"e4c6ec30-82b5-455e-bbf6-94c205d5c8fd","year":1983},"citing_paper":{"arxiv_id":"2411.18590","last_updated":"2024-11-27T18:32:56Z","snapshot_observed_at":"2026-08-12T10:59:56.414589Z","submitted_at":"2024-11-27T18:32:56Z","title":"On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-12T11:14:33.036054Z"},"links":{"citing_paper":"/paper/2411.18590"},"observation_digest":"sha256:6aa5073489617582a7a6b687b8449d3463364e0542c43054df7c4cdf47092a57","observation_id":"72a9ad08-ed75-4abe-8481-225168cba087","resolution":{"observed_at":"2026-08-12T11:14:33.947402Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1002/net.21624","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:14:33.711689Z","title":"Robust recoverable perfect matchings","venue":null,"work_id":"c79b5e57-be6c-469e-8988-2e9e24b1dbbb","year":2015},"citing_paper":{"arxiv_id":"2411.18590","last_updated":"2024-11-27T18:32:56Z","snapshot_observed_at":"2026-08-12T10:59:56.414589Z","submitted_at":"2024-11-27T18:32:56Z","title":"On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-12T11:14:33.042045Z"},"links":{"citing_paper":"/paper/2411.18590"},"observation_digest":"sha256:d7f3328654b0ca677de0e1eb1f61e77ec187a676901bbeec5f3dacf70a602be7","observation_id":"a7ff315c-79c2-4191-951e-8ed86e75c9b5","resolution":{"observed_at":"2026-08-12T11:14:33.717357Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.ipec.2021.19","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:14:33.694267Z","title":"Hartmann, Stefan Lendl, and Gerhard J","venue":null,"work_id":"bf2a4ab2-0d29-414f-aa3c-235e3446bbb3","year":2021},"citing_paper":{"arxiv_id":"2411.18590","last_updated":"2024-11-27T18:32:56Z","snapshot_observed_at":"2026-08-12T10:59:56.414589Z","submitted_at":"2024-11-27T18:32:56Z","title":"On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-12T11:14:33.047958Z"},"links":{"citing_paper":"/paper/2411.18590"},"observation_digest":"sha256:1c8c9c3f87439adafaf54e9fcf3adff5aaf1c4e163711e0be9367817de6b8832","observation_id":"71cf0820-1e22-4f72-9ff3-2fef474b7383","resolution":{"observed_at":"2026-08-12T11:14:33.699808Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T11:14:33.052659Z","title":"Hopcroft, and James Wyllie","venue":null,"work_id":null,"year":1980},"citing_paper":{"arxiv_id":"2411.18590","last_updated":"2024-11-27T18:32:56Z","snapshot_observed_at":"2026-08-12T10:59:56.414589Z","submitted_at":"2024-11-27T18:32:56Z","title":"On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-12T11:14:33.052659Z"},"links":{"citing_paper":"/paper/2411.18590"},"observation_digest":"sha256:b428df6cefb8b2ac9f903191cab5b5919d0d135c51880abcd878302bc647d9a6","observation_id":"65597c3e-c184-42b3-b743-403d92b5135d","resolution":{"observed_at":"2026-08-12T11:14:33.052659Z","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-12T11:14:33.057300Z","title":null,"venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2411.18590","last_updated":"2024-11-27T18:32:56Z","snapshot_observed_at":"2026-08-12T10:59:56.414589Z","submitted_at":"2024-11-27T18:32:56Z","title":"On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-12T11:14:33.057300Z"},"links":{"citing_paper":"/paper/2411.18590"},"observation_digest":"sha256:a7b179122e6172feb5fb02d0e75cf3a4be97ac032a95b1e76c8acbbb1662305a","observation_id":"b0bdb8a4-3f81-439d-a745-a3e6755a9961","resolution":{"observed_at":"2026-08-12T11:14:33.057300Z","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-12T11:14:33.919114Z","title":"An Introduction to Robust Combinatorial Optimization , volume 361 of International Series in Operations Research & Management Science","venue":null,"work_id":"eae56628-37f6-4ebe-abc6-5bf9cbe589c4","year":2024},"citing_paper":{"arxiv_id":"2411.18590","last_updated":"2024-11-27T18:32:56Z","snapshot_observed_at":"2026-08-12T10:59:56.414589Z","submitted_at":"2024-11-27T18:32:56Z","title":"On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-12T11:14:33.061939Z"},"links":{"citing_paper":"/paper/2411.18590"},"observation_digest":"sha256:5a065793789fd8cddc2557a49d1de8ec270e042290a7a6beb108da07cb8f4f52","observation_id":"cf625dad-62f2-4b0d-bbc5-29d3905d3e0e","resolution":{"observed_at":"2026-08-12T11:14:33.923730Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.ejor.2022.03.001","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:14:33.667017Z","title":"Recoverable robust representatives selection problems with discrete budgeted uncertainty","venue":null,"work_id":"ead1a837-71b7-47ae-8b34-453bd8d8c93f","year":2022},"citing_paper":{"arxiv_id":"2411.18590","last_updated":"2024-11-27T18:32:56Z","snapshot_observed_at":"2026-08-12T10:59:56.414589Z","submitted_at":"2024-11-27T18:32:56Z","title":"On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-12T11:14:33.067443Z"},"links":{"citing_paper":"/paper/2411.18590"},"observation_digest":"sha256:db18dbf1fc25a0c942f8330a788460b6378d0a6d88ea8592357437afb598b28b","observation_id":"9430d33a-75ec-476a-8a20-4ed35486e5c9","resolution":{"observed_at":"2026-08-12T11:14:33.672746Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.dam.2023.10.018","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:14:33.649922Z","title":"On the complexity of robust multi-stage problems with discrete recourse","venue":null,"work_id":"878cdae2-5f09-4a32-8001-e809b2955836","year":2024},"citing_paper":{"arxiv_id":"2411.18590","last_updated":"2024-11-27T18:32:56Z","snapshot_observed_at":"2026-08-12T10:59:56.414589Z","submitted_at":"2024-11-27T18:32:56Z","title":"On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-12T11:14:33.072274Z"},"links":{"citing_paper":"/paper/2411.18590"},"observation_digest":"sha256:38d2235b9e923c558f55f65ece840818dc76a0f41b096c34e833fc6412ab02b4","observation_id":"01d676da-fc11-4d57-b67a-2da981a7c941","resolution":{"observed_at":"2026-08-12T11:14:33.655564Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T11:14:33.076870Z","title":"The complexity classes of hamming distance recoverable robust problems","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.18590","last_updated":"2024-11-27T18:32:56Z","snapshot_observed_at":"2026-08-12T10:59:56.414589Z","submitted_at":"2024-11-27T18:32:56Z","title":"On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-12T11:14:33.076870Z"},"links":{"citing_paper":"/paper/2411.18590"},"observation_digest":"sha256:13e9306cc040ba15b38f500c07d89cdd560e05199cd73b8035aa4ab40d9816f6","observation_id":"8d5126a3-75e6-4df1-80e7-92d010009daa","resolution":{"observed_at":"2026-08-12T11:14:33.076870Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.48550/arxiv.2311.10540","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:14:33.621462Z","title":"Completeness in the polynomial hierarchy for many natural problems in bilevel and robust optimization","venue":null,"work_id":"787c16e1-1f84-4fe8-b43b-9ad5d9c752d0","year":2023},"citing_paper":{"arxiv_id":"2411.18590","last_updated":"2024-11-27T18:32:56Z","snapshot_observed_at":"2026-08-12T10:59:56.414589Z","submitted_at":"2024-11-27T18:32:56Z","title":"On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-12T11:14:33.082567Z"},"links":{"citing_paper":"/paper/2411.18590"},"observation_digest":"sha256:8d61d799304f2ab9a953c101915fcf1c75002f93c4a1bfca738291dc6bfdf5d3","observation_id":"94681277-968c-44c6-aacf-c3534b973a70","resolution":{"observed_at":"2026-08-12T11:14:33.626976Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.08546","last_updated":"2026-07-02T07:35:04Z","snapshot_observed_at":"2026-08-11T10:53:11.259815Z","submitted_at":"2023-06-14T14:44:28Z","title":"Recoverable Robust Optimization with Commitment","version":2},"cited_work":{"arxiv_id":"2306.08546","doi":"10.48550/arxiv.2306.08546","metadata_source":"pith","pith_arxiv_id":"2306.08546","snapshot_observed_at":"2026-08-12T12:16:16.734455Z","title":"Recoverable Robust Optimization with Commitment","venue":"cs.DS","work_id":"90d64099-50ee-48bf-b374-3a70f7de9070","year":2023},"citing_paper":{"arxiv_id":"2411.18590","last_updated":"2024-11-27T18:32:56Z","snapshot_observed_at":"2026-08-12T10:59:56.414589Z","submitted_at":"2024-11-27T18:32:56Z","title":"On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-12T11:14:33.087882Z"},"links":{"cited_paper":"/paper/2306.08546","citing_paper":"/paper/2411.18590"},"observation_digest":"sha256:47b993837a0e9c276f78eae54d704853c48b7bbd8dbf8515011e2eb96353fdf4","observation_id":"d80895c5-2a2b-4708-a778-66a397d4da98","resolution":{"observed_at":"2026-08-12T11:14:33.552827Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10878-016-0089-6","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:14:33.522937Z","title":"Recoverable robust spanning tree problem under interval uncertainty representations","venue":null,"work_id":"74e6f4c2-e03f-490f-92b5-a31946606b8f","year":2017},"citing_paper":{"arxiv_id":"2411.18590","last_updated":"2024-11-27T18:32:56Z","snapshot_observed_at":"2026-08-12T10:59:56.414589Z","submitted_at":"2024-11-27T18:32:56Z","title":"On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-12T11:14:33.092901Z"},"links":{"citing_paper":"/paper/2411.18590"},"observation_digest":"sha256:4b4ac72b0ebef418fe475806169e62589850b4d8a96ca791254287e8628e6a70","observation_id":"c47ef51b-d807-4d42-ad4d-7fc15ea032b1","resolution":{"observed_at":"2026-08-12T11:14:33.529032Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s11590-016-1057-x","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:14:33.505988Z","title":"The recoverable robust spanning tree problem with interval costs is polynomially solvable","venue":null,"work_id":"1a20cea0-7958-4403-8b32-8058fd74f1d0","year":2017},"citing_paper":{"arxiv_id":"2411.18590","last_updated":"2024-11-27T18:32:56Z","snapshot_observed_at":"2026-08-12T10:59:56.414589Z","submitted_at":"2024-11-27T18:32:56Z","title":"On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-12T11:14:33.098069Z"},"links":{"citing_paper":"/paper/2411.18590"},"observation_digest":"sha256:7d1a98adfd66bae120c45a43861637669caff8412afdc97dcbf3fac189966629","observation_id":"280ec647-c344-45d9-a241-3350efc89f45","resolution":{"observed_at":"2026-08-12T11:14:33.511684Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.20000","last_updated":"2026-07-03T08:31:26Z","snapshot_observed_at":"2026-08-13T00:42:24.881658Z","submitted_at":"2024-03-29T06:27:44Z","title":"Computational Complexity of the Recoverable Robust Shortest Path Problem with Discrete Recourse","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.20000","snapshot_observed_at":"2026-08-12T11:14:33.102691Z","title":"Computational complexity of the recoverable robust shortest path problem with discrete recourse","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.18590","last_updated":"2024-11-27T18:32:56Z","snapshot_observed_at":"2026-08-12T10:59:56.414589Z","submitted_at":"2024-11-27T18:32:56Z","title":"On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-12T11:14:33.102691Z"},"links":{"cited_paper":"/paper/2403.20000","citing_paper":"/paper/2411.18590"},"observation_digest":"sha256:2add88d60e10a6ec8d78f52eed6cf0116c10cf2c12c40ee14053e2e302644e74","observation_id":"57fdfcd1-57cf-4e87-aa57-35ddb0f8570c","resolution":{"observed_at":"2026-08-12T11:14:33.102691Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.48550/arxiv.2401.05715","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:14:33.472935Z","title":"Recoverable robust shortest path problem under interval uncertainty representations","venue":null,"work_id":"5bf1da36-427a-4590-a14e-4a52ac532370","year":2024},"citing_paper":{"arxiv_id":"2411.18590","last_updated":"2024-11-27T18:32:56Z","snapshot_observed_at":"2026-08-12T10:59:56.414589Z","submitted_at":"2024-11-27T18:32:56Z","title":"On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-12T11:14:33.107952Z"},"links":{"citing_paper":"/paper/2411.18590"},"observation_digest":"sha256:5e7a8673a04b2e1f4b1da828c1ea13047e8105049224b5d46866b5d9be6263de","observation_id":"c7a0321f-10b4-43a0-935e-ac2022219a4e","resolution":{"observed_at":"2026-08-12T11:14:33.478178Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T11:14:33.113045Z","title":"Jeroslow","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2411.18590","last_updated":"2024-11-27T18:32:56Z","snapshot_observed_at":"2026-08-12T10:59:56.414589Z","submitted_at":"2024-11-27T18:32:56Z","title":"On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-12T11:14:33.113045Z"},"links":{"citing_paper":"/paper/2411.18590"},"observation_digest":"sha256:f70a6c51ffc3312bc8efb793efc6273f023455932c3bccaed435a99e5caf279c","observation_id":"5e04d5b6-ab3d-4a6a-825a-7dcb38d2e05c","resolution":{"observed_at":"2026-08-12T11:14:33.113045Z","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-12T11:14:33.904602Z","title":"New classes of complete problems for the second level of the polynomial hierarchy","venue":null,"work_id":"7ea2f25f-2fdd-4f4d-83e3-3937a68581d9","year":2011},"citing_paper":{"arxiv_id":"2411.18590","last_updated":"2024-11-27T18:32:56Z","snapshot_observed_at":"2026-08-12T10:59:56.414589Z","submitted_at":"2024-11-27T18:32:56Z","title":"On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-12T11:14:33.117619Z"},"links":{"citing_paper":"/paper/2411.18590"},"observation_digest":"sha256:808528a7c91fd9cf3b6f84c406b758df6f54554e7dcad310b68092c40ca33c52","observation_id":"1f480d9a-d7e8-45c8-b91c-de18787a3d0e","resolution":{"observed_at":"2026-08-12T11:14:33.909386Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T11:14:33.123263Z","title":null,"venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2411.18590","last_updated":"2024-11-27T18:32:56Z","snapshot_observed_at":"2026-08-12T10:59:56.414589Z","submitted_at":"2024-11-27T18:32:56Z","title":"On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-12T11:14:33.123263Z"},"links":{"citing_paper":"/paper/2411.18590"},"observation_digest":"sha256:3e23be1284bb7e6890cd12f2b20a4056483bbe1ec98e70700881fc7629852ef6","observation_id":"0c64390b-a928-4f89-8a1f-e44f76f917b5","resolution":{"observed_at":"2026-08-12T11:14:33.123263Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.dam.2017.08.014","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:14:33.278670Z","title":"Robust recoverable and two-stage selection problems","venue":null,"work_id":"368713c3-cb62-40d8-919f-9270ee8ce447","year":2017},"citing_paper":{"arxiv_id":"2411.18590","last_updated":"2024-11-27T18:32:56Z","snapshot_observed_at":"2026-08-12T10:59:56.414589Z","submitted_at":"2024-11-27T18:32:56Z","title":"On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-12T11:14:33.128611Z"},"links":{"citing_paper":"/paper/2411.18590"},"observation_digest":"sha256:444b60c0659d6fe741ba0277496c7c7fd2d3dcd0edf3a7df46ddeb021592b523","observation_id":"036c2f42-801a-419f-a616-e2b7683dddd4","resolution":{"observed_at":"2026-08-12T11:14:33.284548Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T11:14:33.889203Z","title":"Robust discrete optimization and its applications , volume 14","venue":null,"work_id":"8edc7951-ad42-45d5-a5d5-206ca8b2e942","year":2013},"citing_paper":{"arxiv_id":"2411.18590","last_updated":"2024-11-27T18:32:56Z","snapshot_observed_at":"2026-08-12T10:59:56.414589Z","submitted_at":"2024-11-27T18:32:56Z","title":"On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-12T11:14:33.134436Z"},"links":{"citing_paper":"/paper/2411.18590"},"observation_digest":"sha256:22ee73829195ddba91d5dabc81e51e6b92dd434331a29df768187ab56d8ae237","observation_id":"6774ad4c-472c-4725-8376-69a13dd81b36","resolution":{"observed_at":"2026-08-12T11:14:33.894359Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.dam.2020.08.012","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:14:33.260999Z","title":"Woeginger","venue":null,"work_id":"89c70d89-dede-4c47-8452-c58b03c008b0","year":2021},"citing_paper":{"arxiv_id":"2411.18590","last_updated":"2024-11-27T18:32:56Z","snapshot_observed_at":"2026-08-12T10:59:56.414589Z","submitted_at":"2024-11-27T18:32:56Z","title":"On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-12T11:14:33.139185Z"},"links":{"citing_paper":"/paper/2411.18590"},"observation_digest":"sha256:d20e9eb04d9778baa3d1427a2cabe25a3d3d8abb2f6c4577b9472d6a7611355b","observation_id":"e71a51b6-b808-4b5f-acbe-537641130c86","resolution":{"observed_at":"2026-08-12T11:14:33.266765Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10107-021-01642-1","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:14:33.243336Z","title":"Matroid bases with cardinality constraints on the intersection","venue":null,"work_id":"2a9f3a41-496b-40ff-81ee-d5d04cd04cd7","year":2022},"citing_paper":{"arxiv_id":"2411.18590","last_updated":"2024-11-27T18:32:56Z","snapshot_observed_at":"2026-08-12T10:59:56.414589Z","submitted_at":"2024-11-27T18:32:56Z","title":"On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-12T11:14:33.144287Z"},"links":{"citing_paper":"/paper/2411.18590"},"observation_digest":"sha256:369a73d77f771af746e0ac3b5fe7336a81e8fed2cc36acfde88b66724af5671b","observation_id":"a10a0234-8d1b-45d7-ad13-2666b0772415","resolution":{"observed_at":"2026-08-12T11:14:33.249618Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-642-05465-5","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:14:33.225150Z","title":"u bbecke, Rolf H. M \\","venue":null,"work_id":"fceccd2b-a76d-4079-a861-62c63d6eef60","year":2009},"citing_paper":{"arxiv_id":"2411.18590","last_updated":"2024-11-27T18:32:56Z","snapshot_observed_at":"2026-08-12T10:59:56.414589Z","submitted_at":"2024-11-27T18:32:56Z","title":"On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-12T11:14:33.149892Z"},"links":{"citing_paper":"/paper/2411.18590"},"observation_digest":"sha256:2f123dfe35c44cfc4ab4aceb33e770c31b8aa9b697e401120afd3657662001d3","observation_id":"31fec214-d11f-4ada-8b82-bc8b3211b729","resolution":{"observed_at":"2026-08-12T11:14:33.231906Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T11:14:33.873639Z","title":"Papadimitriou","venue":null,"work_id":"9800936e-7920-43e8-ba80-3469b67c8319","year":1994},"citing_paper":{"arxiv_id":"2411.18590","last_updated":"2024-11-27T18:32:56Z","snapshot_observed_at":"2026-08-12T10:59:56.414589Z","submitted_at":"2024-11-27T18:32:56Z","title":"On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-12T11:14:33.156179Z"},"links":{"citing_paper":"/paper/2411.18590"},"observation_digest":"sha256:5f4f50f1aad1e86eebe3254ea6bc3b52afa1e3ae709bb425099d6388f22dc0db","observation_id":"23baa6fe-2cef-4059-aa76-ec4416e39e6c","resolution":{"observed_at":"2026-08-12T11:14:33.878901Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T11:14:33.161377Z","title":"Introduction to the theory of computation","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2411.18590","last_updated":"2024-11-27T18:32:56Z","snapshot_observed_at":"2026-08-12T10:59:56.414589Z","submitted_at":"2024-11-27T18:32:56Z","title":"On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-12T11:14:33.161377Z"},"links":{"citing_paper":"/paper/2411.18590"},"observation_digest":"sha256:ea420524f30deb43352f2d08f97b847981388d10b4170d05c5c897cba4aeaf31","observation_id":"112fca25-98eb-4776-bd2c-6173dbe8d507","resolution":{"observed_at":"2026-08-12T11:14:33.161377Z","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-12T11:14:33.166660Z","title":"Stockmeyer","venue":null,"work_id":null,"year":1976},"citing_paper":{"arxiv_id":"2411.18590","last_updated":"2024-11-27T18:32:56Z","snapshot_observed_at":"2026-08-12T10:59:56.414589Z","submitted_at":"2024-11-27T18:32:56Z","title":"On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-12T11:14:33.166660Z"},"links":{"citing_paper":"/paper/2411.18590"},"observation_digest":"sha256:01ecf0ec5906125a14524f94185b03ce995b948f16ac58b0feea15995d195f1a","observation_id":"0f71ea51-fc6f-47de-af8b-a61d624ae487","resolution":{"observed_at":"2026-08-12T11:14:33.166660Z","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-12T11:14:33.171907Z","title":"Woeginger","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.18590","last_updated":"2024-11-27T18:32:56Z","snapshot_observed_at":"2026-08-12T10:59:56.414589Z","submitted_at":"2024-11-27T18:32:56Z","title":"On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-12T11:14:33.171907Z"},"links":{"citing_paper":"/paper/2411.18590"},"observation_digest":"sha256:89ecdc0bfb816a5027eb763b69043ee26f90d531312ebe2fc8c993870a4651fd","observation_id":"99a283c5-2fd8-4862-978f-d23d4e23699d","resolution":{"observed_at":"2026-08-12T11:14:33.171907Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2411.18590","last_updated":"2024-11-27T18:32:56Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-12T10:59:56.414589Z","submitted_at":"2024-11-27T18:32:56Z","title":"On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy"},"reference_resolution":{"displayed":38,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":12,"verified_exact":20,"verified_fuzzy":6},"total_outbound_references":38},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"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."}