Pith Number

pith:VB3C75ZR

pith:2026:VB3C75ZRWWPF776EUPT2IHRQG6

not attested not anchored not stored refs resolved

Synthesizing POMDP Policies: Sampling Meets Model-checking via Learning

Anirban Majumdar, Debraj Chakraborty, Jean-Fran\c{c}ois Raskin, Prince Mathew, Sayan Mukherjee

Sampling as a membership oracle and model-checking as an equivalence oracle synthesize finite-state POMDP controllers with formal guarantees when the induced policy is regular.

arxiv:2605.14440 v1 · 2026-05-14 · cs.AI · cs.FL · cs.LO

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

Add to your LaTeX paper

\usepackage{pith}
\pithnumber{VB3C75ZRWWPF776EUPT2IHRQG6}

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

We establish a relative completeness result for this framework. Experimental results from our prototypical implementation demonstrate that this method successfully solves threshold-safety problems that remain challenging for existing formal synthesis tools.

C2weakest assumption

The framework provides formal guarantees provided the sampling-induced policy is regular; the approach assumes sampling functions as a reliable membership oracle and model-checking as a reliable equivalence oracle without detailing how noise or approximation in sampling is handled.

C3one line summary

A new synthesis framework for POMDPs learns finite-state controllers via sampling and model-checking oracles, achieving relative completeness when the policy is regular and solving threshold-safety problems beyond existing formal tools.

References

46 extracted · 46 resolved · 1 Pith anchors

[1] In: Principles of Systems Design: Essays Dedicated to Thomas A 2022

[2] In: International Con- ference on Computer Aided Verification 2023

[3] In: International Conference on Computer Aided Verification 2021

[4] Angluin, D.: Learning regular sets from queries and counterexamples. Inf. Comput. 75(2), 87–106 (1987) 1987

[5] MIT press (2008) 2008

Receipt and verification

First computed	2026-05-17T23:39:07.031543Z
Builder	pith-number-builder-2026-05-17-v1
Signature	Pith Ed25519 (`pith-v1-2026-05`) · public key
Schema	pith-number/v1.0

Canonical hash

a8762ff731b59e5fffc4a3e7a41e30378917a3638959755b996cf0a4eba216d8

Aliases

arxiv: 2605.14440 · arxiv_version: 2605.14440v1 · doi: 10.48550/arxiv.2605.14440 · pith_short_12: VB3C75ZRWWPF · pith_short_16: VB3C75ZRWWPF776E · pith_short_8: VB3C75ZR

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/VB3C75ZRWWPF776EUPT2IHRQG6 \
  | 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: a8762ff731b59e5fffc4a3e7a41e30378917a3638959755b996cf0a4eba216d8

Canonical record JSON

{
  "metadata": {
    "abstract_canon_sha256": "4904d2348426bb471b27a44f42023f7699ddd88cd612761991556bf618cf87be",
    "cross_cats_sorted": [
      "cs.FL",
      "cs.LO"
    ],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "primary_cat": "cs.AI",
    "submitted_at": "2026-05-14T06:37:31Z",
    "title_canon_sha256": "caebc09d2818172a29b2b94a5bf45ff54341e5c77eecdd371cb3695ce75109c5"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2605.14440",
    "kind": "arxiv",
    "version": 1
  }
}