{"as_of":"2026-08-06T13:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d4e5497dc075ada8eada093e123bda466fe99b75561be7c60522f05b1e66a7ea","coverage":[{"denominator":29,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":29,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-19T19:35:09.412620Z","state":"measured"},{"denominator":29,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":29,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+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.15745/citation-record","integrity":"/paper/2605.15745/integrity","json":"/paper/2605.15745/citation-record.json","paper":"/paper/2605.15745"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Optimal matchings of random points.Combi- natorica, 4(4):259–264","venue":null,"work_id":"89ff4134-811c-45dc-9114-4013051ed5d8","year":1984},"citing_paper":{"arxiv_id":"2605.15745","last_updated":"2026-05-15T08:54:32Z","snapshot_observed_at":"2026-07-06T23:27:01.213106Z","submitted_at":"2026-05-15T08:54:32Z","title":"The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-19T19:35:09.412620Z"},"links":{"citing_paper":"/paper/2605.15745"},"observation_digest":"sha256:ad992e99e745b28c62bff02b2864818e73422f2f58603a300fe47421133f44ee","observation_id":"dd6b7757-39a1-48fd-89fd-0e808868c5c6","resolution":{"observed_at":"2026-05-19T19:37:44.336838Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment.Proceedings of the National Academy of Sciences, 114(3):462–467","venue":null,"work_id":"fdd137b1-6496-40d4-adc4-61ed705ba36e","year":2017},"citing_paper":{"arxiv_id":"2605.15745","last_updated":"2026-05-15T08:54:32Z","snapshot_observed_at":"2026-07-06T23:27:01.213106Z","submitted_at":"2026-05-15T08:54:32Z","title":"The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-19T19:35:09.412620Z"},"links":{"citing_paper":"/paper/2605.15745"},"observation_digest":"sha256:4911efe91dad59c50f0f26527522e10df83b84ca5912b9faaf3b9fa625060916","observation_id":"c2c0ae9f-8ae6-40b7-9b6e-69a5be971c29","resolution":{"observed_at":"2026-05-19T19:37:44.334918Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Bertsimas.Probabilistic combinatorial optimization problems","venue":null,"work_id":"1095217e-12ad-4792-a080-33f2c4d56525","year":1988},"citing_paper":{"arxiv_id":"2605.15745","last_updated":"2026-05-15T08:54:32Z","snapshot_observed_at":"2026-07-06T23:27:01.213106Z","submitted_at":"2026-05-15T08:54:32Z","title":"The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-19T19:35:09.412620Z"},"links":{"citing_paper":"/paper/2605.15745"},"observation_digest":"sha256:9c62406726273cc038f1c5ba2cf2f546e8f7de04aed77af6847c6b9d86842e2b","observation_id":"93287e19-322f-46de-a824-c35b3537f1b5","resolution":{"observed_at":"2026-05-19T19:37:44.329039Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Bertsimas, Patrick Jaillet, and Amedeo R","venue":null,"work_id":"f7c63399-415d-4d2f-82b9-24dc2d181f99","year":1990},"citing_paper":{"arxiv_id":"2605.15745","last_updated":"2026-05-15T08:54:32Z","snapshot_observed_at":"2026-07-06T23:27:01.213106Z","submitted_at":"2026-05-15T08:54:32Z","title":"The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-19T19:35:09.412620Z"},"links":{"citing_paper":"/paper/2605.15745"},"observation_digest":"sha256:a03c8f27d23617fb2405a053a192145f6acb4129b10023a3e9d4f04dc270a721","observation_id":"cd8a7b66-b137-4476-aa1e-0bc64baad9be","resolution":{"observed_at":"2026-05-19T19:37:44.378244Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Empty-car routing in ridesharing systems.Operations Research, 67(5):1437–1452","venue":null,"work_id":"5c0f40f6-5653-43d8-8a1a-d02508e0202b","year":2019},"citing_paper":{"arxiv_id":"2605.15745","last_updated":"2026-05-15T08:54:32Z","snapshot_observed_at":"2026-07-06T23:27:01.213106Z","submitted_at":"2026-05-15T08:54:32Z","title":"The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-19T19:35:09.412620Z"},"links":{"citing_paper":"/paper/2605.15745"},"observation_digest":"sha256:97fb058567f63f570e85f27f2bcab2bac91f97e4062bc75bcc374a5fb7e1af31","observation_id":"769c528b-b6b8-4015-bc27-76e492378693","resolution":{"observed_at":"2026-05-19T19:37:44.376389Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Bi-factor approxi- mation algorithms for hard capacitatedk-median problems","venue":null,"work_id":"e74b2dd0-22f4-4ca1-9d31-a61868f50452","year":2015},"citing_paper":{"arxiv_id":"2605.15745","last_updated":"2026-05-15T08:54:32Z","snapshot_observed_at":"2026-07-06T23:27:01.213106Z","submitted_at":"2026-05-15T08:54:32Z","title":"The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-19T19:35:09.412620Z"},"links":{"citing_paper":"/paper/2605.15745"},"observation_digest":"sha256:4f3df7f6a58849c60744a5b0fbe9a2f534c4ec6ff25218cfab381fd8c6f86e56","observation_id":"8580338f-7f27-4ce2-a7f2-d5af9aaa900f","resolution":{"observed_at":"2026-05-19T19:37:44.374441Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"85c7cefa-55f6-493b-bc8a-2f98358026cb","year":2002},"citing_paper":{"arxiv_id":"2605.15745","last_updated":"2026-05-15T08:54:32Z","snapshot_observed_at":"2026-07-06T23:27:01.213106Z","submitted_at":"2026-05-15T08:54:32Z","title":"The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-19T19:35:09.412620Z"},"links":{"citing_paper":"/paper/2605.15745"},"observation_digest":"sha256:d9c59f4eb52f86608ff7db79f5145b0ccee392294bbe8252a9c6b4629f4bf780","observation_id":"39adab1d-8522-4265-be17-e66fba448e88","resolution":{"observed_at":"2026-05-19T19:37:44.372556Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Approximating k-median with non-uniform capacities","venue":null,"work_id":"8738aae7-97ad-4130-be99-fd1f4238a472","year":2005},"citing_paper":{"arxiv_id":"2605.15745","last_updated":"2026-05-15T08:54:32Z","snapshot_observed_at":"2026-07-06T23:27:01.213106Z","submitted_at":"2026-05-15T08:54:32Z","title":"The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-19T19:35:09.412620Z"},"links":{"citing_paper":"/paper/2605.15745"},"observation_digest":"sha256:8c3fae220f55e418eca3e371f7744e5d7fcfac40f725a2a27fec8beee80cd8cd","observation_id":"4702d15a-5213-4502-9429-87e4416489ca","resolution":{"observed_at":"2026-05-19T19:37:44.370669Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"A (2+ϵ)-approximation algorithm for metric k-median","venue":null,"work_id":"e4058a04-9340-470c-97a3-452ef2deef1e","year":2025},"citing_paper":{"arxiv_id":"2605.15745","last_updated":"2026-05-15T08:54:32Z","snapshot_observed_at":"2026-07-06T23:27:01.213106Z","submitted_at":"2026-05-15T08:54:32Z","title":"The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-19T19:35:09.412620Z"},"links":{"citing_paper":"/paper/2605.15745"},"observation_digest":"sha256:c73b42e98971550119e4cfeb6c95db03a0e9813775ee7230c9a0e6051f5d4953","observation_id":"5e7a55a8-0682-4150-a059-b7e48853c559","resolution":{"observed_at":"2026-05-19T19:37:44.368872Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"On the fixed-parameter tractability of capacitated clus- tering","venue":null,"work_id":"2bae418c-0518-4324-937c-b93f673ad046","year":2019},"citing_paper":{"arxiv_id":"2605.15745","last_updated":"2026-05-15T08:54:32Z","snapshot_observed_at":"2026-07-06T23:27:01.213106Z","submitted_at":"2026-05-15T08:54:32Z","title":"The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-19T19:35:09.412620Z"},"links":{"citing_paper":"/paper/2605.15745"},"observation_digest":"sha256:7234b1932cce545a3a2547a51c62411e066673f25dc79498808c4f46feb8a5cf","observation_id":"8f0ab4a4-c11b-4096-a163-a53feac4998e","resolution":{"observed_at":"2026-05-19T19:37:44.365114Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"A threshold oflnn for approximating set cover.Journal of the ACM, 45(4):634–652","venue":null,"work_id":"c072bfe0-5321-4177-8b9b-f4ca747889b9","year":1998},"citing_paper":{"arxiv_id":"2605.15745","last_updated":"2026-05-15T08:54:32Z","snapshot_observed_at":"2026-07-06T23:27:01.213106Z","submitted_at":"2026-05-15T08:54:32Z","title":"The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-19T19:35:09.412620Z"},"links":{"citing_paper":"/paper/2605.15745"},"observation_digest":"sha256:4e35584387c6b5b5f61e82f50aab29e7c3ff7365f096d8a8b2e5719d9b21a078","observation_id":"463dda5b-484c-4883-87fe-968fae31bd6a","resolution":{"observed_at":"2026-05-19T19:37:44.366975Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Alaya, Aur´elie Boisbunon, Stanislas Chambon, Laetitia Chapel, Adrien Corenflos, Kilian Fatras, Nemo Fournier, L ´eo Gautheron, Nathalie T.H","venue":null,"work_id":"5fa355d2-75ff-4f69-a59a-14621ec408fc","year":2021},"citing_paper":{"arxiv_id":"2605.15745","last_updated":"2026-05-15T08:54:32Z","snapshot_observed_at":"2026-07-06T23:27:01.213106Z","submitted_at":"2026-05-15T08:54:32Z","title":"The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-19T19:35:09.412620Z"},"links":{"citing_paper":"/paper/2605.15745"},"observation_digest":"sha256:102207f1da69108b81ccd9f33bb5c3dadb82aeccfd466b6fab476afb869b781c","observation_id":"877638df-ab0e-4b59-a105-fcfcaa185b94","resolution":{"observed_at":"2026-05-19T19:37:44.363200Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"COIN-OR Branch and Cut (Cbc)","venue":null,"work_id":"af3fe767-259b-4319-b355-3a3e1254df9a","year":2020},"citing_paper":{"arxiv_id":"2605.15745","last_updated":"2026-05-15T08:54:32Z","snapshot_observed_at":"2026-07-06T23:27:01.213106Z","submitted_at":"2026-05-15T08:54:32Z","title":"The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-19T19:35:09.412620Z"},"links":{"citing_paper":"/paper/2605.15745"},"observation_digest":"sha256:a5f9eca91397e195090e1132ed70df299da9b67efd9cf001a5d6c00a45d282dd","observation_id":"cce2692c-ff37-4156-803a-537833e32e9d","resolution":{"observed_at":"2026-05-19T19:37:44.325010Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Openstreetmap: User-generated street maps.IEEE Pervasive Computing, 7(4):12–18","venue":null,"work_id":"5cf638d5-0825-4fc7-ad11-fcd6db88685e","year":2008},"citing_paper":{"arxiv_id":"2605.15745","last_updated":"2026-05-15T08:54:32Z","snapshot_observed_at":"2026-07-06T23:27:01.213106Z","submitted_at":"2026-05-15T08:54:32Z","title":"The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-19T19:35:09.412620Z"},"links":{"citing_paper":"/paper/2605.15745"},"observation_digest":"sha256:6efd3ac4eaa4d80a2778818c36fadd0e241e58270f51c64f09016bb723698668","observation_id":"4fc84740-210e-449b-8aa5-1c8d8a8d4e4f","resolution":{"observed_at":"2026-05-19T19:37:44.361294Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Data-driven model predictive control of autonomous mobility-on-demand systems","venue":null,"work_id":"caf69462-85ee-4185-abc2-05db6fc51589","year":2018},"citing_paper":{"arxiv_id":"2605.15745","last_updated":"2026-05-15T08:54:32Z","snapshot_observed_at":"2026-07-06T23:27:01.213106Z","submitted_at":"2026-05-15T08:54:32Z","title":"The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-19T19:35:09.412620Z"},"links":{"citing_paper":"/paper/2605.15745"},"observation_digest":"sha256:4e33118724befcaf3714e7687c3dbb89274dd99f990f19a58053159dee561c34","observation_id":"e3720f01-ba6e-496a-8ee1-0df3216bdaea","resolution":{"observed_at":"2026-05-19T19:37:44.359474Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Korupolu, C.Greg Plaxton, and Rajmohan Rajaraman","venue":null,"work_id":"dd9e4823-f0ab-4488-88e1-de29628e9c20","year":2000},"citing_paper":{"arxiv_id":"2605.15745","last_updated":"2026-05-15T08:54:32Z","snapshot_observed_at":"2026-07-06T23:27:01.213106Z","submitted_at":"2026-05-15T08:54:32Z","title":"The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-19T19:35:09.412620Z"},"links":{"citing_paper":"/paper/2605.15745"},"observation_digest":"sha256:fb0c3963df00db57175705217719e9039387a1432fd897d117ef7d0d79a0e334","observation_id":"8b5f2f85-4028-49c5-adfb-7ccac82e8afc","resolution":{"observed_at":"2026-05-19T19:37:44.327176Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Tight bounds for minimax grid matching with applications to the average case analysis of algorithms.Combinatorica, 9(2):161–187","venue":null,"work_id":"d812aab2-6a88-46a1-83b9-9aca95a7586c","year":1989},"citing_paper":{"arxiv_id":"2605.15745","last_updated":"2026-05-15T08:54:32Z","snapshot_observed_at":"2026-07-06T23:27:01.213106Z","submitted_at":"2026-05-15T08:54:32Z","title":"The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-19T19:35:09.412620Z"},"links":{"citing_paper":"/paper/2605.15745"},"observation_digest":"sha256:ec3c2bf8bcd6c7c044bd04fe3fcbc8fde6b1f16b72a0f783b3f092db78789650","observation_id":"9583252a-49e3-4c76-a839-2cb353be44ea","resolution":{"observed_at":"2026-05-19T19:37:44.357657Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"On uniform capacitatedk-median beyond the natural LP relaxation.ACM Transactions on Algorithms, 13(2):22:1–22:18","venue":null,"work_id":"556e2efb-0aad-49d6-a86e-c62a3c729846","year":2017},"citing_paper":{"arxiv_id":"2605.15745","last_updated":"2026-05-15T08:54:32Z","snapshot_observed_at":"2026-07-06T23:27:01.213106Z","submitted_at":"2026-05-15T08:54:32Z","title":"The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-19T19:35:09.412620Z"},"links":{"citing_paper":"/paper/2605.15745"},"observation_digest":"sha256:d93fab0a13f8613e2daf5ede985b2fecf57ee28f76017c2fbfb0fa49dfd875d6","observation_id":"37617755-a395-43f1-9388-af2d2dfb10f9","resolution":{"observed_at":"2026-05-19T19:37:44.355775Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Efficient large-scale fleet management via multi-agent deep reinforcement learning","venue":null,"work_id":"df29256d-f0bf-41aa-a8cb-b8889054d1c5","year":2018},"citing_paper":{"arxiv_id":"2605.15745","last_updated":"2026-05-15T08:54:32Z","snapshot_observed_at":"2026-07-06T23:27:01.213106Z","submitted_at":"2026-05-15T08:54:32Z","title":"The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-19T19:35:09.412620Z"},"links":{"citing_paper":"/paper/2605.15745"},"observation_digest":"sha256:558fa7117073d231cc9f5f18816dcfb06ef095e92154d36e5a959694dddb6ec1","observation_id":"f45777c3-7252-4e6e-a44c-99f8a81f4d22","resolution":{"observed_at":"2026-05-19T19:37:44.353766Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Real-time routing with OpenStreetMap data","venue":null,"work_id":"c2087ff1-b767-44f3-8780-02b565dc7eec","year":2011},"citing_paper":{"arxiv_id":"2605.15745","last_updated":"2026-05-15T08:54:32Z","snapshot_observed_at":"2026-07-06T23:27:01.213106Z","submitted_at":"2026-05-15T08:54:32Z","title":"The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-19T19:35:09.412620Z"},"links":{"citing_paper":"/paper/2605.15745"},"observation_digest":"sha256:b0b2745bacf8ab4c471a37b1845eee8b4a218d090ca261e3fe3e1c0a24e3ffce","observation_id":"7d79e379-d04e-43ab-bb2b-3d451a945384","resolution":{"observed_at":"2026-05-19T19:37:44.351942Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"65005d17-b16b-4635-bb10-3b31401edd19","year":2016},"citing_paper":{"arxiv_id":"2605.15745","last_updated":"2026-05-15T08:54:32Z","snapshot_observed_at":"2026-07-06T23:27:01.213106Z","submitted_at":"2026-05-15T08:54:32Z","title":"The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-19T19:35:09.412620Z"},"links":{"citing_paper":"/paper/2605.15745"},"observation_digest":"sha256:c1a30e7c99666e09d2ee45833f19d5efb44aa624ff858e2a6b0812f8ac053c58","observation_id":"5745c6f1-4e8d-4df7-bfc8-01187bf4ed78","resolution":{"observed_at":"2026-05-19T19:37:44.350105Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"PuLP: A linear programming toolkit for Python","venue":null,"work_id":"ba8b4486-3542-4988-be6f-8a00009bd182","year":2011},"citing_paper":{"arxiv_id":"2605.15745","last_updated":"2026-05-15T08:54:32Z","snapshot_observed_at":"2026-07-06T23:27:01.213106Z","submitted_at":"2026-05-15T08:54:32Z","title":"The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-19T19:35:09.412620Z"},"links":{"citing_paper":"/paper/2605.15745"},"observation_digest":"sha256:b6b84027f1b1e348a967637b58c55555798564ed8c6d5168eaf4c4828f6e16e3","observation_id":"a417f5ec-0632-483d-a0d4-30616fe417be","resolution":{"observed_at":"2026-05-19T19:37:44.348443Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Smith, Emilio Frazzoli, and Daniela Rus","venue":null,"work_id":"b1dfc074-a884-4c63-b167-9e3993ed1365","year":2012},"citing_paper":{"arxiv_id":"2605.15745","last_updated":"2026-05-15T08:54:32Z","snapshot_observed_at":"2026-07-06T23:27:01.213106Z","submitted_at":"2026-05-15T08:54:32Z","title":"The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-19T19:35:09.412620Z"},"links":{"citing_paper":"/paper/2605.15745"},"observation_digest":"sha256:6c2d7f3e2b3e0bc7d176fc71095fab9b17fda2a49f533863f80f1c8c8b624cf7","observation_id":"2fdd1a39-a2f3-4984-8088-36d4a2e4ce2a","resolution":{"observed_at":"2026-05-19T19:37:44.346534Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Deep reinforcement learning for ride-sharing dispatching and repositioning","venue":null,"work_id":"8477a66b-44d6-4422-935f-e7e06c6df5a5","year":2019},"citing_paper":{"arxiv_id":"2605.15745","last_updated":"2026-05-15T08:54:32Z","snapshot_observed_at":"2026-07-06T23:27:01.213106Z","submitted_at":"2026-05-15T08:54:32Z","title":"The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-19T19:35:09.412620Z"},"links":{"citing_paper":"/paper/2605.15745"},"observation_digest":"sha256:635c1faba30b8fa9076a11958ad5cb4bcd240620e9739ff8db2f139611061f84","observation_id":"97863303-e987-4c22-841e-cc5c039cdda8","resolution":{"observed_at":"2026-05-19T19:37:44.331063Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Multicommodity facility location","venue":null,"work_id":"7a0f5f5f-33e9-45a3-9915-3b89b88c366d","year":2004},"citing_paper":{"arxiv_id":"2605.15745","last_updated":"2026-05-15T08:54:32Z","snapshot_observed_at":"2026-07-06T23:27:01.213106Z","submitted_at":"2026-05-15T08:54:32Z","title":"The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-19T19:35:09.412620Z"},"links":{"citing_paper":"/paper/2605.15745"},"observation_digest":"sha256:7d58a08cc5576bd3703c69d48c420d85f778edbe725f3544e1661b99e78a725a","observation_id":"b4873d2d-d555-430a-a17f-4c1f19ee065e","resolution":{"observed_at":"2026-05-19T19:37:44.344751Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"6d23ac1b-fe72-405b-af3e-5f4e89d44914","year":2000},"citing_paper":{"arxiv_id":"2605.15745","last_updated":"2026-05-15T08:54:32Z","snapshot_observed_at":"2026-07-06T23:27:01.213106Z","submitted_at":"2026-05-15T08:54:32Z","title":"The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-19T19:35:09.412620Z"},"links":{"citing_paper":"/paper/2605.15745"},"observation_digest":"sha256:305dac9628d54a66dc0e765445a415cd756d8f93b704b510fab3f0f659bbcd4a","observation_id":"c6e9d214-ebbc-4162-9935-4dd0d5c8d67a","resolution":{"observed_at":"2026-05-19T19:37:44.342921Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"X S∈K 1− |US| |U1| |L∩U1|# ≥E  k· 1− 1 k X S∈K |US| |U1| !|L∩U1|  =E","venue":null,"work_id":"80f3d972-14a3-41c7-b0a2-0af3737da9d0","year":2004},"citing_paper":{"arxiv_id":"2605.15745","last_updated":"2026-05-15T08:54:32Z","snapshot_observed_at":"2026-07-06T23:27:01.213106Z","submitted_at":"2026-05-15T08:54:32Z","title":"The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-19T19:35:09.412620Z"},"links":{"citing_paper":"/paper/2605.15745"},"observation_digest":"sha256:d743c95dc7501322d4e376e44b0c5defd0c1252b727ae46e6978b87277c1ccbc","observation_id":"139f631e-f547-4bb7-8b8e-a5f6fe787393","resolution":{"observed_at":"2026-05-19T19:37:44.340616Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"4869e542-ea67-40fe-9c75-2b4cfa5e0313","year":null},"citing_paper":{"arxiv_id":"2605.15745","last_updated":"2026-05-15T08:54:32Z","snapshot_observed_at":"2026-07-06T23:27:01.213106Z","submitted_at":"2026-05-15T08:54:32Z","title":"The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-19T19:35:09.412620Z"},"links":{"citing_paper":"/paper/2605.15745"},"observation_digest":"sha256:353544beeb6fe590647cb9a0329fd8769778636809ccb264c76a0584676b08c5","observation_id":"5af6864d-7bf1-46e1-9f9e-86255f1a8a19","resolution":{"observed_at":"2026-05-19T19:37:44.332927Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"The inequality here follows usingz 1 = 1 e −ε,z 2 = 1 e , andr= E[|L∩U1|] k","venue":null,"work_id":"cc3f707d-3471-433c-9e75-1da8c12ceab8","year":2023},"citing_paper":{"arxiv_id":"2605.15745","last_updated":"2026-05-15T08:54:32Z","snapshot_observed_at":"2026-07-06T23:27:01.213106Z","submitted_at":"2026-05-15T08:54:32Z","title":"The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-19T19:35:09.412620Z"},"links":{"citing_paper":"/paper/2605.15745"},"observation_digest":"sha256:0bcd69493d14737d257bcc3147dfde64bde5fed904ea7e9ab69a94afb20ade00","observation_id":"5de9dcd2-318d-472b-8bd5-813bae079e2b","resolution":{"observed_at":"2026-05-19T19:37:44.338793Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2605.15745","last_updated":"2026-05-15T08:54:32Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-07-06T23:27:01.213106Z","submitted_at":"2026-05-15T08:54:32Z","title":"The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand"},"reference_resolution":{"displayed":29,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":0,"verified_fuzzy":24},"total_outbound_references":29},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 29 of 29 outbound references and 0 inbound Pith citation observations for arXiv:2605.15745."}