{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GHBXECEY6ECOYEFDA2VGTBYOTM","short_pith_number":"pith:GHBXECEY","canonical_record":{"source":{"id":"1705.10427","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-05-30T01:39:45Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"be7e2d24c59d031fad36a2fc7ef8c793348b9786c50a86d17ce7f1e7f040965e","abstract_canon_sha256":"ebefe10a9acfbab5465c24e242a1e3da828a63a692ca8b96b84a27f46a262b5a"},"schema_version":"1.0"},"canonical_sha256":"31c3720898f104ec10a306aa69870e9b3c4b30abcc502839871a6a4bac7096e4","source":{"kind":"arxiv","id":"1705.10427","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.10427","created_at":"2026-05-18T00:40:03Z"},{"alias_kind":"arxiv_version","alias_value":"1705.10427v1","created_at":"2026-05-18T00:40:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10427","created_at":"2026-05-18T00:40:03Z"},{"alias_kind":"pith_short_12","alias_value":"GHBXECEY6ECO","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"GHBXECEY6ECOYEFD","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"GHBXECEY","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GHBXECEY6ECOYEFDA2VGTBYOTM","target":"record","payload":{"canonical_record":{"source":{"id":"1705.10427","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-05-30T01:39:45Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"be7e2d24c59d031fad36a2fc7ef8c793348b9786c50a86d17ce7f1e7f040965e","abstract_canon_sha256":"ebefe10a9acfbab5465c24e242a1e3da828a63a692ca8b96b84a27f46a262b5a"},"schema_version":"1.0"},"canonical_sha256":"31c3720898f104ec10a306aa69870e9b3c4b30abcc502839871a6a4bac7096e4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:03.295653Z","signature_b64":"v8uZ9F9hVMlm+tmQEU3hAytwFXzyjResYbv1ojY5H5MIhtfTE4MVJOroZLb+dmPntYQsz1tbbbMiQG6cVh7pAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31c3720898f104ec10a306aa69870e9b3c4b30abcc502839871a6a4bac7096e4","last_reissued_at":"2026-05-18T00:40:03.295211Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:03.295211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.10427","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-18T00:40:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7EqKqWh0VvJE0E5rD/gMev16N2lp8USWxP4ZO/DhrVOJ/tfffIiPiFCG4uedNaae79QRTBCoveI+pWMRnPK3DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:25:59.034638Z"},"content_sha256":"cea32e7d48b4b888ea083cd32efb97c26d314552a1587a07f4c25eba90a4fa3c","schema_version":"1.0","event_id":"sha256:cea32e7d48b4b888ea083cd32efb97c26d314552a1587a07f4c25eba90a4fa3c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GHBXECEY6ECOYEFDA2VGTBYOTM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning-based Formal Synthesis of Cooperative Multi-agent Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.SY","authors_text":"Alessandro Benini, Hai Lin, Jin Dai, Kimon P. Valavanis, Matthew J. Rutherford, Panos J. Antsaklis","submitted_at":"2017-05-30T01:39:45Z","abstract_excerpt":"We propose a formal design framework for synthesizing coordination and control policies for cooperative multi-agent systems to accomplish a global mission. The global performance requirements are specified as regular languages while dynamics of each agent as well as the shared environment are characterized by finite automata, upon on which a formal design approach is carried out via divide-and-conquer. Specifically, the global mission is decomposed into local tasks; and local mission supervisors are designed to accomplish these local tasks while maintaining the multi-agent performance by integ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10427","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","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":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:40:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qu+Ync2qdzn6xuFokF6tMbrLMzlDKbvzbztdG8GJpxB6AAElTnaW1deqtzmvNC3aP/2PF8/P0J6OfYRsuZpJDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:25:59.034991Z"},"content_sha256":"c452a6a1067afe8fcda97ade96187d4ccf574669439bf6ac6f50ee5c1ec0692f","schema_version":"1.0","event_id":"sha256:c452a6a1067afe8fcda97ade96187d4ccf574669439bf6ac6f50ee5c1ec0692f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GHBXECEY6ECOYEFDA2VGTBYOTM/bundle.json","state_url":"https://pith.science/pith/GHBXECEY6ECOYEFDA2VGTBYOTM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GHBXECEY6ECOYEFDA2VGTBYOTM/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-05-28T07:25:59Z","links":{"resolver":"https://pith.science/pith/GHBXECEY6ECOYEFDA2VGTBYOTM","bundle":"https://pith.science/pith/GHBXECEY6ECOYEFDA2VGTBYOTM/bundle.json","state":"https://pith.science/pith/GHBXECEY6ECOYEFDA2VGTBYOTM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GHBXECEY6ECOYEFDA2VGTBYOTM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GHBXECEY6ECOYEFDA2VGTBYOTM","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":"ebefe10a9acfbab5465c24e242a1e3da828a63a692ca8b96b84a27f46a262b5a","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-05-30T01:39:45Z","title_canon_sha256":"be7e2d24c59d031fad36a2fc7ef8c793348b9786c50a86d17ce7f1e7f040965e"},"schema_version":"1.0","source":{"id":"1705.10427","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.10427","created_at":"2026-05-18T00:40:03Z"},{"alias_kind":"arxiv_version","alias_value":"1705.10427v1","created_at":"2026-05-18T00:40:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10427","created_at":"2026-05-18T00:40:03Z"},{"alias_kind":"pith_short_12","alias_value":"GHBXECEY6ECO","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"GHBXECEY6ECOYEFD","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"GHBXECEY","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:c452a6a1067afe8fcda97ade96187d4ccf574669439bf6ac6f50ee5c1ec0692f","target":"graph","created_at":"2026-05-18T00:40:03Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We propose a formal design framework for synthesizing coordination and control policies for cooperative multi-agent systems to accomplish a global mission. The global performance requirements are specified as regular languages while dynamics of each agent as well as the shared environment are characterized by finite automata, upon on which a formal design approach is carried out via divide-and-conquer. Specifically, the global mission is decomposed into local tasks; and local mission supervisors are designed to accomplish these local tasks while maintaining the multi-agent performance by integ","authors_text":"Alessandro Benini, Hai Lin, Jin Dai, Kimon P. Valavanis, Matthew J. Rutherford, Panos J. Antsaklis","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-05-30T01:39:45Z","title":"Learning-based Formal Synthesis of Cooperative Multi-agent Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10427","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:cea32e7d48b4b888ea083cd32efb97c26d314552a1587a07f4c25eba90a4fa3c","target":"record","created_at":"2026-05-18T00:40:03Z","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":"ebefe10a9acfbab5465c24e242a1e3da828a63a692ca8b96b84a27f46a262b5a","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-05-30T01:39:45Z","title_canon_sha256":"be7e2d24c59d031fad36a2fc7ef8c793348b9786c50a86d17ce7f1e7f040965e"},"schema_version":"1.0","source":{"id":"1705.10427","kind":"arxiv","version":1}},"canonical_sha256":"31c3720898f104ec10a306aa69870e9b3c4b30abcc502839871a6a4bac7096e4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"31c3720898f104ec10a306aa69870e9b3c4b30abcc502839871a6a4bac7096e4","first_computed_at":"2026-05-18T00:40:03.295211Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:03.295211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v8uZ9F9hVMlm+tmQEU3hAytwFXzyjResYbv1ojY5H5MIhtfTE4MVJOroZLb+dmPntYQsz1tbbbMiQG6cVh7pAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:03.295653Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.10427","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cea32e7d48b4b888ea083cd32efb97c26d314552a1587a07f4c25eba90a4fa3c","sha256:c452a6a1067afe8fcda97ade96187d4ccf574669439bf6ac6f50ee5c1ec0692f"],"state_sha256":"2617cd36a82c911e8cad12a4e6b4138dd5bf554bec5b3a15603ad337628d014f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l+5eq3qywwpwVktI9QgWLNuYTc3n6ixGFUM+PLTPdIGWgwZ5wO16bZgMLnFYhlDYXQjiasufu7YsIdX6GWNCCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T07:25:59.037225Z","bundle_sha256":"e47e25da60f05be0bbdc3373061d8117bd08e8c825367fde9242e00e3df32928"}}