{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:2AE4D6577M5AF2FGHZ45XLWAK7","short_pith_number":"pith:2AE4D657","canonical_record":{"source":{"id":"1703.06070","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-03-17T16:13:09Z","cross_cats_sorted":[],"title_canon_sha256":"76a812f5e0cc8ddb101057ae4804a2fd530447451be5dbe18c9204dc7ce1c359","abstract_canon_sha256":"92a9f08fe7f57524c6fa2413fa4caeee8621eec959cc7f842d663bf2ef380255"},"schema_version":"1.0"},"canonical_sha256":"d009c1fbbffb3a02e8a63e79dbaec057c2dd22cdece4024591b563745f4f97c3","source":{"kind":"arxiv","id":"1703.06070","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.06070","created_at":"2026-05-18T00:47:56Z"},{"alias_kind":"arxiv_version","alias_value":"1703.06070v2","created_at":"2026-05-18T00:47:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.06070","created_at":"2026-05-18T00:47:56Z"},{"alias_kind":"pith_short_12","alias_value":"2AE4D6577M5A","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2AE4D6577M5AF2FG","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2AE4D657","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:2AE4D6577M5AF2FGHZ45XLWAK7","target":"record","payload":{"canonical_record":{"source":{"id":"1703.06070","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-03-17T16:13:09Z","cross_cats_sorted":[],"title_canon_sha256":"76a812f5e0cc8ddb101057ae4804a2fd530447451be5dbe18c9204dc7ce1c359","abstract_canon_sha256":"92a9f08fe7f57524c6fa2413fa4caeee8621eec959cc7f842d663bf2ef380255"},"schema_version":"1.0"},"canonical_sha256":"d009c1fbbffb3a02e8a63e79dbaec057c2dd22cdece4024591b563745f4f97c3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:56.296609Z","signature_b64":"eMOb9DaanMM21yVDFBxii2udVo2751FOA11wMRR3IuMgT53DhFXA32Hyc0OdZXm3uotfEqj5SxxdxpoArBc/Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d009c1fbbffb3a02e8a63e79dbaec057c2dd22cdece4024591b563745f4f97c3","last_reissued_at":"2026-05-18T00:47:56.296167Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:56.296167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.06070","source_version":2,"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:47:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ssnthwNdKSUzd/cszWPvLM3i7J2wEvD/r4sZmPdh00jKMHfLLR5aKdtl6E1rXInqjRfmcugBT49H5DvkO2l6Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T06:00:40.155532Z"},"content_sha256":"2cb3c42330a84b8320239ab9b7e3e39685e17ba5cf4f2da83ce1a2194f17b7ff","schema_version":"1.0","event_id":"sha256:2cb3c42330a84b8320239ab9b7e3e39685e17ba5cf4f2da83ce1a2194f17b7ff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:2AE4D6577M5AF2FGHZ45XLWAK7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decentralized Abstractions and Timed Constrained Planning of a General Class of Coupled Multi-Agent Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Alexandros Nikou, Christos Verginis, Dimos V. Dimarogonas, Shahab Heshmati-Alamdari","submitted_at":"2017-03-17T16:13:09Z","abstract_excerpt":"This paper presents a fully automated procedure for controller synthesis for a general class of multi-agent systems under coupling constraints. Each agent is modeled with dynamics consisting of two terms: the first one models the coupling constraints and the other one is an additional bounded control input. We aim to design these inputs so that each agent meets an individual high-level specification given as a Metric Interval Temporal Logic (MITL). Furthermore, the connectivity of the initially connected agents, is required to be maintained. First, assuming a polyhedral partition of the worksp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.06070","kind":"arxiv","version":2},"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:47:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WHjd+sEGqyn7pb+91PRp0mk2ahwfvSax9+UzWehHyQK2yjhOHFaC6Rhx0oBUZGspRek0V7NUXOStQW2t2eVkCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T06:00:40.156340Z"},"content_sha256":"f55f2614f1aad343971d5b1eafaea1c7e04f582891ec67d3ff206612303171ec","schema_version":"1.0","event_id":"sha256:f55f2614f1aad343971d5b1eafaea1c7e04f582891ec67d3ff206612303171ec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2AE4D6577M5AF2FGHZ45XLWAK7/bundle.json","state_url":"https://pith.science/pith/2AE4D6577M5AF2FGHZ45XLWAK7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2AE4D6577M5AF2FGHZ45XLWAK7/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-08-18T06:00:40Z","links":{"resolver":"https://pith.science/pith/2AE4D6577M5AF2FGHZ45XLWAK7","bundle":"https://pith.science/pith/2AE4D6577M5AF2FGHZ45XLWAK7/bundle.json","state":"https://pith.science/pith/2AE4D6577M5AF2FGHZ45XLWAK7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2AE4D6577M5AF2FGHZ45XLWAK7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:2AE4D6577M5AF2FGHZ45XLWAK7","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":"92a9f08fe7f57524c6fa2413fa4caeee8621eec959cc7f842d663bf2ef380255","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-03-17T16:13:09Z","title_canon_sha256":"76a812f5e0cc8ddb101057ae4804a2fd530447451be5dbe18c9204dc7ce1c359"},"schema_version":"1.0","source":{"id":"1703.06070","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.06070","created_at":"2026-05-18T00:47:56Z"},{"alias_kind":"arxiv_version","alias_value":"1703.06070v2","created_at":"2026-05-18T00:47:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.06070","created_at":"2026-05-18T00:47:56Z"},{"alias_kind":"pith_short_12","alias_value":"2AE4D6577M5A","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2AE4D6577M5AF2FG","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2AE4D657","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:f55f2614f1aad343971d5b1eafaea1c7e04f582891ec67d3ff206612303171ec","target":"graph","created_at":"2026-05-18T00:47: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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"This paper presents a fully automated procedure for controller synthesis for a general class of multi-agent systems under coupling constraints. Each agent is modeled with dynamics consisting of two terms: the first one models the coupling constraints and the other one is an additional bounded control input. We aim to design these inputs so that each agent meets an individual high-level specification given as a Metric Interval Temporal Logic (MITL). Furthermore, the connectivity of the initially connected agents, is required to be maintained. First, assuming a polyhedral partition of the worksp","authors_text":"Alexandros Nikou, Christos Verginis, Dimos V. Dimarogonas, Shahab Heshmati-Alamdari","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-03-17T16:13:09Z","title":"Decentralized Abstractions and Timed Constrained Planning of a General Class of Coupled Multi-Agent Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.06070","kind":"arxiv","version":2},"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:2cb3c42330a84b8320239ab9b7e3e39685e17ba5cf4f2da83ce1a2194f17b7ff","target":"record","created_at":"2026-05-18T00:47: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":"92a9f08fe7f57524c6fa2413fa4caeee8621eec959cc7f842d663bf2ef380255","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-03-17T16:13:09Z","title_canon_sha256":"76a812f5e0cc8ddb101057ae4804a2fd530447451be5dbe18c9204dc7ce1c359"},"schema_version":"1.0","source":{"id":"1703.06070","kind":"arxiv","version":2}},"canonical_sha256":"d009c1fbbffb3a02e8a63e79dbaec057c2dd22cdece4024591b563745f4f97c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d009c1fbbffb3a02e8a63e79dbaec057c2dd22cdece4024591b563745f4f97c3","first_computed_at":"2026-05-18T00:47:56.296167Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:56.296167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eMOb9DaanMM21yVDFBxii2udVo2751FOA11wMRR3IuMgT53DhFXA32Hyc0OdZXm3uotfEqj5SxxdxpoArBc/Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:56.296609Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.06070","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2cb3c42330a84b8320239ab9b7e3e39685e17ba5cf4f2da83ce1a2194f17b7ff","sha256:f55f2614f1aad343971d5b1eafaea1c7e04f582891ec67d3ff206612303171ec"],"state_sha256":"dbe5cf410abdb0291e10b9c3086d7f80a2c283af8714012df971dc43fabd4d16"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c5JAyhjTInkfkhxe4zDBwwCYQQeEyfdJ5jkYegTtO1/m8rk6jfvh55wzd9fckEnXOGealg0F1VCDTBJEcVeWBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T06:00:40.163613Z","bundle_sha256":"fbcbc7576dd3a1fc264522b6e699a7de33ae3c57b8045059d3de633b6d4c9942"}}