{"as_of":"2026-08-09T09:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:587a37253b599427d8d99eff1ad3f100f8e0741d2e52de47089a05ca43df4aa4","coverage":[{"denominator":61,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":61,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T20:46:16.466252Z","state":"measured"},{"denominator":61,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":61,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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/2508.10189/citation-record","integrity":"/paper/2508.10189/integrity","json":"/paper/2508.10189/citation-record.json","paper":"/paper/2508.10189"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T20:46:17.066166Z","title":"Computers & operations research 40(3), 856–866 (2013)","venue":null,"work_id":"e84fed8f-5e44-4b7e-aa45-8ff3aba1c071","year":2013},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.210317Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:6a5f2210ea5daba4bba4460af546e0d26f3831b13e7962f029bff2986bf506a6","observation_id":"bb881ed8-99e6-4375-b1d2-cea0d895da53","resolution":{"observed_at":"2026-08-05T20:46:17.068947Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T20:46:17.057369Z","title":"Computers & In- dustrial Engineering 115, 190–205 (2018)","venue":null,"work_id":"d139345f-1f82-4c7f-bc49-c95d408f0a91","year":2018},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.214510Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:c21a664d6f5e349d32e2f4fa95bdd9e445f8973433b69455e1cf2c8a3a8b85e3","observation_id":"5c3c2670-46ee-40ce-8930-fb62b21c20a9","resolution":{"observed_at":"2026-08-05T20:46:17.060224Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T20:46:17.047595Z","title":"Improving Homeland Security Decisions p","venue":null,"work_id":"6d047a2f-ea85-4b0d-bd80-73cf965ac0bc","year":2017},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.218474Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:632913bed3cd9a8d2ac7a45a8cdd7cac63fc12ba1f154d44faa17318266b5994","observation_id":"3ac6ff5c-01fc-4842-8b73-513e436b8d32","resolution":{"observed_at":"2026-08-05T20:46:17.050756Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T20:46:17.038635Z","title":"IBM Journal of Research and Development51(3.4), 391–407 (2007) Contested Route Planning 19","venue":null,"work_id":"a32faa53-7575-405a-8c58-f8ab7cb12234","year":2007},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.223113Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:251b0ef5f3a5af2fc5590627564704173f32e4aa8c98c619224daa36e1c4d9ca","observation_id":"a1f19769-3999-4536-a863-d361c4c9b77b","resolution":{"observed_at":"2026-08-05T20:46:17.041821Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T20:46:17.029427Z","title":"Algorithm engineering: Selected results and surveys pp","venue":null,"work_id":"64e89587-db05-4e40-b98c-81625aca389c","year":2016},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.227964Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:18caf47ccafea03f1c0fc72e8429453d5c7c8effd19903822616f10fc416d981","observation_id":"d613c717-c19e-43fc-a33d-6e5826ecc7a5","resolution":{"observed_at":"2026-08-05T20:46:17.032732Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T20:46:17.020645Z","title":null,"venue":null,"work_id":"634d1b01-6b49-43c2-a2e3-7e9b905602d4","year":2022},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.231783Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:1c4fd10d5e5821a15e40f8042af5058341e2fe037725edd5ee3237b3a5932c89","observation_id":"514e2860-9046-49a5-8ca6-ec1221ddeb59","resolution":{"observed_at":"2026-08-05T20:46:17.023373Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T20:46:17.011156Z","title":"Applications of location analysis pp","venue":null,"work_id":"07977170-6356-4281-8fda-910ad2770345","year":2015},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.235805Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:3d3e7b170750be74fb8fe2beb9422e73ca2d4d044ec7c3d620d03bfe011c82e7","observation_id":"52060931-c0b9-4be0-8fa5-d612dde86a17","resolution":{"observed_at":"2026-08-05T20:46:17.013950Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T20:46:17.001350Z","title":"Computers & Industrial Engineering115, 520–531 (2018)","venue":null,"work_id":"a08ed711-fa01-4b6b-868d-18b2c6f8c780","year":2018},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.239456Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:0c4db286f899fca00286ffd759e8ba5f5a6c6148ccd62a63f935a8b726a7e25d","observation_id":"b7378737-abb0-4b0c-90bf-bd9d02787c00","resolution":{"observed_at":"2026-08-05T20:46:17.004512Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T20:46:16.991756Z","title":"The Journal of Defense Modeling and Simulation17(1), 55–81 (2020)","venue":null,"work_id":"6728d898-b862-4bdb-8267-b12bdf820389","year":2020},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.243924Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:d8a3482cd6538e868741b01f3fa91a3db5ea4bf2dec503e3b1815afb960ee2d2","observation_id":"5c0c6041-f0f1-4ac3-b465-15678a36a63c","resolution":{"observed_at":"2026-08-05T20:46:16.994934Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1408.6127","last_updated":"2014-08-26T14:33:53Z","snapshot_observed_at":"2026-07-06T03:52:39.942354Z","submitted_at":"2014-08-26T14:33:53Z","title":"A Complete framework for ambush avoidance in realistic environments","version":1},"cited_work":{"arxiv_id":"1408.6127","doi":null,"metadata_source":"pith","pith_arxiv_id":"1408.6127","snapshot_observed_at":"2026-08-05T20:46:16.507067Z","title":"A Complete framework for ambush avoidance in realistic environments","venue":"cs.AI","work_id":"947f2b87-8d9f-4ae1-bfef-54ad3f261299","year":2014},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.248266Z"},"links":{"cited_paper":"/paper/1408.6127","citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:4fd9644247b816d8a87cd2db04634243bcac797d6e8d3945d885bd38f9cf3100","observation_id":"dab33154-e8b0-488a-ae04-0d45227ae1e1","resolution":{"observed_at":"2026-08-05T20:46:16.512417Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T20:46:16.982461Z","title":"American Mathematical Soc","venue":null,"work_id":"23c68be4-7d02-4462-90b3-08f500f5fa03","year":2011},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.252142Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:201643ddc553c2afda2537cb0f86ef8ec85dbd48f8fdfbf8469e0e88d194fc5a","observation_id":"60095342-8ffc-45e9-a8c9-75f7d07acf5f","resolution":{"observed_at":"2026-08-05T20:46:16.985479Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T20:46:16.972893Z","title":"IEEE Transactions on Robotics24(6), 1429–1439 (2008)","venue":null,"work_id":"c4137c57-fc67-47b6-84ef-0ebc60861335","year":2008},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.255531Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:68841a79cacdc90ac01d1c7e0beeb33b39e5c2eae50ccf2c1b6ae723823a3563","observation_id":"d7610a6e-85f7-487f-9f95-8406d02caca6","resolution":{"observed_at":"2026-08-05T20:46:16.976075Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T20:46:16.962969Z","title":"In: International Conference on Decision and Game Theory for Security","venue":null,"work_id":"19a53ff5-7bbc-44e0-aabe-06875972b31b","year":2024},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.259624Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:3b0c8216a2b89b685305f0e0177d15c386338e3c1d92e8c9736b95e1195c001c","observation_id":"381ded2e-f1ff-4bbf-af4d-da8448e164f2","resolution":{"observed_at":"2026-08-05T20:46:16.966482Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T20:46:16.953471Z","title":"In: Proceedings of the Thirty-third International Joint Conference on Artificial Intel- ligence, IJCAI-24","venue":null,"work_id":"5665b9fb-5913-4711-9bd0-588a01c41b08","year":2024},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.263332Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:264d8cdc089142390aa2016fe71f3131b5bcfc136c194c46ae555f3f65413615","observation_id":"3cb3bf57-24c5-4314-a091-7671fd6a3667","resolution":{"observed_at":"2026-08-05T20:46:16.956837Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T20:46:16.943212Z","title":"Mathematical programming73(2), 129–174 (1996)","venue":null,"work_id":"a79d7ed0-b065-41c6-ac10-e732bca840db","year":1996},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.271878Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:fac8f637050cf9ef824d7fac7607e2331e6a7551f561492283f3a9b1d2b78c77","observation_id":"68ab9ca5-b966-421f-9121-fe0a55fc676a","resolution":{"observed_at":"2026-08-05T20:46:16.946885Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T20:46:16.276106Z","title":"Annals of the Association of American Geographers94(3), 491–502 (2004)","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.276106Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:fcbc5e6d2f8731a2a1b9ebe0acd8eb41a1e667dc5cb28c7305e2e5b197b3441e","observation_id":"9e2613ac-df4b-4b8a-b842-7cf210f53018","resolution":{"observed_at":"2026-08-05T20:46:16.276106Z","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-05T20:46:16.927785Z","title":"Annals of the Association of American Geographers100(3), 600–620 (2010)","venue":null,"work_id":"aaaab874-4934-448f-a7ad-c81c7f777209","year":2010},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.279563Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:fa254e9ed124b3bda768f942aa7c70ceb081704f019b54543e83877efe2dc2d3","observation_id":"ba301f8b-db25-4650-bb48-ef31ab1c040e","resolution":{"observed_at":"2026-08-05T20:46:16.930900Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T20:46:16.918482Z","title":"Springer Science & Business Media (2005)","venue":null,"work_id":"2bffb108-db9e-403c-8046-9e193b89eee6","year":2005},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.282748Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:de366d97530ab4238ff7fab339151bd6a98f4fc4e8891acd249527e7ae567645","observation_id":"60627caa-a3b7-4305-b7b3-10163b3ad58f","resolution":{"observed_at":"2026-08-05T20:46:16.921623Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T20:46:16.909259Z","title":"In: Algorithmics of large and complex networks: design, analysis, and simulation, pp","venue":null,"work_id":"9aca87a8-5c61-4fca-8bf5-16d721b1dc33","year":2009},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.286029Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:aaffd02c1758a1e0835756e3a3285bc5d5438078aca596bba54e37bd8df705b8","observation_id":"6d4e0cae-b5cb-4cab-bbd4-9c611a9b24d4","resolution":{"observed_at":"2026-08-05T20:46:16.912575Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T20:46:16.289018Z","title":"In: Edsger Wybe Dijkstra: his life, work, and legacy, pp","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.289018Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:4fcd5bc50c1cee4359b324d2b22f6f48ba2c23f7320df01e8ac9ab8e524bf41d","observation_id":"c0f8b225-672b-42da-b631-a463b769b5ee","resolution":{"observed_at":"2026-08-05T20:46:16.289018Z","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-05T20:46:16.894278Z","title":"Courier Corporation (2013)","venue":null,"work_id":"1f510e5d-ad20-4b2e-9e8f-33f894b46a35","year":2013},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.293472Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:60d683aeb56a248da4b0b336b4918b663626c86ade92c671a526c3e93dd36b7e","observation_id":"faf73268-47f8-4418-a09f-a18a80eca331","resolution":{"observed_at":"2026-08-05T20:46:16.897174Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T20:46:16.296753Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.296753Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:3423ba17f3980407a8ba5e9830463fef18417d3c9f30ed33cc8d48343ee91143","observation_id":"fe621c9f-7ac5-4571-ab48-916ebc69e154","resolution":{"observed_at":"2026-08-05T20:46:16.296753Z","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-05T20:46:16.879760Z","title":"John Wiley & Sons (2004)","venue":null,"work_id":"5b4b6b48-50e6-4445-8da0-b493c91a36f7","year":2004},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.299884Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:b323d09f203dd5d38930787d99280830b946ea982cadc56339ceddabdf39299a","observation_id":"35224330-30ec-4c54-b335-5cfb5ba7934f","resolution":{"observed_at":"2026-08-05T20:46:16.882607Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T20:46:16.870692Z","title":"In: SODA","venue":null,"work_id":"7e686cdf-abf0-4fd7-a06d-d1f5c45ad4cb","year":2005},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.303048Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:d347b3b99d72fd757617561e1b829787d0f6675f4885105021b5324b8e900f82","observation_id":"20a8af2c-168a-4faf-bb0b-16517c58b832","resolution":{"observed_at":"2026-08-05T20:46:16.873659Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T20:46:16.860745Z","title":"Naval Research Logistics (NRL)64(2), 139–153 (2017) 20 J","venue":null,"work_id":"535f9fa6-fce7-4078-8a89-4c266cbdb159","year":2017},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.306162Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:5f5acbac6da191b6fb1953f7ff83927f6a2776551fa35b4d8d2dd097a4dc0d12","observation_id":"9d172fde-dfa1-40dc-8d82-1d919b04eae3","resolution":{"observed_at":"2026-08-05T20:46:16.863655Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T20:46:16.850756Z","title":"IEEE transactions on Systems Science and Cybernet- ics 4(2), 100–107 (1968)","venue":null,"work_id":"b8d79be3-f9cc-42ed-adb3-dd9f7aa93ef8","year":1968},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.309508Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:84f0bca08e7824a562851f5d242aec8f9343cbb1124c7c64d4ed1baf75f3bbd7","observation_id":"4e049f97-f112-40aa-a161-5665bd0fb312","resolution":{"observed_at":"2026-08-05T20:46:16.853953Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T20:46:16.840841Z","title":"Handbook of military industrial engineering (2009)","venue":null,"work_id":"339015f8-edc1-41fb-baf3-61e6f431a1ed","year":2009},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.312767Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:0f78a6e5ff43404c0f28b66e2bfdf1c0439e126fb7756093797770ffb59c7121","observation_id":"8173f800-a51c-4a05-a91f-e364bdd29350","resolution":{"observed_at":"2026-08-05T20:46:16.844053Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T20:46:16.830139Z","title":"Mathemat- ical Programming Computation10(1), 119–142 (2018)","venue":null,"work_id":"54dfa2ed-9605-483d-b63d-bf56841529ec","year":2018},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.316892Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:32c1c41cb8784c09f42a823929c187096cd591fe87c4bed99ea0d138105f8d02","observation_id":"4d7927df-7394-41e8-b988-d14e153e13f0","resolution":{"observed_at":"2026-08-05T20:46:16.833296Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T20:46:16.820969Z","title":"com/article/bombing-burmas-bridges/, accessed: 2025-06-05","venue":null,"work_id":"9be46fe9-99cf-4aad-9055-87f6fe257a19","year":2021},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.321306Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:732c949cd6e7d99a829683a244268052d4e3219c9a14d7e19eb2eb7173b0e5c6","observation_id":"2d584048-4013-4be3-b728-bfbed59b69f1","resolution":{"observed_at":"2026-08-05T20:46:16.824274Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T20:46:16.812043Z","title":"Courier Corporation (1999)","venue":null,"work_id":"89ea5e80-8f6d-40a7-8915-269903e5116b","year":1999},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.325308Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:091875d6625f7c932f8a7278a8c3476efa42d230c88e3e3d2b3cbbacdc3c0a30","observation_id":"40a5a1bd-bb99-408f-a095-9e0b2d4aef2e","resolution":{"observed_at":"2026-08-05T20:46:16.815076Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T20:46:16.803058Z","title":"Networks: An Inter- national Journal 40(2), 97–111 (2002)","venue":null,"work_id":"5302472c-594d-4dda-a274-a24757c3a442","year":2002},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.328795Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:d995e92d56b2ac4aaa2df77a42a1bf19c9e1482128fa6ed42b719b12f19827c6","observation_id":"f545eef7-b7fb-40f0-8efc-1aca01ac4d54","resolution":{"observed_at":"2026-08-05T20:46:16.806190Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T20:46:16.793876Z","title":"In: Moving Target Defense II: Application of Game Theory and Adversarial Modeling","venue":null,"work_id":"f862974f-d4f3-42f8-8ebf-257dfdbba4ae","year":2013},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.332194Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:d1eb60ce316de58e3e85f669e66b8ff44bd049de31f92b7b5b4b78ce8c8812a9","observation_id":"d247b9b7-2486-43e4-a534-32d4410a8cd0","resolution":{"observed_at":"2026-08-05T20:46:16.797048Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T20:46:16.783356Z","title":"In: The 10th In- ternational Conference on Autonomous Agents and Multiagent Systems-Volume 1","venue":null,"work_id":"057e9285-6a5d-4106-a5d9-edbeff94becd","year":2011},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.335414Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:93bd5f8cb163e84ef6b9cd2e8fa92fa88d99857163b7fe385aea95fd467bd339","observation_id":"db80b95f-30a2-4bb5-bc1e-4fe2b368d6c9","resolution":{"observed_at":"2026-08-05T20:46:16.786969Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T20:46:16.773405Z","title":"In: Proceedings of the AAAI Conference on Artificial Intelligence","venue":null,"work_id":"8cac34de-effb-4f3b-a63a-f1a8ae03d51a","year":2010},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.339023Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:2cc29a348dc378204a37202b1943d885a992885783c0ab4676281fcd2b9a32e1","observation_id":"903e417b-e88c-49c1-938f-04b1b283fd89","resolution":{"observed_at":"2026-08-05T20:46:16.776528Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.14547","last_updated":"2025-05-27T22:43:54Z","snapshot_observed_at":"2026-08-08T18:53:39.376740Z","submitted_at":"2025-05-20T16:03:24Z","title":"GUARD: Constructing Realistic Two-Player Matrix and Security Games for Benchmarking Game-Theoretic Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.14547","snapshot_observed_at":"2026-08-05T20:46:16.342179Z","title":"arXiv preprint arXiv:2505.14547 (2025)","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.342179Z"},"links":{"cited_paper":"/paper/2505.14547","citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:b19129bd1da9ba6192046889507d015da2092830a0dd4d961205d1bcc48c5a96","observation_id":"9a16dd1c-3713-4ffb-9f8f-67f72f2cd74c","resolution":{"observed_at":"2026-08-05T20:46:16.342179Z","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-05T20:46:16.762550Z","title":"Journal of the Operational Research Society 63(9), 1294–1306 (2012)","venue":null,"work_id":"a2562a36-9622-4f36-838b-0e857a471691","year":2012},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.345729Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:aecc1e4cbdde0f476ad9f79524d4a443b007ecd93c5166c0a1377230bbd5b829","observation_id":"ef06a7d9-bd7a-408a-8ad5-a897702e34bb","resolution":{"observed_at":"2026-08-05T20:46:16.766188Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T20:46:16.752069Z","title":"In: MATEC web of conferences","venue":null,"work_id":"171d0dd4-f68a-4b05-9bc7-deb6a1201b73","year":2021},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.350168Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:7e4f4be5d321ae4aada2682e443fec9e56132db2756290dfeb1050c87bbfe810","observation_id":"1e594748-038f-4711-a890-7e2a08d83be6","resolution":{"observed_at":"2026-08-05T20:46:16.755044Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T20:46:16.742606Z","title":"John Wiley & Sons, Inc","venue":null,"work_id":"0222a133-6486-45b7-83ab-a53b1118580a","year":1990},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.353521Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:2304114d52c12c68ddb400bc84058bfea9a11ae539064287b52c70ecc1e22e91","observation_id":"514f9481-bd70-405d-9d2b-1fd124308450","resolution":{"observed_at":"2026-08-05T20:46:16.745428Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T20:46:16.733076Z","title":null,"venue":null,"work_id":"a4cdb62a-4bf1-4c24-824a-f0c4427f88f3","year":2017},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.356749Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:8c3521d86aa5abd10cb12879195aa518803edbe8d6d90fd4f96fac77d8c97604","observation_id":"52b51394-8f27-4153-b08b-8743fd8c94b2","resolution":{"observed_at":"2026-08-05T20:46:16.736201Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T20:46:16.723967Z","title":"Neumann, J.: Zur theorie der gesellschaftsspiele","venue":null,"work_id":"788b786e-71f4-404a-a57f-cfafe05293f1","year":1928},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.359865Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:21ae624ed00b4b66aaa03dd6ca4c36c74f6be21e3e8b4c223387947372e57efc","observation_id":"0669990e-0be5-4d76-a9d3-3e3d8c14416a","resolution":{"observed_at":"2026-08-05T20:46:16.726944Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T20:46:16.714362Z","title":"In: Risk and optimization in an uncertain world, pp","venue":null,"work_id":"a0721b11-3295-4060-bf4a-de465df50cdc","year":2010},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.363048Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:0c53ac71abcfce765078a2cfaa1fbdf91045aa15a737043c7cae6dbcfe778494","observation_id":"5dfc6051-e0fa-4912-9f6d-ec9ea1a1f420","resolution":{"observed_at":"2026-08-05T20:46:16.717723Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T20:46:16.366757Z","title":"In: Theory and Applications of Graphs: Proceedings, Michigan May 11–15, 1976, pp","venue":null,"work_id":null,"year":1976},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.366757Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:7a96c508f69ba433b294d302ae3f0baea17f77743b8970dd7d36125028fdc994","observation_id":"a13c318f-6c96-4152-ae12-a3d9d893145f","resolution":{"observed_at":"2026-08-05T20:46:16.366757Z","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-05T20:46:16.695948Z","title":"The faculty of ILiM, Poznań (1998)","venue":null,"work_id":"a568c4ad-86c4-4c00-9212-3d5270b5a2f1","year":1998},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.373327Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:113979bd3e08565c302304b51b704bb560243f0a3259109715a729e45829b7ab","observation_id":"baac3823-eec5-4f66-84a0-05173f7c2af2","resolution":{"observed_at":"2026-08-05T20:46:16.699349Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T20:46:16.686271Z","title":"Operations Re- search 45(5), 758–767 (1997)","venue":null,"work_id":"b0fbe3a1-d4ec-4361-ab4b-ae9cb59ccfe4","year":1997},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.383973Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:21b18096f2c72800aa8a263bf71ceb393f063e1d4920ec1e9aafa3a795ac008d","observation_id":"4b945dd1-dfaa-4c22-a591-65f2fe21c305","resolution":{"observed_at":"2026-08-05T20:46:16.689283Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T20:46:16.676771Z","title":"Discrete Applied Mathematics 89(1-3), 197–212 (1998)","venue":null,"work_id":"9884d43e-30a5-4458-a7e6-a1e1cd8b18d6","year":1998},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.393430Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:81004aba21d019561a335985f98e65c326060d1034cad796113efca3be0dd627","observation_id":"aecbd114-9924-4d15-a051-bfa1c9ca763e","resolution":{"observed_at":"2026-08-05T20:46:16.679527Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T20:46:16.668397Z","title":"In: AAAI","venue":null,"work_id":"2facc531-7510-41c8-933d-9d6c53123123","year":2008},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.403629Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:45dbdd8a73abf27ba36fe43bb2f8e1f237f7c0cd20d44d0b06cbcb4d2af49494","observation_id":"2d05da8c-4ee2-43be-bac3-7bd157455a51","resolution":{"observed_at":"2026-08-05T20:46:16.671200Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T20:46:16.659780Z","title":"Operations Research24(2), 314–324 (1976)","venue":null,"work_id":"cf43a542-ea39-47d9-92b9-b9e60ec28751","year":1976},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.415159Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:aefddd3edc661d1f6ff1d56051f904e44233b19382da7156a0a8b67a85ec81d2","observation_id":"180a367a-be20-43fe-8adc-d91edd3dada1","resolution":{"observed_at":"2026-08-05T20:46:16.662915Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T20:46:16.649353Z","title":"International transactions in operational research 27(2), 835–866 (2020)","venue":null,"work_id":"3a8559af-096c-4dbc-afe0-da3504b9aaef","year":2020},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.423681Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:89ae1c175891401d63e5f3fd45fca363dccafd3c8e0b90cc1ffb58e481e92301","observation_id":"dd150eb8-80a2-43c6-af9c-d3a2e3da7f1d","resolution":{"observed_at":"2026-08-05T20:46:16.652504Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T20:46:16.640164Z","title":"Journal of Transportation Security3, 41–55 (2010)","venue":null,"work_id":"3a57c7f2-5af9-4ba1-8816-8c99ed32e0ba","year":2010},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.431843Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:8b0adcdaaf59d4c2d56052ac43bcd8b58c8183a4995eef5a8cf1fc0030b5047c","observation_id":"eb92c29b-52bd-4494-9b95-f26874b32bee","resolution":{"observed_at":"2026-08-05T20:46:16.643274Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T20:46:16.629489Z","title":"Military Operations Research pp","venue":null,"work_id":"64fe8e4f-aff5-4631-9d45-bb1e9a7f3d42","year":2009},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.434611Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:d8378e421bfed34c0d24fdf38bac53fb6205e7adced8c7ab87efd20a45565376","observation_id":"d8f2c39e-bb32-4999-bd79-b26c5343e8b1","resolution":{"observed_at":"2026-08-05T20:46:16.633040Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T20:46:16.619023Z","title":"John Wiley & Sons (1998)","venue":null,"work_id":"6967debf-da70-4514-97e2-6a35dafa4739","year":1998},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.437420Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:76262cef2d524723dcdfc2a104aa48fdca55c87aead16dd7390467d5ca40ebfa","observation_id":"46bc6bac-d6c6-4d98-848c-6bd68d58b283","resolution":{"observed_at":"2026-08-05T20:46:16.622439Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T20:46:16.607902Z","title":"In: Proceedings of the 11th international conference on autonomous agents and multiagent systems-volume 1","venue":null,"work_id":"766a12ea-0ed4-4452-bc59-0af6792738e3","year":2012},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.440208Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:f9a5a1fbee20756bc4ba16d72f953ed6717f653d396f7abb2d641b38bcb1f890","observation_id":"3a33f095-f760-4f2b-870b-033e63221217","resolution":{"observed_at":"2026-08-05T20:46:16.611389Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T20:46:16.597360Z","title":"Pareto optimality, game theory and equilibria pp","venue":null,"work_id":"91a2805e-09c7-42fa-9c7b-aa2e0a77b204","year":2008},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.443383Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:2bda991ec6110f84409cb3b3ef4232c25c20c4cadba60eac1a519b7f6fb03b69","observation_id":"f46a17b2-a6de-4607-8525-ef1ef686fff2","resolution":{"observed_at":"2026-08-05T20:46:16.600430Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T20:46:16.587937Z","title":"European Journal of Operational Research283(3), 797–811 (2020)","venue":null,"work_id":"6abfd3f8-6cb4-45c0-bc25-b4b51567518d","year":2020},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.446159Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:ded3161b104498599bbc905bd2b28cde3f2706ed624de24de924ad520b99a9ec","observation_id":"0758e472-b5c2-4716-a4ac-d567959adae2","resolution":{"observed_at":"2026-08-05T20:46:16.591085Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T20:46:16.578639Z","title":"Iie Transactions 40(5), 509–523 (2008)","venue":null,"work_id":"4bc69e68-3f83-4c9f-b09b-f6ffb7bb8158","year":2008},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.449113Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:96f73c6d8981c2dbe1110fe2daaec183a44615834659a5fabd5c0b16eb82fb2a","observation_id":"ebf5f7d5-cdaf-465e-bbe4-561f86eaedff","resolution":{"observed_at":"2026-08-05T20:46:16.581810Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T20:46:16.569289Z","title":"Operations research 43(2), 243–251 (1995)","venue":null,"work_id":"9d73cdad-5da3-48d4-8c79-ecaa1663cdb1","year":1995},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.451989Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:6a3f78d83b2e3c4ea8319e98ef7ad83b5220882391ab3cb75d0162194e969d15","observation_id":"494f2945-ef67-4aed-ac3d-a31436a3520d","resolution":{"observed_at":"2026-08-05T20:46:16.572538Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T20:46:16.559497Z","title":"In: 2020 American Control Conference (ACC)","venue":null,"work_id":"5ea4c0da-1f53-490f-a540-12c5700a9ec0","year":2020},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.454867Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:31f538aa05aaff309946504892dd6a28aab84a28c328abce0aba21205f593900","observation_id":"f139bfb4-e871-4a25-a260-141fbd82b7ce","resolution":{"observed_at":"2026-08-05T20:46:16.563063Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T20:46:16.457503Z","title":"Operations Research12(6), 934–940 (1964)","venue":null,"work_id":null,"year":1964},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.457503Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:6ed7c2b031f40215c79920b13b80ae55d13ea34dfcbfc4aa025f2ae52e7c35fb","observation_id":"083cdf4f-9a15-4872-b677-eeba0085b543","resolution":{"observed_at":"2026-08-05T20:46:16.457503Z","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-05T20:46:16.540108Z","title":"In: Proceedings of the 2016 ACM Conference on Eco- nomics and Computation","venue":null,"work_id":"a319ce06-00fd-407f-adad-be9212a58f30","year":2016},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.460579Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:c5665cd65ae4bdb8242f4216466e992150ccf77d5145ca85e1cd9b5c01522b1a","observation_id":"868b8e2c-6c22-4afc-a7b2-139443550298","resolution":{"observed_at":"2026-08-05T20:46:16.543347Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T20:46:16.530286Z","title":"https://github.com/radualexandrub/knapsack-library (2020), ac- cessed: 2025-06-09","venue":null,"work_id":"4eb14984-97a2-49d7-9a66-34423d33931b","year":2020},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.463325Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:efa33f14cc9f6c66ad3df6e2fb45629ba92ab4617bc9902b7fc9b6bc4b1fc8f3","observation_id":"893564e1-15bd-4b64-b46e-3d89f881aacd","resolution":{"observed_at":"2026-08-05T20:46:16.533724Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T20:46:16.519652Z","title":null,"venue":null,"work_id":"278ceb83-8459-400d-81a7-365af1d98990","year":2017},"citing_paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-05T20:46:16.466252Z"},"links":{"citing_paper":"/paper/2508.10189"},"observation_digest":"sha256:d83c7dcb7b425786a523d3c6029a0a0a187b46cb905774c8a1562356e0801279","observation_id":"d2db75ec-7b20-4c6e-9969-614008224373","resolution":{"observed_at":"2026-08-05T20:46:16.523052Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2508.10189","last_updated":"2025-08-13T20:54:07Z","latest_version":1,"primary_category":"cs.GT","snapshot_observed_at":"2026-08-08T18:54:15.259443Z","submitted_at":"2025-08-13T20:54:07Z","title":"Contested Route Planning"},"reference_resolution":{"displayed":61,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":9,"verified_exact":0,"verified_fuzzy":51},"total_outbound_references":61},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 61 of 61 outbound references and 0 inbound Pith citation observations for arXiv:2508.10189."}