Paper Citation Record · LEDGER

The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand

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.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2605.15745 v1

Coverage vector

measured 29 of 29 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-05-19T19:35:09.412620Z

measured 29 of 29 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-06T06:34:29.942622+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

29 of 29 outbound references displayed

verified exact0
verified fuzzy24
unresolved4
parse uncertain0
malformed identifier1
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation dd6b7757-39a1-48fd-89fd-0e808868c5c6 · outbound

This paper cites Optimal matchings of random points.Combi- natorica, 4(4):259–264.

The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand Optimal matchings of random points.Combi- natorica, 4(4):259–264

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T19:37:44.336838Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

Observation c2c0ae9f-8ae6-40b7-9b6e-69a5be971c29 · outbound

This paper cites On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment.Proceedings of the National Academy of Sciences, 114(3):462–467.

The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment.Proceedings of the National Academy of Sciences, 114(3):462–467

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T19:37:44.334918Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

Observation 93287e19-322f-46de-a824-c35b3537f1b5 · outbound

This paper cites Bertsimas.Probabilistic combinatorial optimization problems.

The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand Bertsimas.Probabilistic combinatorial optimization problems

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T19:37:44.329039Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

Observation cd8a7b66-b137-4476-aa1e-0bc64baad9be · outbound

This paper cites Bertsimas, Patrick Jaillet, and Amedeo R.

The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand Bertsimas, Patrick Jaillet, and Amedeo R

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T19:37:44.378244Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

Observation 769c528b-b6b8-4015-bc27-76e492378693 · outbound

This paper cites Empty-car routing in ridesharing systems.Operations Research, 67(5):1437–1452.

The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand Empty-car routing in ridesharing systems.Operations Research, 67(5):1437–1452

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T19:37:44.376389Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

Observation 8580338f-7f27-4ce2-a7f2-d5af9aaa900f · outbound

This paper cites Bi-factor approxi- mation algorithms for hard capacitatedk-median problems.

The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand Bi-factor approxi- mation algorithms for hard capacitatedk-median problems

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T19:37:44.374441Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

Observation 39adab1d-8522-4265-be17-e66fba448e88 · outbound

This paper cites an unresolved cited work.

The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand Unresolved cited work

Reference 7

Resolution: unresolved; raw_fallback, observed 2026-05-19T19:37:44.372556Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

Observation 4702d15a-5213-4502-9429-87e4416489ca · outbound

This paper cites Approximating k-median with non-uniform capacities.

The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand Approximating k-median with non-uniform capacities

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T19:37:44.370669Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

Observation 5e7a55a8-0682-4150-a059-b7e48853c559 · outbound

This paper cites A (2+ϵ)-approximation algorithm for metric k-median.

The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand A (2+ϵ)-approximation algorithm for metric k-median

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T19:37:44.368872Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

Observation 8f0ab4a4-c11b-4096-a163-a53feac4998e · outbound

This paper cites On the fixed-parameter tractability of capacitated clus- tering.

The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand On the fixed-parameter tractability of capacitated clus- tering

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T19:37:44.365114Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

Observation 463dda5b-484c-4883-87fe-968fae31bd6a · outbound

This paper cites A threshold oflnn for approximating set cover.Journal of the ACM, 45(4):634–652.

The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand A threshold oflnn for approximating set cover.Journal of the ACM, 45(4):634–652

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T19:37:44.366975Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

Observation 877638df-ab0e-4b59-a105-fcfcaa185b94 · outbound

This paper cites Alaya, Aur´elie Boisbunon, Stanislas Chambon, Laetitia Chapel, Adrien Corenflos, Kilian Fatras, Nemo Fournier, L ´eo Gautheron, Nathalie T.H.

The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand Alaya, Aur´elie Boisbunon, Stanislas Chambon, Laetitia Chapel, Adrien Corenflos, Kilian Fatras, Nemo Fournier, L ´eo Gautheron, Nathalie T.H

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T19:37:44.363200Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

Observation cce2692c-ff37-4156-803a-537833e32e9d · outbound

This paper cites COIN-OR Branch and Cut (Cbc).

The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand COIN-OR Branch and Cut (Cbc)

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T19:37:44.325010Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

Observation 4fc84740-210e-449b-8aa5-1c8d8a8d4e4f · outbound

This paper cites Openstreetmap: User-generated street maps.IEEE Pervasive Computing, 7(4):12–18.

The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand Openstreetmap: User-generated street maps.IEEE Pervasive Computing, 7(4):12–18

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T19:37:44.361294Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

Observation e3720f01-ba6e-496a-8ee1-0df3216bdaea · outbound

This paper cites Data-driven model predictive control of autonomous mobility-on-demand systems.

The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand Data-driven model predictive control of autonomous mobility-on-demand systems

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T19:37:44.359474Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

Observation 8b5f2f85-4028-49c5-adfb-7ccac82e8afc · outbound

This paper cites Korupolu, C.Greg Plaxton, and Rajmohan Rajaraman.

The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand Korupolu, C.Greg Plaxton, and Rajmohan Rajaraman

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T19:37:44.327176Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

Observation 9583252a-49e3-4c76-a839-2cb353be44ea · outbound

This paper cites Tight bounds for minimax grid matching with applications to the average case analysis of algorithms.Combinatorica, 9(2):161–187.

The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand Tight bounds for minimax grid matching with applications to the average case analysis of algorithms.Combinatorica, 9(2):161–187

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T19:37:44.357657Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

Observation 37617755-a395-43f1-9388-af2d2dfb10f9 · outbound

This paper cites On uniform capacitatedk-median beyond the natural LP relaxation.ACM Transactions on Algorithms, 13(2):22:1–22:18.

The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand On uniform capacitatedk-median beyond the natural LP relaxation.ACM Transactions on Algorithms, 13(2):22:1–22:18

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T19:37:44.355775Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

Observation f45777c3-7252-4e6e-a44c-99f8a81f4d22 · outbound

This paper cites Efficient large-scale fleet management via multi-agent deep reinforcement learning.

The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand Efficient large-scale fleet management via multi-agent deep reinforcement learning

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T19:37:44.353766Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

Observation 7d79e379-d04e-43ab-bb2b-3d451a945384 · outbound

This paper cites Real-time routing with OpenStreetMap data.

The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand Real-time routing with OpenStreetMap data

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T19:37:44.351942Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

Observation 5745c6f1-4e8d-4df7-bfc8-01187bf4ed78 · outbound

This paper cites an unresolved cited work.

The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand Unresolved cited work

Reference 21

Resolution: unresolved; raw_fallback, observed 2026-05-19T19:37:44.350105Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

Observation a417f5ec-0632-483d-a0d4-30616fe417be · outbound

This paper cites PuLP: A linear programming toolkit for Python.

The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand PuLP: A linear programming toolkit for Python

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T19:37:44.348443Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

Observation 2fdd1a39-a2f3-4984-8088-36d4a2e4ce2a · outbound

This paper cites Smith, Emilio Frazzoli, and Daniela Rus.

The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand Smith, Emilio Frazzoli, and Daniela Rus

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T19:37:44.346534Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

Observation 97863303-e987-4c22-841e-cc5c039cdda8 · outbound

This paper cites Deep reinforcement learning for ride-sharing dispatching and repositioning.

The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand Deep reinforcement learning for ride-sharing dispatching and repositioning

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T19:37:44.331063Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

Observation b4873d2d-d555-430a-a17f-4c1f19ee065e · outbound

This paper cites Multicommodity facility location.

The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand Multicommodity facility location

Reference 25

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T19:37:44.344751Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

Observation c6e9d214-ebbc-4162-9935-4dd0d5c8d67a · outbound

This paper cites an unresolved cited work.

The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand Unresolved cited work

Reference 26

Resolution: unresolved; raw_fallback, observed 2026-05-19T19:37:44.342921Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

Observation 139f631e-f547-4bb7-8b8e-a5f6fe787393 · outbound

This paper cites X S∈K 1− |US| |U1| |L∩U1|# ≥E  k· 1− 1 k X S∈K |US| |U1| !|L∩U1|  =E.

The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand X S∈K 1− |US| |U1| |L∩U1|# ≥E  k· 1− 1 k X S∈K |US| |U1| !|L∩U1|  =E

Reference 27

Resolution: malformed identifier; raw_fallback, observed 2026-05-19T19:37:44.340616Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

Observation 5af6864d-7bf1-46e1-9f9e-86255f1a8a19 · outbound

This paper cites an unresolved cited work.

The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand Unresolved cited work

Reference 28

Resolution: unresolved; raw_fallback, observed 2026-05-19T19:37:44.332927Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

Observation 5de9dcd2-318d-472b-8bd5-813bae079e2b · outbound

This paper cites The inequality here follows usingz 1 = 1 e −ε,z 2 = 1 e , andr= E[|L∩U1|] k.

The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand The inequality here follows usingz 1 = 1 e −ε,z 2 = 1 e , andr= E[|L∩U1|] k

Reference 29

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T19:37:44.338793Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

Pith citing papers

No inbound Pith citation observations are available.