{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:VCQ5I7SLNKETATEMSA5XEWWXH2","short_pith_number":"pith:VCQ5I7SL","canonical_record":{"source":{"id":"1508.04727","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-08-19T18:11:17Z","cross_cats_sorted":[],"title_canon_sha256":"942b814f543cdfb173d1dd42f577f68b7f109b0da218bd83323cb69cca61804f","abstract_canon_sha256":"64e518ae7eae70e30018fc2bb22fca20fdcf86fecea3fe23f8802cb82f1a7c6d"},"schema_version":"1.0"},"canonical_sha256":"a8a1d47e4b6a89304c8c903b725ad73e99ab7d662339177f2a7868e9d808911d","source":{"kind":"arxiv","id":"1508.04727","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.04727","created_at":"2026-05-18T01:35:01Z"},{"alias_kind":"arxiv_version","alias_value":"1508.04727v1","created_at":"2026-05-18T01:35:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.04727","created_at":"2026-05-18T01:35:01Z"},{"alias_kind":"pith_short_12","alias_value":"VCQ5I7SLNKET","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"VCQ5I7SLNKETATEM","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"VCQ5I7SL","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:VCQ5I7SLNKETATEMSA5XEWWXH2","target":"record","payload":{"canonical_record":{"source":{"id":"1508.04727","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-08-19T18:11:17Z","cross_cats_sorted":[],"title_canon_sha256":"942b814f543cdfb173d1dd42f577f68b7f109b0da218bd83323cb69cca61804f","abstract_canon_sha256":"64e518ae7eae70e30018fc2bb22fca20fdcf86fecea3fe23f8802cb82f1a7c6d"},"schema_version":"1.0"},"canonical_sha256":"a8a1d47e4b6a89304c8c903b725ad73e99ab7d662339177f2a7868e9d808911d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:01.984853Z","signature_b64":"P8XN8VIEw4rJgbTLQe/V274R1+A4hEq14xe1moOqpCTEMM87s+qKt/OcRS3SvJN0YhGNJKkqjLO61qeCfF0uBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8a1d47e4b6a89304c8c903b725ad73e99ab7d662339177f2a7868e9d808911d","last_reissued_at":"2026-05-18T01:35:01.984310Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:01.984310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.04727","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:35:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"57KeJK54mdcn28xhbnitbOW75gCaPKeCzPPdWeFxxa+u8939eKOPqIZwitNlT/PGdkOjHodq2sBYGtFo48nxBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:28:25.505612Z"},"content_sha256":"c2976592999507eb3e55a9c4b01eadb0357235fcb6857685337039d7ef8c40a5","schema_version":"1.0","event_id":"sha256:c2976592999507eb3e55a9c4b01eadb0357235fcb6857685337039d7ef8c40a5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:VCQ5I7SLNKETATEMSA5XEWWXH2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Dynamic Formation Control of Multi-Agent Systems in Environments with Obstacles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Christos G. Cassandras, Xinmiao Sun","submitted_at":"2015-08-19T18:11:17Z","abstract_excerpt":"We address the optimal dynamic formation problem in mobile leader-follower networks where an optimal formation is generated to maximize a given objective function while continuously preserving connectivity. We show that in a convex mission space, the connectivity constraints can be satisfied by any feasible solution to a mixed integer nonlinear optimization problem. When the optimal formation objective is to maximize coverage in a mission space cluttered with obstacles, we separate the process into intervals with no obstacles detected and intervals where one or more obstacles are detected. In "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.04727","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:35:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PUlcsrMHlhym/7KqhMneODkjVxF9eNYyBBqi0Jo92XWxhC6lR7CmDM/hE0nmjaQdNzxizi+5IBfN2JA9TyrKAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:28:25.505952Z"},"content_sha256":"f5c077fefa64c6565700172072c957a86e90bc3bb24da0ce8187a468d4365c7a","schema_version":"1.0","event_id":"sha256:f5c077fefa64c6565700172072c957a86e90bc3bb24da0ce8187a468d4365c7a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VCQ5I7SLNKETATEMSA5XEWWXH2/bundle.json","state_url":"https://pith.science/pith/VCQ5I7SLNKETATEMSA5XEWWXH2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VCQ5I7SLNKETATEMSA5XEWWXH2/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-05T12:28:25Z","links":{"resolver":"https://pith.science/pith/VCQ5I7SLNKETATEMSA5XEWWXH2","bundle":"https://pith.science/pith/VCQ5I7SLNKETATEMSA5XEWWXH2/bundle.json","state":"https://pith.science/pith/VCQ5I7SLNKETATEMSA5XEWWXH2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VCQ5I7SLNKETATEMSA5XEWWXH2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:VCQ5I7SLNKETATEMSA5XEWWXH2","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":"64e518ae7eae70e30018fc2bb22fca20fdcf86fecea3fe23f8802cb82f1a7c6d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-08-19T18:11:17Z","title_canon_sha256":"942b814f543cdfb173d1dd42f577f68b7f109b0da218bd83323cb69cca61804f"},"schema_version":"1.0","source":{"id":"1508.04727","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.04727","created_at":"2026-05-18T01:35:01Z"},{"alias_kind":"arxiv_version","alias_value":"1508.04727v1","created_at":"2026-05-18T01:35:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.04727","created_at":"2026-05-18T01:35:01Z"},{"alias_kind":"pith_short_12","alias_value":"VCQ5I7SLNKET","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"VCQ5I7SLNKETATEM","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"VCQ5I7SL","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:f5c077fefa64c6565700172072c957a86e90bc3bb24da0ce8187a468d4365c7a","target":"graph","created_at":"2026-05-18T01:35:01Z","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 address the optimal dynamic formation problem in mobile leader-follower networks where an optimal formation is generated to maximize a given objective function while continuously preserving connectivity. We show that in a convex mission space, the connectivity constraints can be satisfied by any feasible solution to a mixed integer nonlinear optimization problem. When the optimal formation objective is to maximize coverage in a mission space cluttered with obstacles, we separate the process into intervals with no obstacles detected and intervals where one or more obstacles are detected. In ","authors_text":"Christos G. Cassandras, Xinmiao Sun","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-08-19T18:11:17Z","title":"Optimal Dynamic Formation Control of Multi-Agent Systems in Environments with Obstacles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.04727","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:c2976592999507eb3e55a9c4b01eadb0357235fcb6857685337039d7ef8c40a5","target":"record","created_at":"2026-05-18T01:35:01Z","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":"64e518ae7eae70e30018fc2bb22fca20fdcf86fecea3fe23f8802cb82f1a7c6d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-08-19T18:11:17Z","title_canon_sha256":"942b814f543cdfb173d1dd42f577f68b7f109b0da218bd83323cb69cca61804f"},"schema_version":"1.0","source":{"id":"1508.04727","kind":"arxiv","version":1}},"canonical_sha256":"a8a1d47e4b6a89304c8c903b725ad73e99ab7d662339177f2a7868e9d808911d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a8a1d47e4b6a89304c8c903b725ad73e99ab7d662339177f2a7868e9d808911d","first_computed_at":"2026-05-18T01:35:01.984310Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:01.984310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P8XN8VIEw4rJgbTLQe/V274R1+A4hEq14xe1moOqpCTEMM87s+qKt/OcRS3SvJN0YhGNJKkqjLO61qeCfF0uBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:01.984853Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.04727","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c2976592999507eb3e55a9c4b01eadb0357235fcb6857685337039d7ef8c40a5","sha256:f5c077fefa64c6565700172072c957a86e90bc3bb24da0ce8187a468d4365c7a"],"state_sha256":"1f45ae4c3022bb8aa1be47607c09b805774a91976eacbfdeb3595f5949a1a06c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IBs07OTMbRQMzkeXh+NNC0rluyLx0CuiOoqsCvAlnaUf7vkztOC2tUQxxhmSM5yvR8SeFHGHSnFw/JhraofcBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T12:28:25.507990Z","bundle_sha256":"135449d81859c152a87856e80787144bcfc893e23216e15ee596eb19e97fc15c"}}