{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:MZHZ2TESBZYHQG7PKQQGXBCOB6","short_pith_number":"pith:MZHZ2TES","canonical_record":{"source":{"id":"2605.13134","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SY","submitted_at":"2026-05-13T08:03:04Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"9b9dd381b38020d06428506ddd902fce9d1786cbcdc88e5d8cc8fb5d188734e5","abstract_canon_sha256":"1b1bd6ce4a2caf258f3badb86f3f6ee80f6e472fc80da4b188f038e623baf09d"},"schema_version":"1.0"},"canonical_sha256":"664f9d4c920e70781bef54206b844e0fb8a960f27e5d32ba5f8b80247f40c431","source":{"kind":"arxiv","id":"2605.13134","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13134","created_at":"2026-05-18T03:08:57Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13134v1","created_at":"2026-05-18T03:08:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13134","created_at":"2026-05-18T03:08:57Z"},{"alias_kind":"pith_short_12","alias_value":"MZHZ2TESBZYH","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"MZHZ2TESBZYHQG7P","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"MZHZ2TES","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:MZHZ2TESBZYHQG7PKQQGXBCOB6","target":"record","payload":{"canonical_record":{"source":{"id":"2605.13134","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SY","submitted_at":"2026-05-13T08:03:04Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"9b9dd381b38020d06428506ddd902fce9d1786cbcdc88e5d8cc8fb5d188734e5","abstract_canon_sha256":"1b1bd6ce4a2caf258f3badb86f3f6ee80f6e472fc80da4b188f038e623baf09d"},"schema_version":"1.0"},"canonical_sha256":"664f9d4c920e70781bef54206b844e0fb8a960f27e5d32ba5f8b80247f40c431","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:08:57.639614Z","signature_b64":"cCGdBR0JkfI6rpxdUfWvvrHEpXp/yh6k8bTC8YsXJJ67PGRhE3ZWA3LfRqcmXCL2uItsyAi0pVoGBCCe614SAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"664f9d4c920e70781bef54206b844e0fb8a960f27e5d32ba5f8b80247f40c431","last_reissued_at":"2026-05-18T03:08:57.638833Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:08:57.638833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.13134","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-18T03:08:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HSX88GNEcAA8eaLwIPp8Nw7JZOFHcFo3K1YNashaTIx+SzlltgfyrXDQYpCE63GvYGM1cILa8VwA3f1UVGWzBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:11:27.270212Z"},"content_sha256":"04356614907f1355bb4b4a68e1681b8830aa32e0e238e0c9d5dcaae63300dd9d","schema_version":"1.0","event_id":"sha256:04356614907f1355bb4b4a68e1681b8830aa32e0e238e0c9d5dcaae63300dd9d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:MZHZ2TESBZYHQG7PKQQGXBCOB6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Security-Aware Planning and Control of Multi-Agent Systems with LTL Tasks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A synthesis procedure builds secure transition system abstractions for multi-agent LTL tasks by removing paths that would let a partial observer infer secret executions or responsible agents.","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Dimos V. Dimarogonas, Georgios Mitsos, Siyuan Liu","submitted_at":"2026-05-13T08:03:04Z","abstract_excerpt":"This paper presents a secure-by-construction planning and control framework for multi-agent systems subject to linear temporal logic (LTL) specifications. The framework protects sensitive information from a passive intruder with partial observations of the agents' motion. Security in multi-agent coordination is captured by two notions that prevent the intruder from inferring whether a secret task has been executed and from identifying the agent responsible for its execution. The proposed framework incorporates the security constraints directly into the LTL synthesis procedure by constructing a"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"This synthesis procedure provides formal guarantees that the resulting behavior of the multi-agent system satisfies both the global LTL specification and the security constraints.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The framework assumes that the two security notions can be enforced exactly by removing violating paths from a finite transition system abstraction of the agents' continuous dynamics, and that the intruder’s partial observations are known in advance.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A secure-by-construction framework builds a finite transition system that removes paths violating two security notions, then applies standard LTL synthesis to produce plans satisfying both task specifications and intruder-resistance constraints.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A synthesis procedure builds secure transition system abstractions for multi-agent LTL tasks by removing paths that would let a partial observer infer secret executions or responsible agents.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"50a0447e8173e8172c52c174296757e03e73e69dd7303876d4e74304f76da411"},"source":{"id":"2605.13134","kind":"arxiv","version":1},"verdict":{"id":"fc71f3e5-77c9-4787-844d-bb1800f19644","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T18:53:42.047248Z","strongest_claim":"This synthesis procedure provides formal guarantees that the resulting behavior of the multi-agent system satisfies both the global LTL specification and the security constraints.","one_line_summary":"A secure-by-construction framework builds a finite transition system that removes paths violating two security notions, then applies standard LTL synthesis to produce plans satisfying both task specifications and intruder-resistance constraints.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The framework assumes that the two security notions can be enforced exactly by removing violating paths from a finite transition system abstraction of the agents' continuous dynamics, and that the intruder’s partial observations are known in advance.","pith_extraction_headline":"A synthesis procedure builds secure transition system abstractions for multi-agent LTL tasks by removing paths that would let a partial observer infer secret executions or responsible agents."},"references":{"count":22,"sample":[{"doi":"","year":2019,"title":"Sreenath, K., and Tabuada, P. (2019). Control barrier functions: theory and applications. InProc. 18th IEEE Eur. Conf. Control, 3420–3431","work_id":"1e1cdefb-c1af-4535-b95e-eba552531072","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2008,"title":"Baier, C. and Katoen, J. (2008).Principles of Model Checking. MIT Press","work_id":"b5abe755-1474-4792-abf8-bd22e6ce1da8","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2009,"title":"Fainekos, G.E., Girard, A., Kress-Gazit, H., and Pappas, G.J. (2009). Temporal logic motion planning for dy- namic robots.Automatica, 45(2), 343–352","work_id":"ccfbd32f-3b9a-47cf-80e5-3504095d01a6","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Fukuda, K. (2025). cddlib: An efficient implementation of the double description method","work_id":"aa33f270-7518-4673-915f-91cbca09eabe","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2020,"title":"Gastin, P. and Oddoux, D. (2020).LTL2BA(version 1.3)","work_id":"fd5a9124-0e12-4a31-8ea2-edfc4e6d4a6d","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":22,"snapshot_sha256":"9c8641c65eebfd342d08aada4f14804a229b3b734544d4a143515c4073478c4a","internal_anchors":0},"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":"fc71f3e5-77c9-4787-844d-bb1800f19644"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:08:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iDPPbTSKzRlh5RWLa0oaTcLA8HPlQMlpOK3XzaedVZhsjZhbGqUKO1Tg2XVmrmjxiE/SLvpVeYQzWMJrPr8NAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:11:27.271276Z"},"content_sha256":"27a1f50a8bf1a985793516ed353fd83a87a328460278b09c377bc47e019fdd4e","schema_version":"1.0","event_id":"sha256:27a1f50a8bf1a985793516ed353fd83a87a328460278b09c377bc47e019fdd4e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MZHZ2TESBZYHQG7PKQQGXBCOB6/bundle.json","state_url":"https://pith.science/pith/MZHZ2TESBZYHQG7PKQQGXBCOB6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MZHZ2TESBZYHQG7PKQQGXBCOB6/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-02T02:11:27Z","links":{"resolver":"https://pith.science/pith/MZHZ2TESBZYHQG7PKQQGXBCOB6","bundle":"https://pith.science/pith/MZHZ2TESBZYHQG7PKQQGXBCOB6/bundle.json","state":"https://pith.science/pith/MZHZ2TESBZYHQG7PKQQGXBCOB6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MZHZ2TESBZYHQG7PKQQGXBCOB6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:MZHZ2TESBZYHQG7PKQQGXBCOB6","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":"1b1bd6ce4a2caf258f3badb86f3f6ee80f6e472fc80da4b188f038e623baf09d","cross_cats_sorted":["cs.SY"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SY","submitted_at":"2026-05-13T08:03:04Z","title_canon_sha256":"9b9dd381b38020d06428506ddd902fce9d1786cbcdc88e5d8cc8fb5d188734e5"},"schema_version":"1.0","source":{"id":"2605.13134","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13134","created_at":"2026-05-18T03:08:57Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13134v1","created_at":"2026-05-18T03:08:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13134","created_at":"2026-05-18T03:08:57Z"},{"alias_kind":"pith_short_12","alias_value":"MZHZ2TESBZYH","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"MZHZ2TESBZYHQG7P","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"MZHZ2TES","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:27a1f50a8bf1a985793516ed353fd83a87a328460278b09c377bc47e019fdd4e","target":"graph","created_at":"2026-05-18T03:08:57Z","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":"This synthesis procedure provides formal guarantees that the resulting behavior of the multi-agent system satisfies both the global LTL specification and the security constraints."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The framework assumes that the two security notions can be enforced exactly by removing violating paths from a finite transition system abstraction of the agents' continuous dynamics, and that the intruder’s partial observations are known in advance."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A secure-by-construction framework builds a finite transition system that removes paths violating two security notions, then applies standard LTL synthesis to produce plans satisfying both task specifications and intruder-resistance constraints."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A synthesis procedure builds secure transition system abstractions for multi-agent LTL tasks by removing paths that would let a partial observer infer secret executions or responsible agents."}],"snapshot_sha256":"50a0447e8173e8172c52c174296757e03e73e69dd7303876d4e74304f76da411"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"This paper presents a secure-by-construction planning and control framework for multi-agent systems subject to linear temporal logic (LTL) specifications. The framework protects sensitive information from a passive intruder with partial observations of the agents' motion. Security in multi-agent coordination is captured by two notions that prevent the intruder from inferring whether a secret task has been executed and from identifying the agent responsible for its execution. The proposed framework incorporates the security constraints directly into the LTL synthesis procedure by constructing a","authors_text":"Dimos V. Dimarogonas, Georgios Mitsos, Siyuan Liu","cross_cats":["cs.SY"],"headline":"A synthesis procedure builds secure transition system abstractions for multi-agent LTL tasks by removing paths that would let a partial observer infer secret executions or responsible agents.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SY","submitted_at":"2026-05-13T08:03:04Z","title":"Security-Aware Planning and Control of Multi-Agent Systems with LTL Tasks"},"references":{"count":22,"internal_anchors":0,"resolved_work":22,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Sreenath, K., and Tabuada, P. (2019). Control barrier functions: theory and applications. InProc. 18th IEEE Eur. Conf. Control, 3420–3431","work_id":"1e1cdefb-c1af-4535-b95e-eba552531072","year":2019},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Baier, C. and Katoen, J. (2008).Principles of Model Checking. MIT Press","work_id":"b5abe755-1474-4792-abf8-bd22e6ce1da8","year":2008},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Fainekos, G.E., Girard, A., Kress-Gazit, H., and Pappas, G.J. (2009). Temporal logic motion planning for dy- namic robots.Automatica, 45(2), 343–352","work_id":"ccfbd32f-3b9a-47cf-80e5-3504095d01a6","year":2009},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Fukuda, K. (2025). cddlib: An efficient implementation of the double description method","work_id":"aa33f270-7518-4673-915f-91cbca09eabe","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Gastin, P. and Oddoux, D. (2020).LTL2BA(version 1.3)","work_id":"fd5a9124-0e12-4a31-8ea2-edfc4e6d4a6d","year":2020}],"snapshot_sha256":"9c8641c65eebfd342d08aada4f14804a229b3b734544d4a143515c4073478c4a"},"source":{"id":"2605.13134","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T18:53:42.047248Z","id":"fc71f3e5-77c9-4787-844d-bb1800f19644","model_set":{"reader":"grok-4.3"},"one_line_summary":"A secure-by-construction framework builds a finite transition system that removes paths violating two security notions, then applies standard LTL synthesis to produce plans satisfying both task specifications and intruder-resistance constraints.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A synthesis procedure builds secure transition system abstractions for multi-agent LTL tasks by removing paths that would let a partial observer infer secret executions or responsible agents.","strongest_claim":"This synthesis procedure provides formal guarantees that the resulting behavior of the multi-agent system satisfies both the global LTL specification and the security constraints.","weakest_assumption":"The framework assumes that the two security notions can be enforced exactly by removing violating paths from a finite transition system abstraction of the agents' continuous dynamics, and that the intruder’s partial observations are known in advance."}},"verdict_id":"fc71f3e5-77c9-4787-844d-bb1800f19644"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:04356614907f1355bb4b4a68e1681b8830aa32e0e238e0c9d5dcaae63300dd9d","target":"record","created_at":"2026-05-18T03:08:57Z","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":"1b1bd6ce4a2caf258f3badb86f3f6ee80f6e472fc80da4b188f038e623baf09d","cross_cats_sorted":["cs.SY"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SY","submitted_at":"2026-05-13T08:03:04Z","title_canon_sha256":"9b9dd381b38020d06428506ddd902fce9d1786cbcdc88e5d8cc8fb5d188734e5"},"schema_version":"1.0","source":{"id":"2605.13134","kind":"arxiv","version":1}},"canonical_sha256":"664f9d4c920e70781bef54206b844e0fb8a960f27e5d32ba5f8b80247f40c431","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"664f9d4c920e70781bef54206b844e0fb8a960f27e5d32ba5f8b80247f40c431","first_computed_at":"2026-05-18T03:08:57.638833Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:08:57.638833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cCGdBR0JkfI6rpxdUfWvvrHEpXp/yh6k8bTC8YsXJJ67PGRhE3ZWA3LfRqcmXCL2uItsyAi0pVoGBCCe614SAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:08:57.639614Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13134","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:04356614907f1355bb4b4a68e1681b8830aa32e0e238e0c9d5dcaae63300dd9d","sha256:27a1f50a8bf1a985793516ed353fd83a87a328460278b09c377bc47e019fdd4e"],"state_sha256":"72267c83b2ab9bc3ddf339fd40975ea96259c8d98c1953057fab726789bed6ae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wCcfqxZH971BvS3yrK3nW/L58uuiXzf10frmURyLEKtjttfafJLFxBo1YK0c56stZvocA1m6ex+RNKe73AEdDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T02:11:27.275119Z","bundle_sha256":"2b5738bb1afeaad9d37ee8b7348bc97d0a5d9a9a1bedec1b850968d070ab36cc"}}