pith. sign in
Pith Number

pith:L5VLLRVW

pith:2026:L5VLLRVW6KZXOXENPG5OFMKFCS
not attested not anchored not stored refs pending

Conveyor Parcel Routing with Order-Contiguous Arrivals

Keisuke Okumura, Takuro Kato

DOPP is a complete polynomial-time algorithm for online multi-agent path finding with order-contiguity (MAPF-OC) that plans order-level sequences, refines priorities, and synthesizes paths via prioritized planning.

arxiv:2605.13035 v1 · 2026-05-13 · cs.MA

Add to your LaTeX paper
\usepackage{pith}
\pithnumber{L5VLLRVW6KZXOXENPG5OFMKFCS}

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

DOPP is a complete polynomial-time algorithm with a three-level structure that (i) searches order-level arrival sequences, (ii) refines agent-level priorities, and (iii) synthesizes feasible solutions via prioritized planning.

C2weakest assumption

That the conveyor network graphs admit feasible paths under the order-contiguity constraint without requiring backtracking or violating real-time deadlines, which is assumed to hold for the tested layouts but may not generalize to all topologies.

C3one line summary

DOPP is a complete polynomial-time algorithm for online multi-agent path finding with order-contiguity (MAPF-OC) that plans order-level sequences, refines priorities, and synthesizes paths via prioritized planning.

Cited by

1 paper in Pith

Receipt and verification
First computed 2026-05-18T03:08:59.649598Z
Builder pith-number-builder-2026-05-17-v1
Signature Pith Ed25519 (pith-v1-2026-05) · public key
Schema pith-number/v1.0

Canonical hash

5f6ab5c6b6f2b3775c8d79bae2b14514bcf6a92a095b8bfa4b5878ad77872942

Aliases

arxiv: 2605.13035 · arxiv_version: 2605.13035v1 · doi: 10.48550/arxiv.2605.13035 · pith_short_12: L5VLLRVW6KZX · pith_short_16: L5VLLRVW6KZXOXEN · pith_short_8: L5VLLRVW
Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/L5VLLRVW6KZXOXENPG5OFMKFCS \
  | 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: 5f6ab5c6b6f2b3775c8d79bae2b14514bcf6a92a095b8bfa4b5878ad77872942
Canonical record JSON
{
  "metadata": {
    "abstract_canon_sha256": "0cbc13c152c335d4266b5809aa116796c47a79a290cc80f08da77bda9f341292",
    "cross_cats_sorted": [],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "primary_cat": "cs.MA",
    "submitted_at": "2026-05-13T05:42:35Z",
    "title_canon_sha256": "75e935d969a567aadd6f66f3d4b22f4a9955c3ecb7da723293b19fc5d610b2a7"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2605.13035",
    "kind": "arxiv",
    "version": 1
  }
}