Pith Number

pith:MPRZQYZX

pith:2026:MPRZQYZXJNKLLLSCAKGHMMSUY3

not attested not anchored not stored refs resolved

The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand

Aaron Schild, Ali Kemal Sinop, Ioannis Caragiannis, Kostas Kollias, Mohammad Roghani

Sampling robotaxi locations from the demand distribution provides a randomized 2-approximation for minimizing expected rider wait times.

arxiv:2605.15745 v1 · 2026-05-15 · cs.DS · cs.CC

Open paper page JSON Open Graph Bundle Merged state Verified badge What is a Pith Number?

Add to your LaTeX paper

\usepackage{pith}
\pithnumber{MPRZQYZXJNKLLLSCAKGHMMSUY3}

Prints a linked badge after your title and injects PDF metadata. Compiles on arXiv. Learn more · Embed verified badge

Record completeness

1 Bitcoin timestamp

2 Internet Archive

3 Author claim open · sign in to claim

4 Citations open

5 Replications open

✓ Portable graph bundle live · download bundle · merged state

The bundle contains the canonical record plus signed events. A mirror can host it anywhere and recompute the same current state with the deterministic merge algorithm.

Claims

C1strongest claim

Sampling robotaxi locations independently according to the demand distribution yields a randomized 2-approximation algorithm for the robotaxi placement problem.

C2weakest assumption

The demand distribution over rider locations is known in advance and can be sampled from independently for each of the k riders (section on randomized algorithm and empirical evaluation).

C3one line summary

Introduces the k-robotaxi placement problem on metric spaces, gives a randomized 2-approximation by independent sampling from demand, proves inapproximability via max-coverage reduction, provides exact DP on trees, and shows variance-reduced random placement works well empirically.

References

29 extracted · 29 resolved · 0 Pith anchors

[1] Optimal matchings of random points.Combi- natorica, 4(4):259–264, 1984 1984

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

[3] Bertsimas.Probabilistic combinatorial optimization problems 1988

[4] Bertsimas, Patrick Jaillet, and Amedeo R 1990

[5] Empty-car routing in ridesharing systems.Operations Research, 67(5):1437–1452, 2019 2019

Formal links

2 machine-checked theorem links

Receipt and verification

First computed	2026-05-20T00:01:15.972915Z
Builder	pith-number-builder-2026-05-17-v1
Signature	Pith Ed25519 (`pith-v1-2026-05`) · public key
Schema	pith-number/v1.0

Canonical hash

63e39863374b54b5ae42028c763254c6e10e5f594d78f5949614c4b724b2b4f8

Aliases

arxiv: 2605.15745 · arxiv_version: 2605.15745v1 · doi: 10.48550/arxiv.2605.15745 · pith_short_12: MPRZQYZXJNKL · pith_short_16: MPRZQYZXJNKLLLSC · pith_short_8: MPRZQYZX

Agent API

Resolver JSON Graph JSON Events JSON Schema Signing key

Verify this Pith Number yourself

curl -sH 'Accept: application/ld+json' https://pith.science/pith/MPRZQYZXJNKLLLSCAKGHMMSUY3 \
  | jq -c '.canonical_record' \
  | python3 -c "import sys,json,hashlib; b=json.dumps(json.loads(sys.stdin.read()), sort_keys=True, separators=(',',':'), ensure_ascii=False).encode(); print(hashlib.sha256(b).hexdigest())"
# expect: 63e39863374b54b5ae42028c763254c6e10e5f594d78f5949614c4b724b2b4f8

Canonical record JSON

{
  "metadata": {
    "abstract_canon_sha256": "570070d40ed5ca67abea3b10917d803db061a8971f7c96cc33ff538de15f1b6d",
    "cross_cats_sorted": [
      "cs.CC"
    ],
    "license": "http://creativecommons.org/licenses/by/4.0/",
    "primary_cat": "cs.DS",
    "submitted_at": "2026-05-15T08:54:32Z",
    "title_canon_sha256": "aadff434765507267b497901f79fea1a3d354232818fcb2bac45ea58dccea8ea"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2605.15745",
    "kind": "arxiv",
    "version": 1
  }
}