Pith Number

pith:XVID5RKD

pith:2026:XVID5RKDYHIHC5ZSB3Y472YBLK

not attested not anchored not stored refs resolved

Decoupled Planning for Multiple Omega-Regular Objectives

Guy Avni, Kaushik Mallik, K. S. Thejaswini, Suman Sadhukhan, Thomas A. Henzinger

Agents satisfy multiple omega-regular objectives on a graph through independent local policies composed by a scheduler if they follow pre-agreed conventions specific to each objective class.

arxiv:2605.13185 v1 · 2026-05-13 · cs.FL · cs.MA

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

Add to your LaTeX paper

\usepackage{pith}
\pithnumber{XVID5RKDYHIHC5ZSB3Y472YBLK}

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

Büchi objectives admit universal composition of finite-memory policies without scheduler communication; co-Büchi objectives require only knowledge of whether the agent was scheduled; and parity objectives additionally require knowledge of which agent was scheduled.

C2weakest assumption

The conjunction of objectives is realizable on the graph, and all agents agree in advance on the conventions before the graph or objectives are revealed.

C3one line summary

A decoupled agent framework with a priori conventions enables reliable composition of policies for multiple omega-regular objectives on graphs, with specific minimal conventions characterized for Buchi, co-Buchi, and parity classes.

References

29 extracted · 29 resolved · 0 Pith anchors

[1] Distributed comput- ing2(3), 117–126 (1987) 1987

[2] In: International Conference on Computer Aided Verification 2023

[3] Avni, G., Henzinger, T.A., Chonev, V.: Infinite-duration bidding games. J. ACM 66(4), 31:1–31:29 (2019) 2019

[4] In: International Conference on Tools and Algorithms for the Construction and Analysis of Systems 2024

[5] In: International Conference on Tools and Algorithms for the Construction and Analysis of Systems 2015

Receipt and verification

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

Canonical hash

bd503ec543c1d07177320ef1cfeb015aa1f4eb3b6bb94bf1ec5c1ecf0a8b84f5

Aliases

arxiv: 2605.13185 · arxiv_version: 2605.13185v1 · doi: 10.48550/arxiv.2605.13185 · pith_short_12: XVID5RKDYHIH · pith_short_16: XVID5RKDYHIHC5ZS · pith_short_8: XVID5RKD

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/XVID5RKDYHIHC5ZSB3Y472YBLK \
  | 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: bd503ec543c1d07177320ef1cfeb015aa1f4eb3b6bb94bf1ec5c1ecf0a8b84f5

Canonical record JSON

{
  "metadata": {
    "abstract_canon_sha256": "332e78f83dc33c44398d2bc027c99b2feeeb40f6e91f7de4c7cd764f4113f36c",
    "cross_cats_sorted": [
      "cs.MA"
    ],
    "license": "http://creativecommons.org/licenses/by/4.0/",
    "primary_cat": "cs.FL",
    "submitted_at": "2026-05-13T08:42:51Z",
    "title_canon_sha256": "8f2f8d0dd1ec63e924498b06469e177967160f9e9827ae3da815a4434457b39f"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2605.13185",
    "kind": "arxiv",
    "version": 1
  }
}