{"as_of":"2026-08-11T03:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:00dce5fac4583e98eefaf1c4f9ce9bcfd21514eaaf0070c91deaf2cd39be8235","coverage":[{"denominator":63,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":63,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-29T19:50:06.390639Z","state":"measured"},{"denominator":63,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":63,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+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/2605.26763/citation-record","integrity":"/paper/2605.26763/integrity","json":"/paper/2605.26763/citation-record.json","paper":"/paper/2605.26763"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T19:50:06.390639Z","title":"A maximum expected covering location model: formula- tion, properties and heuristic solution,","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:c814c05c2790e04e3855ea5eb4f9904fb89f21f38fb493060689707036dbb597","observation_id":"360e1325-e827-4ecd-acf8-1626bb139fc6","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"The maximal covering location problem,","venue":null,"work_id":null,"year":1974},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:c2ba49c753fa0176efe8e50f9d4ce8ddc709f69cbb8fe60ba0484423d10ec000","observation_id":"423596d8-4e47-4add-9b40-03c2d1962c6b","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"A review of covering problems in facility location,","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:cd2298a0b225e29c1fa61bc294529856103dc2e2d3c5ea0e6157af3b6b1e9105","observation_id":"28dbcf8a-12d1-43f5-8ebf-5e8f8ed1e126","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"Disruption, protection, and resilience,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:c056b9bafb2bd8cb94b6edda32844c2df55c852db9850e7e529f06d394eb2891","observation_id":"185c1f10-565f-4348-8d56-e8ae496fb067","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"Us risks national blackout from small-scale attack,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:5fea90b23858c503c70b90d39bbc356d1d88adcb6085f04856c3ead3253f64c6","observation_id":"bcca6c33-6264-4975-826e-1c666de46499","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"Facility reliability issues in network p-median problems: Strategic centralization and co-location effects,","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:46459860df8012430150e4d2bc45a4daf9677710868cd7a0f814e4b1bdc1bd50","observation_id":"511ca101-3730-4a1c-b8b0-2804aa93c9b3","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"Or/ms models for supply chain disruptions: A review,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:2fe261c8825eacae4e11445a3f866edeffe817cfabc006cf478843600b3b0bdd","observation_id":"82096c10-c446-464b-acdc-3e9ad7e83d1a","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"A survey of network interdiction models and algorithms,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:32a83b788525b78588917c911a72bbd2dd13434d51519e33567dc4b130e2978e","observation_id":"a15ad82a-8116-47f2-a02e-4e521df793ad","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"Heuristic solution methods for two location problems with unreliable facilities,","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:19a795de5dadeb592a6fd2bf967d94929e07bd321b973bc86081f0a0abaf7cec","observation_id":"075d0368-a780-48ca-8566-534e1a338fff","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"A facility relia- bility problem: Formulation, properties, and algorithm,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:5bc7367bf0958b8260ce2ff476e0a7e815ff444405ec09616517ad3c8511f467","observation_id":"e4920d9e-dddd-4008-9807-2f935efb8650","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"A general model and efficient algorithms for reliable facility location problem under uncertain disruptions,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:10aadc4acd49f4994b5048d7053e7403c3858480cb2c3e53ecaa8e072e7da185","observation_id":"3da5f346-4b51-4186-b70c-0bcd80d7231e","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"Concepts and applications of backup cover- age,","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:be77a5f7cb0ca5bb8f47e2ee74eb5a1ee84572193e50b143c12a64972a0a4714","observation_id":"4031077b-b7d4-42ac-a158-20cef33c5008","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"An analysis of p-median location problem: Effects of backup service level and demand assignment policy,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:134266b9bbcd9ec2985a25b306b574e7a74d841b24ba7e8123e9fd19d3b37b60","observation_id":"3fccd25e-49cc-4486-9f99-5ea38b002213","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"Location optimization of urban fire stations considering the backup coverage,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:b4d6486c1ed12883ca86589864a6757b2b623a78be63ee5810f0c8e1620a09d1","observation_id":"d4aadd41-e8a4-4d64-b935-71297872b0ec","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"Designing robust coverage networks to hedge against worst-case facility losses,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:42e64f65877e2ca670d7353f69cba6accb8d89c7d614499fd3199e432dd88be1","observation_id":"9e681a62-e127-419b-8176-b1fcfccc7f38","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"Identifying critical infrastructure: the median and covering facility interdiction problems,","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:2da170a9448a6e70b45f12bf7c115a1fa36526792e37e7814768f8215bddb766","observation_id":"49914fde-32c3-44b9-8481-5201322cfa2f","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"IBM ILOG CPLEX Optimization Studio,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:47c8fce36c245a62c8b02295829eb906b3a9f190f55b0305727fd881f57d81b6","observation_id":"e593cbb3-70bc-4e9d-b5d9-ef727d3da212","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"Gurobi Optimizer Reference Manual,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:c21726a78753a09c26472e0b1b9bb44678ff72d1c85ab7b16b8ece7bdbd5b96c","observation_id":"52692bc0-1bc5-431e-91f6-d8f386e3c494","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"Available: https://www.gurobi.com","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:0b9b81c5d07650ee47c890cf5ac63527f75d407a030a53c9e5d078356af125b0","observation_id":"bceab852-cfd5-4002-b2f3-ab11dedb99d6","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"Metaheuristics for bilevel optimization: A comprehensive review,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:80c073db8ddd598a939a27526e6b9ea40907c952be08e2607ca47d4ad1600133","observation_id":"9a8c26c4-1c48-49f4-b50a-9657528b8326","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"Mathematical programs with optimization problems in the constraints,","venue":null,"work_id":null,"year":1973},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:586b34bc05e8a22fdf04041b58a1ee9591bee22abe52a4cba10b274f1dbfbee4","observation_id":"70d3c175-1f75-4474-a412-d22e88b357af","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"The polynomial hierarchy and a simple model for competitive analysis,","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:8995a8fcc54e3fdc2ddf9ca8616445f2cb98efcd69a609d01db676187e789371","observation_id":"73a33bc8-d02a-4c9d-a472-a221f9ebb07e","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"Solving the bilevel facility location problem under preferences by a stackelberg-evolutionary algorithm,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:f251ee7526fce842404210f775f76367bb6563679c95a6f91b3be77a45a85ba0","observation_id":"da29fc65-e996-47a7-8104-00bb0cd629a0","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"A matheuristic for solving the bilevel approach of the facility location problem with cardinality constraints and preferences,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:f032791755f087f91f4bc003d4a61460504d5b0f790e5516f5efd0f9a14b88aa","observation_id":"2e9fa5d8-0f77-4589-833e-993b4d627cbc","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"There’s no free lunch: on the hardness of choosing a correct big-m in bilevel optimization,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:63a168566a97c26789343b985d2941cf843c2e5475c66cfc9adce8dff3191f84","observation_id":"82cff39f-53be-42fc-9251-cf9ed306afce","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"The mixed integer linear bilevel program- ming problem,","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:42c7444f02cdad7467bd029d1560b53db849380adfd2cbf6646cfde4763997c2","observation_id":"1251718e-a55d-4830-886c-9a265804ba37","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"The solution of the linear bilevel programming problem by using the linear complementarity problem,","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:04fa0a939ebeeffd4231561623f2ac33fdfc2f47dddae9b4eab87d92fb64054e","observation_id":"ad9c60bb-b813-45c5-9b13-35feeedd644f","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"A branch and bound algorithm for the bilevel programming problem,","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:6be0b8da60d1bf2620a8b3ab444a41f8232cb42f0f442e1cd5794748b69d2ab6","observation_id":"2a9a7dc2-5e78-4c78-8970-687db498c6bd","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"Exact solution methodologies for linear and (mixed) integer bilevel programming,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:18e39d51a576bccf0fe4b35d4a1a198d85ef3171f975b3a1522ab2770d013d8e","observation_id":"8aee5012-bd2e-4de9-9c72-d5f8fb368414","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"A survey on mixed- integer programming techniques in bilevel optimization,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:9799b450429fcf996852f2f35defa028f4f48a82ff19a7b975fb3684b59ead37","observation_id":"c2601be3-d2a7-4ecf-8d4d-fff52ad90dea","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"A taxonomy of metaheuristics for bi-level optimization,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:a8d79b2e38b941ea5e1bef9d4d7fd67bdde1a97c3b32c0db151d77109d196861","observation_id":"cf0d3322-2868-4848-8aba-dbf1cc149637","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"Optimal pricing for bidirectional wireless charging lanes in coupled transportation and power networks,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:e380b6809f7872fea8faeefff19989487148185bcd1039af850e2a8a24480350","observation_id":"f2c31822-8898-4a3b-b1bd-72ba7f7494aa","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"A hybrid heuristic approach with adaptive scalar- ization for linear semivectorial bilevel programming and its application,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:2ee1f2212bb5ed4f02fbbaf1f977ca604d3894785d4ece66fb4f477c709685fe","observation_id":"7471a086-b2f3-44ff-b6ce-7e56ea48de86","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"Bilevel optimization model for sizing of battery energy storage systems in a microgrid considering their economical operation,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:4c1ff52c36618e07787ab6cb13d5c03b267269da6ba662cee28e11bd5451d187","observation_id":"caec2de0-f3c2-4fc0-a31e-5aae093045b0","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"An efficient environmentally friendly transportation network design via dry ports: a bi-level programming approach,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:e4e91c3510db762ae7c9feb7cb4f2a8f9e670c1e69e2db41c8f4da65744acd64","observation_id":"fa29c670-a43d-4dcd-870f-4e13bdb3e1f0","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"Research on location-routing problem of maritime emergency materials distribution based on bi-level programming,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:4064e1ce8a705655748d7b8f98ace455c5ae23992b37381ba94f4bfc14f93a1b","observation_id":"2f90f5e1-e286-45ee-b05d-19fed7458bda","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"A bilevel whale optimization algorithm for risk management scheduling of infor- mation technology projects considering outsourcing,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:27632e7fc5cfea11965fdf9cac6d21bb90bb258c661dcc6d08a2c0c7f1d88c75","observation_id":"8fd0bdfa-c12a-4a9b-acf7-29da9879f4c8","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"Bilevel memetic search approach to the soft-clustered vehicle routing problem,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:131b80068b7f4b8becf7d78edd6ffa89e83537226de203e04ac5d0793a96ff8f","observation_id":"b20c855c-01a4-42c2-afee-f2c78aeff9d3","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"Discretization-based feature selection as a bilevel optimization prob- lem,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:fea101719363bc4cb2640971f8e38e7175ad7576245a2e225396a0f20355d122","observation_id":"a6890636-8157-4293-bfff-43e3979536d6","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"Integrated optimization of transfer station selection and train timetables for road–rail intermodal transport network,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:abe4799fc953dd0960a98e4a808a9caf1ef944d0931a97d441d72093e1db03c2","observation_id":"afd5f545-83b5-4238-a200-f9ef25f3ecd9","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"Cobra: A coevolutionary metaheuristic for bi-level optimization,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:39f7a6039b00fc47e4f53afecb90b2d06cdc0a8bcb39f9ead3dec615baa33713","observation_id":"e8ec0dbe-d698-4f46-843e-ddf297131e15","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"Bilevel com- petitive facility location and pricing problems,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:2c2f56171ee86f47943b6a34abafb0b3a4bca6f9eb664f62ca58491af758be47","observation_id":"86f1c8f1-4396-4eea-a545-02bfd10f8da8","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"A surrogate-assisted meta- heuristic for bilevel optimization,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:74efdc72bd18bb3a31c8a09a5c4f3da5dd73c8db973b9d7b641a6bf1bfe0ee95","observation_id":"7ec650a3-cd30-4c29-8c1b-07d894929253","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"An attention model with multiple decoders for solving p-center problems,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:ee9077ff7e5999ca79b0bd8f261acab2928983f7e0fd5d198a32fe3cc592b353","observation_id":"8b79807a-5f57-4932-8156-76d80fcb0b59","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"Deepmclp: Solving the mclp with deep reinforcement learning for urban spatial,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:3ae1df36895c0540b517b0f94d1da2dfa024e3a8e4c0a846547056602422be45","observation_id":"77284152-2a79-4aba-a37d-52c59423cf75","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"Recovnet: Reinforcement learning with covering information for solving maximal coverage billboards location problem,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:6d23164d1355d73c8abd48852135b5ee9a60ca233b88aa74a096b4c7ac89cfb1","observation_id":"a36ac374-6fca-4053-9fcc-60a4bc64bcf4","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"Sponet: solve spatial optimization problem using deep reinforcement learning for urban spatial decision analysis,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:2bf9e0a4e0c6a6dc247032fd353a4277aec53fb22e2a4b6b56118e60c7c5a4cf","observation_id":"3dbda144-02d0-4c01-98b9-064792c8b31b","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"Deep reinforcement learning for multi-period facility location: pk-median dynamic location problem,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:13c0be4d64c9047e2b244b9ec9fe1ecc17af7c1bd7a823e1715edaacbe0f858a","observation_id":"04a9078a-f669-4f02-944a-49857455ab57","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2511.02525","last_updated":"2026-05-26T09:29:42Z","snapshot_observed_at":"2026-08-04T00:14:31.458738Z","submitted_at":"2025-11-04T12:23:17Z","title":"An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems","version":2},"cited_work":{"arxiv_id":"2511.02525","doi":null,"metadata_source":"pith","pith_arxiv_id":"2511.02525","snapshot_observed_at":"2026-06-29T19:53:55.830531Z","title":"An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems","venue":"cs.LG","work_id":"6e30bad2-6085-4ca4-beea-23ecd6f279fd","year":2025},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"cited_paper":"/paper/2511.02525","citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:7e09df57d8d0a8723bfe7a659a62f9f574ea0c36fe25c6b916107049ca022324","observation_id":"44b61374-3c65-46e0-8dfb-68d367ed053d","resolution":{"observed_at":"2026-06-29T19:53:55.661020Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06-29T19:50:06.390639Z","title":"A deep reinforcement learning method for solving two-echelon location-routing problem,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:cac03320739593ab71fdda878361f38053f303a72fd100e7f9b612959c04f0ca","observation_id":"0b6bc1c3-61df-40d3-a3d3-38f779faa09e","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"On the stackelberg strategy in nonzero- sum games,","venue":null,"work_id":null,"year":1973},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:a473b7780fb44ede47840251b35d7d03dd8599d7dfcf706a3430e1afb5a20c76","observation_id":"6d9df973-9c52-42ae-8943-597aa9e425c4","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"Generative adversarial nets,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:0234696d20154c83c3aafc93659371ff1886f01375f34cb81bcf5620bacf7d43","observation_id":"55ec0ad8-9795-4e72-a5fa-c2362e4f3d21","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"A column generation approach for the maximal covering location problem,","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:f777748da411d0c9e8e1ae9a0ab48816ebe64ca2f5a2a16774efc6285a22ecad","observation_id":"fa587eb8-0035-40e3-9d3b-163354f51b04","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"Attention, learn to solve routing problems!","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:75a0d7a7e647e0213c6349c88e5374789ba13317ac2a37ec15af2fca52558029","observation_id":"99d46bbd-dbe2-4016-9d95-2b146dbb15ca","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"A heuristic program for locating warehouses,","venue":null,"work_id":null,"year":1963},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:73dbe8da43e1b6e14d949fd97ae01b64db38779bf4da427896074246233a7243","observation_id":"022380a0-2dde-4984-98a6-024530c47690","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"Warehouse location under con- tinuous economies of scale,","venue":null,"work_id":null,"year":1966},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:20a86f466157bfcad12475c8f709ecf0e818f2975e9f365c8054a0336365deb3","observation_id":"70dc461d-f000-450e-ba0b-d69856a0b6e8","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"A fast algorithm for the greedy interchange for large-scale clustering and median location problems,","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:405d7b5ceee562cd961a5a6211d8fe42c24497384afe42e913e7dd219e1bb63f","observation_id":"765bea3f-6c65-4097-a4ed-730b56171607","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"A more efficient heuristic for solving large p-median problems,","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:ccb2c01d1826fa988a7c34e49109ba742adc3f83a9fefa0606d3cd4a8c65c2ab","observation_id":"9528fed7-8ff2-4b57-a871-a5d9648ebb74","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"On the location of supply points to minimize transport costs,","venue":null,"work_id":null,"year":1964},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:5d0467467587e1ddd2942014e5b5fd62126e1341905350424a6818e06ff9d449","observation_id":"e99e62cf-144d-4c58-9f60-dda800675992","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"The large scale maximal covering location problem,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:d6bd117275e02319da34efb1038f809b9a7fb3771e9edc336ce5c869b969cdbf","observation_id":"1ce5183e-131b-418f-b082-bede167f518f","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"Maximal covering location problem (mclp) with fuzzy travel times,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:c8af0b3752a927607b3cb9f11b9edec24d3fbf8b9535417729336fa60a24a36a","observation_id":"da6f4e9f-7947-4a1c-89fc-ce9d07c8ab7c","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"The minimum weighted covering location problem with distance constraints,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:51ec67cb3fd3afe54f4571ff1ae996108ce6a2c308d954f26210721250f91aa6","observation_id":"a7f95570-89fb-4136-bc27-08aa6bfef69a","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:50:06.390639Z","title":"A variable neighborhood search for the budget-constrained maximal covering location problem with customer preference ordering,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:55311d26e96775241244f838fd92d60aa1a1383b61906cfd25cf6495685d9a9c","observation_id":"c1f2d95a-7e13-4292-971a-ddcc6791c2bf","resolution":{"observed_at":"2026-06-29T19:50:06.390639Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses"},"reference_resolution":{"displayed":63,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":62,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":63},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 63 of 63 outbound references and 0 inbound Pith citation observations for arXiv:2605.26763."}