{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:XVID5RKDYHIHC5ZSB3Y472YBLK","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":"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}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13185","created_at":"2026-05-18T03:08:56Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13185v1","created_at":"2026-05-18T03:08:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13185","created_at":"2026-05-18T03:08:56Z"},{"alias_kind":"pith_short_12","alias_value":"XVID5RKDYHIH","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"XVID5RKDYHIHC5ZS","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"XVID5RKD","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:3a859abc9ddaa55e564d8e72fe9d7924e81990aba25ac69bdbb2ea6ed77fa0d0","target":"graph","created_at":"2026-05-18T03:08:56Z","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":"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."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"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."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"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."}],"snapshot_sha256":"2692c211f238d2ca006ea70385fa472f1e6563a697229a07dd1084700fcc2095"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We study the problem of generating paths on a graph that satisfy a collection of {\\omega}-regular objectives. We propose a decoupled framework in which each objective is assigned to an independent agent that selects a local policy, while a scheduler -- oblivious to the graph and objective -- dynamically composes these policies into a single path. We ask when such a composition satisfies all objectives, assuming their conjunction is realizable. The framework enables modular policy design but raises fundamental compositional challenges. We show that even extremely fair deterministic schedulers d","authors_text":"Guy Avni, Kaushik Mallik, K. S. Thejaswini, Suman Sadhukhan, Thomas A. Henzinger","cross_cats":["cs.MA"],"headline":"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.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2026-05-13T08:42:51Z","title":"Decoupled Planning for Multiple Omega-Regular Objectives"},"references":{"count":29,"internal_anchors":0,"resolved_work":29,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Distributed comput- ing2(3), 117–126 (1987)","work_id":"87e0e057-da8c-47be-b654-559a9c3b4c24","year":1987},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"In: International Conference on Computer Aided Verification","work_id":"bb43223a-21c6-4090-ba5f-62ab63045f80","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Avni, G., Henzinger, T.A., Chonev, V.: Infinite-duration bidding games. J. ACM 66(4), 31:1–31:29 (2019)","work_id":"5731ea3f-85f0-4a06-90f7-9a60110431c3","year":2019},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"In: International Conference on Tools and Algorithms for the Construction and Analysis of Systems","work_id":"b240e5bc-35c0-40da-9af7-b0ddb7538120","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"In: International Conference on Tools and Algorithms for the Construction and Analysis of Systems","work_id":"28f5f4f2-153a-4c03-8b2c-46ecd64663af","year":2015}],"snapshot_sha256":"cce4275efb1404c3e85b6421b178435703ea49a2f62844c81a3dbf8f613997f5"},"source":{"id":"2605.13185","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T01:35:07.269893Z","id":"385b2a1c-cfbc-4633-a374-b1d26a2c7e0a","model_set":{"reader":"grok-4.3"},"one_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.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"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.","strongest_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.","weakest_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."}},"verdict_id":"385b2a1c-cfbc-4633-a374-b1d26a2c7e0a"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:fe68f418a273461b820a2f03318438878c09b52f68034111a65e4dd0d409dcca","target":"record","created_at":"2026-05-18T03:08:56Z","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":"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}},"canonical_sha256":"bd503ec543c1d07177320ef1cfeb015aa1f4eb3b6bb94bf1ec5c1ecf0a8b84f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bd503ec543c1d07177320ef1cfeb015aa1f4eb3b6bb94bf1ec5c1ecf0a8b84f5","first_computed_at":"2026-05-18T03:08:56.240872Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:08:56.240872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7I5w5aQgqalp+TS5XQGQhaQzg1ypUSt/YjkeYgFxRI5d1rtrrT4NiYmiRe46+DO+FJiXbN/1eHuc2tOG24uvCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:08:56.241701Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13185","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fe68f418a273461b820a2f03318438878c09b52f68034111a65e4dd0d409dcca","sha256:3a859abc9ddaa55e564d8e72fe9d7924e81990aba25ac69bdbb2ea6ed77fa0d0"],"state_sha256":"03f97df1c384f8f30f4b1fad64bb97ab8690eeb392ca3f49d89fa2cc9cadd9e5"}