{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:VB3C75ZRWWPF776EUPT2IHRQG6","short_pith_number":"pith:VB3C75ZR","canonical_record":{"source":{"id":"2605.14440","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-05-14T06:37:31Z","cross_cats_sorted":["cs.FL","cs.LO"],"title_canon_sha256":"caebc09d2818172a29b2b94a5bf45ff54341e5c77eecdd371cb3695ce75109c5","abstract_canon_sha256":"4904d2348426bb471b27a44f42023f7699ddd88cd612761991556bf618cf87be"},"schema_version":"1.0"},"canonical_sha256":"a8762ff731b59e5fffc4a3e7a41e30378917a3638959755b996cf0a4eba216d8","source":{"kind":"arxiv","id":"2605.14440","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14440","created_at":"2026-05-17T23:39:07Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14440v1","created_at":"2026-05-17T23:39:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14440","created_at":"2026-05-17T23:39:07Z"},{"alias_kind":"pith_short_12","alias_value":"VB3C75ZRWWPF","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"VB3C75ZRWWPF776E","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"VB3C75ZR","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:VB3C75ZRWWPF776EUPT2IHRQG6","target":"record","payload":{"canonical_record":{"source":{"id":"2605.14440","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-05-14T06:37:31Z","cross_cats_sorted":["cs.FL","cs.LO"],"title_canon_sha256":"caebc09d2818172a29b2b94a5bf45ff54341e5c77eecdd371cb3695ce75109c5","abstract_canon_sha256":"4904d2348426bb471b27a44f42023f7699ddd88cd612761991556bf618cf87be"},"schema_version":"1.0"},"canonical_sha256":"a8762ff731b59e5fffc4a3e7a41e30378917a3638959755b996cf0a4eba216d8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:07.032205Z","signature_b64":"Tn8dkcsZ5LyB/1xIimEklL/VL7AvrKEIXjGY8c5w2kRZXPz5A+T6QpzlTNJqB8Q4m7y06WgA91MSizLUeZ67Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8762ff731b59e5fffc4a3e7a41e30378917a3638959755b996cf0a4eba216d8","last_reissued_at":"2026-05-17T23:39:07.031543Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:07.031543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.14440","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iRsxWaOsPf3FKvvkGnytIu3j93Jt8UowsAtNF/P199l2a6R+/Zu7dS9eYEI1tj0jPY7zSOLUEzaYPzF8BOXACQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T21:42:41.522496Z"},"content_sha256":"00b32939e47b2df96395908d23ac7cd21e1bd1d8032b0e11abeb79b3af5efe48","schema_version":"1.0","event_id":"sha256:00b32939e47b2df96395908d23ac7cd21e1bd1d8032b0e11abeb79b3af5efe48"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:VB3C75ZRWWPF776EUPT2IHRQG6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Synthesizing POMDP Policies: Sampling Meets Model-checking via Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"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.","cross_cats":["cs.FL","cs.LO"],"primary_cat":"cs.AI","authors_text":"Anirban Majumdar, Debraj Chakraborty, Jean-Fran\\c{c}ois Raskin, Prince Mathew, Sayan Mukherjee","submitted_at":"2026-05-14T06:37:31Z","abstract_excerpt":"Partially Observable Markov Decision Processes (POMDPs) are the standard framework for decision-making under uncertainty. While sampling-based methods scale well, they lack formal correctness guarantees, making them unsuitable for safety-critical applications. Conversely, formal synthesis techniques provide correctness-by-construction but often struggle with scalability, as general POMDP synthesis is undecidable. To bridge this gap, we propose a synthesis framework that integrates sampling, automata learning, and model-checking. Inspired by Angluin's $L^*$ algorithm, our approach utilizes samp"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"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.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"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.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"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.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"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.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"8946c918371df7ad5d26dfd6400795cf2414e7c9eef0661ec75bf8b579ef9941"},"source":{"id":"2605.14440","kind":"arxiv","version":1},"verdict":{"id":"6dc38e11-3840-4b02-a046-234609994078","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T01:51:26.470039Z","strongest_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.","one_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.","pipeline_version":"pith-pipeline@v0.9.0","weakest_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.","pith_extraction_headline":"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."},"references":{"count":46,"sample":[{"doi":"","year":2022,"title":"In: Principles of Systems Design: Essays Dedicated to Thomas A","work_id":"129b3120-622c-4d1e-b322-962179e8b33f","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"In: International Con- ference on Computer Aided Verification","work_id":"ae6e13fd-6ccc-43d1-9344-e3c57b862651","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2021,"title":"In: International Conference on Computer Aided Verification","work_id":"73389a62-716f-49a1-81b3-19c9f0e3ed97","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1987,"title":"Angluin, D.: Learning regular sets from queries and counterexamples. Inf. Comput. 75(2), 87–106 (1987)","work_id":"9074eabc-a777-4ac1-b878-8784d5dd7c8a","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2008,"title":"MIT press (2008)","work_id":"ad903039-7863-4cda-a816-8cffb167bd50","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":46,"snapshot_sha256":"dced0dc1fb3b9af95fadafea341254ab42d7696484ea69276a585fee495a284e","internal_anchors":1},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"6dc38e11-3840-4b02-a046-234609994078"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+o5WEgluQqtY+kbnQDpE9VHxWBZ2yh3wMS1p4qLPG0IyG5Ih2S/59Vaz6X5te8r6gnuCutP9dYOQQNpDXU/+BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T21:42:41.523127Z"},"content_sha256":"271ca4e209955abba92f405b6fc4ff9f6fd2d36a7dd6c0f5e4889e09cae899e9","schema_version":"1.0","event_id":"sha256:271ca4e209955abba92f405b6fc4ff9f6fd2d36a7dd6c0f5e4889e09cae899e9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VB3C75ZRWWPF776EUPT2IHRQG6/bundle.json","state_url":"https://pith.science/pith/VB3C75ZRWWPF776EUPT2IHRQG6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VB3C75ZRWWPF776EUPT2IHRQG6/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-04T21:42:41Z","links":{"resolver":"https://pith.science/pith/VB3C75ZRWWPF776EUPT2IHRQG6","bundle":"https://pith.science/pith/VB3C75ZRWWPF776EUPT2IHRQG6/bundle.json","state":"https://pith.science/pith/VB3C75ZRWWPF776EUPT2IHRQG6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VB3C75ZRWWPF776EUPT2IHRQG6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:VB3C75ZRWWPF776EUPT2IHRQG6","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"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}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14440","created_at":"2026-05-17T23:39:07Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14440v1","created_at":"2026-05-17T23:39:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14440","created_at":"2026-05-17T23:39:07Z"},{"alias_kind":"pith_short_12","alias_value":"VB3C75ZRWWPF","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"VB3C75ZRWWPF776E","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"VB3C75ZR","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:271ca4e209955abba92f405b6fc4ff9f6fd2d36a7dd6c0f5e4889e09cae899e9","target":"graph","created_at":"2026-05-17T23:39:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"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."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"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."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"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."}],"snapshot_sha256":"8946c918371df7ad5d26dfd6400795cf2414e7c9eef0661ec75bf8b579ef9941"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Partially Observable Markov Decision Processes (POMDPs) are the standard framework for decision-making under uncertainty. While sampling-based methods scale well, they lack formal correctness guarantees, making them unsuitable for safety-critical applications. Conversely, formal synthesis techniques provide correctness-by-construction but often struggle with scalability, as general POMDP synthesis is undecidable. To bridge this gap, we propose a synthesis framework that integrates sampling, automata learning, and model-checking. Inspired by Angluin's $L^*$ algorithm, our approach utilizes samp","authors_text":"Anirban Majumdar, Debraj Chakraborty, Jean-Fran\\c{c}ois Raskin, Prince Mathew, Sayan Mukherjee","cross_cats":["cs.FL","cs.LO"],"headline":"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.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-05-14T06:37:31Z","title":"Synthesizing POMDP Policies: Sampling Meets Model-checking via Learning"},"references":{"count":46,"internal_anchors":1,"resolved_work":46,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"In: Principles of Systems Design: Essays Dedicated to Thomas A","work_id":"129b3120-622c-4d1e-b322-962179e8b33f","year":2022},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"In: International Con- ference on Computer Aided Verification","work_id":"ae6e13fd-6ccc-43d1-9344-e3c57b862651","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"In: International Conference on Computer Aided Verification","work_id":"73389a62-716f-49a1-81b3-19c9f0e3ed97","year":2021},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Angluin, D.: Learning regular sets from queries and counterexamples. Inf. Comput. 75(2), 87–106 (1987)","work_id":"9074eabc-a777-4ac1-b878-8784d5dd7c8a","year":1987},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"MIT press (2008)","work_id":"ad903039-7863-4cda-a816-8cffb167bd50","year":2008}],"snapshot_sha256":"dced0dc1fb3b9af95fadafea341254ab42d7696484ea69276a585fee495a284e"},"source":{"id":"2605.14440","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T01:51:26.470039Z","id":"6dc38e11-3840-4b02-a046-234609994078","model_set":{"reader":"grok-4.3"},"one_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.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"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.","strongest_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.","weakest_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."}},"verdict_id":"6dc38e11-3840-4b02-a046-234609994078"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:00b32939e47b2df96395908d23ac7cd21e1bd1d8032b0e11abeb79b3af5efe48","target":"record","created_at":"2026-05-17T23:39:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"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}},"canonical_sha256":"a8762ff731b59e5fffc4a3e7a41e30378917a3638959755b996cf0a4eba216d8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a8762ff731b59e5fffc4a3e7a41e30378917a3638959755b996cf0a4eba216d8","first_computed_at":"2026-05-17T23:39:07.031543Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:07.031543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Tn8dkcsZ5LyB/1xIimEklL/VL7AvrKEIXjGY8c5w2kRZXPz5A+T6QpzlTNJqB8Q4m7y06WgA91MSizLUeZ67Bg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:07.032205Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.14440","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:00b32939e47b2df96395908d23ac7cd21e1bd1d8032b0e11abeb79b3af5efe48","sha256:271ca4e209955abba92f405b6fc4ff9f6fd2d36a7dd6c0f5e4889e09cae899e9"],"state_sha256":"e4269297c16c09b2f4d1cb7e2f4c1004eb44bf70a4b40ff2eaacf2d615638942"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jTltuCN7VKliIPVrnD2JW67pg/jQ6wpdjsgI8uYSlWPmEOr8ZdztFfUtS16ZiTGM2N7zm/oWYfjOJO1BljO+Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T21:42:41.525598Z","bundle_sha256":"19f017f2602c71221ab70b52179c1188c7acc199d110b50ab0660e8639d40ed5"}}