{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:R2RUJTUH3OXODEIM3SV6745UKZ","short_pith_number":"pith:R2RUJTUH","canonical_record":{"source":{"id":"1804.10018","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-04-26T12:35:13Z","cross_cats_sorted":[],"title_canon_sha256":"4037c849b1eb0ad6093172a6ba157341918c344d0f63afa680896570e306ad14","abstract_canon_sha256":"e16f98fd6fe71b22f4a6f08170117060690b907ded56f852c8a49f17e94c2395"},"schema_version":"1.0"},"canonical_sha256":"8ea344ce87dbaee1910cdcabeff3b4564587f329d5ab94fa304daddceb570050","source":{"kind":"arxiv","id":"1804.10018","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.10018","created_at":"2026-05-18T00:05:23Z"},{"alias_kind":"arxiv_version","alias_value":"1804.10018v2","created_at":"2026-05-18T00:05:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10018","created_at":"2026-05-18T00:05:23Z"},{"alias_kind":"pith_short_12","alias_value":"R2RUJTUH3OXO","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"R2RUJTUH3OXODEIM","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"R2RUJTUH","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:R2RUJTUH3OXODEIM3SV6745UKZ","target":"record","payload":{"canonical_record":{"source":{"id":"1804.10018","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-04-26T12:35:13Z","cross_cats_sorted":[],"title_canon_sha256":"4037c849b1eb0ad6093172a6ba157341918c344d0f63afa680896570e306ad14","abstract_canon_sha256":"e16f98fd6fe71b22f4a6f08170117060690b907ded56f852c8a49f17e94c2395"},"schema_version":"1.0"},"canonical_sha256":"8ea344ce87dbaee1910cdcabeff3b4564587f329d5ab94fa304daddceb570050","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:23.584546Z","signature_b64":"J8LPFdmaYuVXFHALcnLRIMflFUPK9bnElux6OZb45uhceWJo+7NtVukbCjkB8n4oMS+r4u3iNP+zcgMacRg6AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ea344ce87dbaee1910cdcabeff3b4564587f329d5ab94fa304daddceb570050","last_reissued_at":"2026-05-18T00:05:23.583900Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:23.583900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.10018","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:05:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"omjjdmuqL9IpPqiemuDDhBYawAYG8YAgDb8ct/ANWsBQGNvfQED0DRvE3kx1PbcvIf2xYY+dw7RLM60V94lDBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T13:42:16.876752Z"},"content_sha256":"f395411d3706a658ff61389d0195258af289c7c2dfaa4c15c58f97c12d2cfe23","schema_version":"1.0","event_id":"sha256:f395411d3706a658ff61389d0195258af289c7c2dfaa4c15c58f97c12d2cfe23"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:R2RUJTUH3OXODEIM3SV6745UKZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Time-constrained multi-agent task scheduling based on prescribed performance control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Dimos V. Dimarogonas, Pian Yu","submitted_at":"2018-04-26T12:35:13Z","abstract_excerpt":"The problem of time-constrained multi-agent task scheduling and control synthesis is addressed. We assume the existence of a high level plan which consists of a sequence of cooperative tasks, each of which is associated with a deadline and several Quality-of-Service levels. By taking into account the reward and cost of satisfying each task, a novel scheduling problem is formulated and a path synthesis algorithm is proposed. Based on the obtained plan, a distributed hybrid control law is further designed for each agent. Under the condition that only a subset of the agents are aware of the high "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10018","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:05:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i1YaMr/PFNnRuiUTHkYTzJNmZmu76Kh5lq2pIKHtG7Wi5/J6w/zHrqc+J6BOL7pBGSaUPKaWt0lSuJneKTcqBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T13:42:16.877098Z"},"content_sha256":"3a170c22490df8cfc261e299de5cfed0f17d0c99a3402484f04f104d8f1c912b","schema_version":"1.0","event_id":"sha256:3a170c22490df8cfc261e299de5cfed0f17d0c99a3402484f04f104d8f1c912b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R2RUJTUH3OXODEIM3SV6745UKZ/bundle.json","state_url":"https://pith.science/pith/R2RUJTUH3OXODEIM3SV6745UKZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R2RUJTUH3OXODEIM3SV6745UKZ/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-01T13:42:16Z","links":{"resolver":"https://pith.science/pith/R2RUJTUH3OXODEIM3SV6745UKZ","bundle":"https://pith.science/pith/R2RUJTUH3OXODEIM3SV6745UKZ/bundle.json","state":"https://pith.science/pith/R2RUJTUH3OXODEIM3SV6745UKZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R2RUJTUH3OXODEIM3SV6745UKZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:R2RUJTUH3OXODEIM3SV6745UKZ","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":"e16f98fd6fe71b22f4a6f08170117060690b907ded56f852c8a49f17e94c2395","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-04-26T12:35:13Z","title_canon_sha256":"4037c849b1eb0ad6093172a6ba157341918c344d0f63afa680896570e306ad14"},"schema_version":"1.0","source":{"id":"1804.10018","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.10018","created_at":"2026-05-18T00:05:23Z"},{"alias_kind":"arxiv_version","alias_value":"1804.10018v2","created_at":"2026-05-18T00:05:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10018","created_at":"2026-05-18T00:05:23Z"},{"alias_kind":"pith_short_12","alias_value":"R2RUJTUH3OXO","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"R2RUJTUH3OXODEIM","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"R2RUJTUH","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:3a170c22490df8cfc261e299de5cfed0f17d0c99a3402484f04f104d8f1c912b","target":"graph","created_at":"2026-05-18T00:05:23Z","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":"The problem of time-constrained multi-agent task scheduling and control synthesis is addressed. We assume the existence of a high level plan which consists of a sequence of cooperative tasks, each of which is associated with a deadline and several Quality-of-Service levels. By taking into account the reward and cost of satisfying each task, a novel scheduling problem is formulated and a path synthesis algorithm is proposed. Based on the obtained plan, a distributed hybrid control law is further designed for each agent. Under the condition that only a subset of the agents are aware of the high ","authors_text":"Dimos V. Dimarogonas, Pian Yu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-04-26T12:35:13Z","title":"Time-constrained multi-agent task scheduling based on prescribed performance control"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10018","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:f395411d3706a658ff61389d0195258af289c7c2dfaa4c15c58f97c12d2cfe23","target":"record","created_at":"2026-05-18T00:05:23Z","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":"e16f98fd6fe71b22f4a6f08170117060690b907ded56f852c8a49f17e94c2395","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-04-26T12:35:13Z","title_canon_sha256":"4037c849b1eb0ad6093172a6ba157341918c344d0f63afa680896570e306ad14"},"schema_version":"1.0","source":{"id":"1804.10018","kind":"arxiv","version":2}},"canonical_sha256":"8ea344ce87dbaee1910cdcabeff3b4564587f329d5ab94fa304daddceb570050","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ea344ce87dbaee1910cdcabeff3b4564587f329d5ab94fa304daddceb570050","first_computed_at":"2026-05-18T00:05:23.583900Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:23.583900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"J8LPFdmaYuVXFHALcnLRIMflFUPK9bnElux6OZb45uhceWJo+7NtVukbCjkB8n4oMS+r4u3iNP+zcgMacRg6AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:23.584546Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.10018","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f395411d3706a658ff61389d0195258af289c7c2dfaa4c15c58f97c12d2cfe23","sha256:3a170c22490df8cfc261e299de5cfed0f17d0c99a3402484f04f104d8f1c912b"],"state_sha256":"332858833d2ad86b6e14af4e7c36e365e14b3e5d4269134248f02cce60b1f94c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SFiDfIbFjdkyiBIGWFgb+BdyUHYFw62q3wiSEVQrXFY9OtI/PU0xePmx8XDHCYXzz3IY/k5EZhn3sW0yMm0DCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T13:42:16.879124Z","bundle_sha256":"96fdfff1947c85be4290a13dab4bff804d44ef010b17a4b9b0e1e990a8533958"}}