{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ICPGRZVFPEOAU6VJLBPZANESM2","short_pith_number":"pith:ICPGRZVF","canonical_record":{"source":{"id":"1802.09921","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-02-24T13:30:40Z","cross_cats_sorted":[],"title_canon_sha256":"e023ea6157bd25318d3c47b391d7e52aae7b71c104063cddc9bf7858fb767f42","abstract_canon_sha256":"346b96427ad81335ef83de2d4ca4f6e617549dfddf0eae083032681082d28487"},"schema_version":"1.0"},"canonical_sha256":"409e68e6a5791c0a7aa9585f90349266ab0ca2697df91c91ddbe62e2f66eb732","source":{"kind":"arxiv","id":"1802.09921","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.09921","created_at":"2026-05-18T00:22:21Z"},{"alias_kind":"arxiv_version","alias_value":"1802.09921v1","created_at":"2026-05-18T00:22:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09921","created_at":"2026-05-18T00:22:21Z"},{"alias_kind":"pith_short_12","alias_value":"ICPGRZVFPEOA","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"ICPGRZVFPEOAU6VJ","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"ICPGRZVF","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ICPGRZVFPEOAU6VJLBPZANESM2","target":"record","payload":{"canonical_record":{"source":{"id":"1802.09921","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-02-24T13:30:40Z","cross_cats_sorted":[],"title_canon_sha256":"e023ea6157bd25318d3c47b391d7e52aae7b71c104063cddc9bf7858fb767f42","abstract_canon_sha256":"346b96427ad81335ef83de2d4ca4f6e617549dfddf0eae083032681082d28487"},"schema_version":"1.0"},"canonical_sha256":"409e68e6a5791c0a7aa9585f90349266ab0ca2697df91c91ddbe62e2f66eb732","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:21.894956Z","signature_b64":"oMW0q+6wyRxQrt3nTEaj/iJqQwNzSui0NSjmc0w5Ac2iswWXp4t8ekKqbJPuDx2X1oPru3A8RWJVXjeQma3fBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"409e68e6a5791c0a7aa9585f90349266ab0ca2697df91c91ddbe62e2f66eb732","last_reissued_at":"2026-05-18T00:22:21.894366Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:21.894366Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.09921","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:22:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZwX8iwBgX3AvF25UrWYYwYYOwJ3oeNQBsgYR3dNdvFePPpjdFPClh2l4ZRnUz6k67y0ofMh9gzlcp0L9UMqXAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T22:59:58.359585Z"},"content_sha256":"6c6811452d647979b4b49de6a9bc380d075741732774e05edf4f258e53ddc8ae","schema_version":"1.0","event_id":"sha256:6c6811452d647979b4b49de6a9bc380d075741732774e05edf4f258e53ddc8ae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ICPGRZVFPEOAU6VJLBPZANESM2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximating the Region of Multi-Task Coordination via the Optimal Lyapunov-Like Barrier Function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Dimitra Panagou, Dongkun Han, Lixing Huang","submitted_at":"2018-02-24T13:30:40Z","abstract_excerpt":"We consider the multi-task coordination problem for multi-agent systems under the following objectives: 1. collision avoidance; 2. connectivity maintenance; 3. convergence to desired destinations. The paper focuses on the safety guaranteed region of multi-task coordination (SG-RMTC), i.e., the set of initial states from which all trajectories converge to the desired configuration, while at the same time achieve the multi-task coordination and avoid unsafe sets. In contrast to estimating the domain of attraction via Lyapunov functions, the main underlying idea is to employ the sublevel sets of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09921","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:22:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ai1LK8tbXzCueTtCCV5ogNY+iYnK6pRLGFf28PeTe9qQvR6TkpWZk1ms6++24ZpYuE5N+tmB1GMUgcWcHTaDDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T22:59:58.359934Z"},"content_sha256":"5928fb2d485ffb6585c2568f240cb63a76b999f1c60ad8e521f6c3508f67c752","schema_version":"1.0","event_id":"sha256:5928fb2d485ffb6585c2568f240cb63a76b999f1c60ad8e521f6c3508f67c752"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ICPGRZVFPEOAU6VJLBPZANESM2/bundle.json","state_url":"https://pith.science/pith/ICPGRZVFPEOAU6VJLBPZANESM2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ICPGRZVFPEOAU6VJLBPZANESM2/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-07-01T22:59:58Z","links":{"resolver":"https://pith.science/pith/ICPGRZVFPEOAU6VJLBPZANESM2","bundle":"https://pith.science/pith/ICPGRZVFPEOAU6VJLBPZANESM2/bundle.json","state":"https://pith.science/pith/ICPGRZVFPEOAU6VJLBPZANESM2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ICPGRZVFPEOAU6VJLBPZANESM2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ICPGRZVFPEOAU6VJLBPZANESM2","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":"346b96427ad81335ef83de2d4ca4f6e617549dfddf0eae083032681082d28487","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-02-24T13:30:40Z","title_canon_sha256":"e023ea6157bd25318d3c47b391d7e52aae7b71c104063cddc9bf7858fb767f42"},"schema_version":"1.0","source":{"id":"1802.09921","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.09921","created_at":"2026-05-18T00:22:21Z"},{"alias_kind":"arxiv_version","alias_value":"1802.09921v1","created_at":"2026-05-18T00:22:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09921","created_at":"2026-05-18T00:22:21Z"},{"alias_kind":"pith_short_12","alias_value":"ICPGRZVFPEOA","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"ICPGRZVFPEOAU6VJ","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"ICPGRZVF","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:5928fb2d485ffb6585c2568f240cb63a76b999f1c60ad8e521f6c3508f67c752","target":"graph","created_at":"2026-05-18T00:22:21Z","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 consider the multi-task coordination problem for multi-agent systems under the following objectives: 1. collision avoidance; 2. connectivity maintenance; 3. convergence to desired destinations. The paper focuses on the safety guaranteed region of multi-task coordination (SG-RMTC), i.e., the set of initial states from which all trajectories converge to the desired configuration, while at the same time achieve the multi-task coordination and avoid unsafe sets. In contrast to estimating the domain of attraction via Lyapunov functions, the main underlying idea is to employ the sublevel sets of ","authors_text":"Dimitra Panagou, Dongkun Han, Lixing Huang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-02-24T13:30:40Z","title":"Approximating the Region of Multi-Task Coordination via the Optimal Lyapunov-Like Barrier Function"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09921","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:6c6811452d647979b4b49de6a9bc380d075741732774e05edf4f258e53ddc8ae","target":"record","created_at":"2026-05-18T00:22:21Z","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":"346b96427ad81335ef83de2d4ca4f6e617549dfddf0eae083032681082d28487","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-02-24T13:30:40Z","title_canon_sha256":"e023ea6157bd25318d3c47b391d7e52aae7b71c104063cddc9bf7858fb767f42"},"schema_version":"1.0","source":{"id":"1802.09921","kind":"arxiv","version":1}},"canonical_sha256":"409e68e6a5791c0a7aa9585f90349266ab0ca2697df91c91ddbe62e2f66eb732","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"409e68e6a5791c0a7aa9585f90349266ab0ca2697df91c91ddbe62e2f66eb732","first_computed_at":"2026-05-18T00:22:21.894366Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:21.894366Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oMW0q+6wyRxQrt3nTEaj/iJqQwNzSui0NSjmc0w5Ac2iswWXp4t8ekKqbJPuDx2X1oPru3A8RWJVXjeQma3fBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:21.894956Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.09921","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c6811452d647979b4b49de6a9bc380d075741732774e05edf4f258e53ddc8ae","sha256:5928fb2d485ffb6585c2568f240cb63a76b999f1c60ad8e521f6c3508f67c752"],"state_sha256":"1a2b7c68e4001ed33766cb90619319c1643eb1f13384ab264afd0e541a6b3139"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZoozrKRun7WNebAgzuVuGmzz1TW2903YxMrmv422WF1mTergjylIhK2B7PO+kpjRQX9U0PIEO51prRKUe7GtCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T22:59:58.361976Z","bundle_sha256":"f75f97066e78407d1497f9973292512039498700c2334f55704fa6484162d1a2"}}