{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:63YI7JBYHA2FI5JN7J75XKVQER","short_pith_number":"pith:63YI7JBY","canonical_record":{"source":{"id":"1709.00615","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-09-02T18:41:06Z","cross_cats_sorted":[],"title_canon_sha256":"a78760dbebb70446adc1a689072faaa398e753127fb1e10594b9aa1fbe181c04","abstract_canon_sha256":"f89bbcae98cb597f898a5d2954565c57c6069e24e4f03306a12698fd589d3781"},"schema_version":"1.0"},"canonical_sha256":"f6f08fa438383454752dfa7fdbaab02462a144e0a12e1c122632cbdf8b30d76c","source":{"kind":"arxiv","id":"1709.00615","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.00615","created_at":"2026-05-18T00:36:07Z"},{"alias_kind":"arxiv_version","alias_value":"1709.00615v1","created_at":"2026-05-18T00:36:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.00615","created_at":"2026-05-18T00:36:07Z"},{"alias_kind":"pith_short_12","alias_value":"63YI7JBYHA2F","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"63YI7JBYHA2FI5JN","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"63YI7JBY","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:63YI7JBYHA2FI5JN7J75XKVQER","target":"record","payload":{"canonical_record":{"source":{"id":"1709.00615","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-09-02T18:41:06Z","cross_cats_sorted":[],"title_canon_sha256":"a78760dbebb70446adc1a689072faaa398e753127fb1e10594b9aa1fbe181c04","abstract_canon_sha256":"f89bbcae98cb597f898a5d2954565c57c6069e24e4f03306a12698fd589d3781"},"schema_version":"1.0"},"canonical_sha256":"f6f08fa438383454752dfa7fdbaab02462a144e0a12e1c122632cbdf8b30d76c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:07.474306Z","signature_b64":"xBJYW6vsts4iS6kYEPCxTpqIa9O4MLvXWeOz40BA3Ctlv9iKc3MsaBCAqPfUdZTS3r3p2aKdV5AmjOCoSkdQDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6f08fa438383454752dfa7fdbaab02462a144e0a12e1c122632cbdf8b30d76c","last_reissued_at":"2026-05-18T00:36:07.473804Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:07.473804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.00615","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:36:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uy7ITD4iFZ8/87sDMFKZJ6QXL6fpmVDtUwVv4FPrRiaI/E54wFPPiNAysCPDsixDqlMzZdIbcdN06lmWGURVAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T03:25:37.859066Z"},"content_sha256":"da23c36747b56b6cfaa464a707116e70c6dbf60609535398329d3f039dbf98f2","schema_version":"1.0","event_id":"sha256:da23c36747b56b6cfaa464a707116e70c6dbf60609535398329d3f039dbf98f2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:63YI7JBYHA2FI5JN7J75XKVQER","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Multi-task Formation Control under Parametric Communication Uncertainties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Dimitra Panagou, Dongkun Han","submitted_at":"2017-09-02T18:41:06Z","abstract_excerpt":"Formation control is a key problem in the coordination of multiple agents. It arises new challenges to traditional formation control strategy when the communication among agents is affected by uncertainties. This paper considers the robust multi-task formation control problem of multiple non-point agents whose communications are disturbed by uncertain parameters. The control objectives include 1. achieving the desired configuration; 2. avoiding collisions; 3. preserving the connectedness of uncertain topology. To achieve these objectives, firstly, a condition of Linear Matrix Inequalities (LMI"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.00615","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:36:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yJdhFM+ezWe686pKQ67SWOuP2zjY+zI0C+Wj6JMGNpVc8AjUpFc8Xq8Txx/S6j0gMnGnRDOzlTGdGrIlJKdGDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T03:25:37.859436Z"},"content_sha256":"4400ab7bf01870c5c5227604959ba964929fc08fb3e56cc713bd41939c4fb72c","schema_version":"1.0","event_id":"sha256:4400ab7bf01870c5c5227604959ba964929fc08fb3e56cc713bd41939c4fb72c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/63YI7JBYHA2FI5JN7J75XKVQER/bundle.json","state_url":"https://pith.science/pith/63YI7JBYHA2FI5JN7J75XKVQER/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/63YI7JBYHA2FI5JN7J75XKVQER/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-02T03:25:37Z","links":{"resolver":"https://pith.science/pith/63YI7JBYHA2FI5JN7J75XKVQER","bundle":"https://pith.science/pith/63YI7JBYHA2FI5JN7J75XKVQER/bundle.json","state":"https://pith.science/pith/63YI7JBYHA2FI5JN7J75XKVQER/state.json","well_known_bundle":"https://pith.science/.well-known/pith/63YI7JBYHA2FI5JN7J75XKVQER/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:63YI7JBYHA2FI5JN7J75XKVQER","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":"f89bbcae98cb597f898a5d2954565c57c6069e24e4f03306a12698fd589d3781","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-09-02T18:41:06Z","title_canon_sha256":"a78760dbebb70446adc1a689072faaa398e753127fb1e10594b9aa1fbe181c04"},"schema_version":"1.0","source":{"id":"1709.00615","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.00615","created_at":"2026-05-18T00:36:07Z"},{"alias_kind":"arxiv_version","alias_value":"1709.00615v1","created_at":"2026-05-18T00:36:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.00615","created_at":"2026-05-18T00:36:07Z"},{"alias_kind":"pith_short_12","alias_value":"63YI7JBYHA2F","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"63YI7JBYHA2FI5JN","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"63YI7JBY","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:4400ab7bf01870c5c5227604959ba964929fc08fb3e56cc713bd41939c4fb72c","target":"graph","created_at":"2026-05-18T00:36:07Z","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":"Formation control is a key problem in the coordination of multiple agents. It arises new challenges to traditional formation control strategy when the communication among agents is affected by uncertainties. This paper considers the robust multi-task formation control problem of multiple non-point agents whose communications are disturbed by uncertain parameters. The control objectives include 1. achieving the desired configuration; 2. avoiding collisions; 3. preserving the connectedness of uncertain topology. To achieve these objectives, firstly, a condition of Linear Matrix Inequalities (LMI","authors_text":"Dimitra Panagou, Dongkun Han","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-09-02T18:41:06Z","title":"Distributed Multi-task Formation Control under Parametric Communication Uncertainties"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.00615","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:da23c36747b56b6cfaa464a707116e70c6dbf60609535398329d3f039dbf98f2","target":"record","created_at":"2026-05-18T00:36:07Z","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":"f89bbcae98cb597f898a5d2954565c57c6069e24e4f03306a12698fd589d3781","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-09-02T18:41:06Z","title_canon_sha256":"a78760dbebb70446adc1a689072faaa398e753127fb1e10594b9aa1fbe181c04"},"schema_version":"1.0","source":{"id":"1709.00615","kind":"arxiv","version":1}},"canonical_sha256":"f6f08fa438383454752dfa7fdbaab02462a144e0a12e1c122632cbdf8b30d76c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f6f08fa438383454752dfa7fdbaab02462a144e0a12e1c122632cbdf8b30d76c","first_computed_at":"2026-05-18T00:36:07.473804Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:07.473804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xBJYW6vsts4iS6kYEPCxTpqIa9O4MLvXWeOz40BA3Ctlv9iKc3MsaBCAqPfUdZTS3r3p2aKdV5AmjOCoSkdQDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:07.474306Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.00615","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da23c36747b56b6cfaa464a707116e70c6dbf60609535398329d3f039dbf98f2","sha256:4400ab7bf01870c5c5227604959ba964929fc08fb3e56cc713bd41939c4fb72c"],"state_sha256":"36ec8f87988060e7cbe6a05b57f5c0a90bc984bc8de3aed571142b7ca9a82943"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uyqwl80jBQdhomoiPMu95PVbAsp7FnJQ3/ccBiEL0GhJkmf6wAueUFfZiwx2S8Ab8CxBo9wjHFATNgunlr3tBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T03:25:37.861503Z","bundle_sha256":"db45f1c0d5ccff106e993186c0a32efcfb28d2298976aa7e91bb43148f2e3f03"}}