{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:64KWIS4PO6SPXXRNJ7UPOARWMD","short_pith_number":"pith:64KWIS4P","canonical_record":{"source":{"id":"1509.09137","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-09-30T11:53:39Z","cross_cats_sorted":[],"title_canon_sha256":"311078e33a25b9f240704f2638eda23f61e93ff456460c724e5bd90bb65d1dbb","abstract_canon_sha256":"a98de8303746d171afe842a3e6859bc520cc2cd4d46bd86241fd414c64fa0c79"},"schema_version":"1.0"},"canonical_sha256":"f715644b8f77a4fbde2d4fe8f7023660e022d14f603bdee0d055292be90aad94","source":{"kind":"arxiv","id":"1509.09137","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.09137","created_at":"2026-05-18T01:31:27Z"},{"alias_kind":"arxiv_version","alias_value":"1509.09137v1","created_at":"2026-05-18T01:31:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.09137","created_at":"2026-05-18T01:31:27Z"},{"alias_kind":"pith_short_12","alias_value":"64KWIS4PO6SP","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"64KWIS4PO6SPXXRN","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"64KWIS4P","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:64KWIS4PO6SPXXRNJ7UPOARWMD","target":"record","payload":{"canonical_record":{"source":{"id":"1509.09137","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-09-30T11:53:39Z","cross_cats_sorted":[],"title_canon_sha256":"311078e33a25b9f240704f2638eda23f61e93ff456460c724e5bd90bb65d1dbb","abstract_canon_sha256":"a98de8303746d171afe842a3e6859bc520cc2cd4d46bd86241fd414c64fa0c79"},"schema_version":"1.0"},"canonical_sha256":"f715644b8f77a4fbde2d4fe8f7023660e022d14f603bdee0d055292be90aad94","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:31:27.012441Z","signature_b64":"L/Me8LV586iYWsrwNUwJuL8odxqihvOYiShGKmQejubCiQ2a9Eye4CH7hM97imc3mrl+5uUWzLMP1WzXGx0jCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f715644b8f77a4fbde2d4fe8f7023660e022d14f603bdee0d055292be90aad94","last_reissued_at":"2026-05-18T01:31:27.011779Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:31:27.011779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.09137","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-18T01:31:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i2dFrsejs8NYqam5gdX530v/8zZTZTMorULQbD08hZqFdRWu0ng8TD3mSP7lKd/ajz6RK2KnqO7yVuklHNeAAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:34:13.319935Z"},"content_sha256":"35eeb57d4bbdc69dee4138b57dd835c2edc4358e350b39099ea14024c6ab9ac3","schema_version":"1.0","event_id":"sha256:35eeb57d4bbdc69dee4138b57dd835c2edc4358e350b39099ea14024c6ab9ac3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:64KWIS4PO6SPXXRNJ7UPOARWMD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cooperative Task Planning of Multi-Agent Systems Under Timed Temporal Specifications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Alexandros Nikou, Dimos V. Dimarogonas, Jana Tumova","submitted_at":"2015-09-30T11:53:39Z","abstract_excerpt":"In this paper the problem of cooperative task planning of multi-agent systems when timed constraints are imposed to the system is investigated. We consider timed constraints given by Metric Interval Temporal Logic (MITL). We propose a method for automatic control synthesis in a two-stage systematic procedure. With this method we guarantee that all the agents satisfy their own individual task specifications as well as that the team satisfies a team global task specification."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.09137","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-18T01:31:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SgfhBVt66T4VAPIRUfCGu7TqCgJYqJrWBEIPx7YEidR++Aa5xwfb00I1KOddF9pUfta3wi4l7Y5J/kUDYa5lAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:34:13.320281Z"},"content_sha256":"3f71b043a0a8391aad6f8684b74e6c95ad9385420fc3764aef8ec92265d4e6f1","schema_version":"1.0","event_id":"sha256:3f71b043a0a8391aad6f8684b74e6c95ad9385420fc3764aef8ec92265d4e6f1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/64KWIS4PO6SPXXRNJ7UPOARWMD/bundle.json","state_url":"https://pith.science/pith/64KWIS4PO6SPXXRNJ7UPOARWMD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/64KWIS4PO6SPXXRNJ7UPOARWMD/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:34:13Z","links":{"resolver":"https://pith.science/pith/64KWIS4PO6SPXXRNJ7UPOARWMD","bundle":"https://pith.science/pith/64KWIS4PO6SPXXRNJ7UPOARWMD/bundle.json","state":"https://pith.science/pith/64KWIS4PO6SPXXRNJ7UPOARWMD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/64KWIS4PO6SPXXRNJ7UPOARWMD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:64KWIS4PO6SPXXRNJ7UPOARWMD","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":"a98de8303746d171afe842a3e6859bc520cc2cd4d46bd86241fd414c64fa0c79","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-09-30T11:53:39Z","title_canon_sha256":"311078e33a25b9f240704f2638eda23f61e93ff456460c724e5bd90bb65d1dbb"},"schema_version":"1.0","source":{"id":"1509.09137","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.09137","created_at":"2026-05-18T01:31:27Z"},{"alias_kind":"arxiv_version","alias_value":"1509.09137v1","created_at":"2026-05-18T01:31:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.09137","created_at":"2026-05-18T01:31:27Z"},{"alias_kind":"pith_short_12","alias_value":"64KWIS4PO6SP","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"64KWIS4PO6SPXXRN","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"64KWIS4P","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:3f71b043a0a8391aad6f8684b74e6c95ad9385420fc3764aef8ec92265d4e6f1","target":"graph","created_at":"2026-05-18T01:31:27Z","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":"In this paper the problem of cooperative task planning of multi-agent systems when timed constraints are imposed to the system is investigated. We consider timed constraints given by Metric Interval Temporal Logic (MITL). We propose a method for automatic control synthesis in a two-stage systematic procedure. With this method we guarantee that all the agents satisfy their own individual task specifications as well as that the team satisfies a team global task specification.","authors_text":"Alexandros Nikou, Dimos V. Dimarogonas, Jana Tumova","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-09-30T11:53:39Z","title":"Cooperative Task Planning of Multi-Agent Systems Under Timed Temporal Specifications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.09137","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:35eeb57d4bbdc69dee4138b57dd835c2edc4358e350b39099ea14024c6ab9ac3","target":"record","created_at":"2026-05-18T01:31:27Z","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":"a98de8303746d171afe842a3e6859bc520cc2cd4d46bd86241fd414c64fa0c79","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-09-30T11:53:39Z","title_canon_sha256":"311078e33a25b9f240704f2638eda23f61e93ff456460c724e5bd90bb65d1dbb"},"schema_version":"1.0","source":{"id":"1509.09137","kind":"arxiv","version":1}},"canonical_sha256":"f715644b8f77a4fbde2d4fe8f7023660e022d14f603bdee0d055292be90aad94","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f715644b8f77a4fbde2d4fe8f7023660e022d14f603bdee0d055292be90aad94","first_computed_at":"2026-05-18T01:31:27.011779Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:31:27.011779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L/Me8LV586iYWsrwNUwJuL8odxqihvOYiShGKmQejubCiQ2a9Eye4CH7hM97imc3mrl+5uUWzLMP1WzXGx0jCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:31:27.012441Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.09137","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:35eeb57d4bbdc69dee4138b57dd835c2edc4358e350b39099ea14024c6ab9ac3","sha256:3f71b043a0a8391aad6f8684b74e6c95ad9385420fc3764aef8ec92265d4e6f1"],"state_sha256":"52b680056f89980a3b319b8337e23bb9c20d8330ada308e5bd4acafaf92da0ec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c2O2hsNOJi82wmi5ddXRNysL1HkhUGnf7lQ2gLMoOD6uN/jk67FOFZCNO3tBv0gIMg5tKOLrz0SK1KgOYmHYBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T02:34:13.322387Z","bundle_sha256":"cba2d5edd6b725761e0fd2bc29b2325c9cc2b607e4251771ecd9f0910a8c73cd"}}