{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:K5ZNFOP77M2XANLTI4BQVGPZSK","short_pith_number":"pith:K5ZNFOP7","canonical_record":{"source":{"id":"1907.08531","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2019-07-19T14:39:09Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"38010a4f61cc99f427e7c3f59f64337358cf869c53ffde4bf9ffc261cfa5466f","abstract_canon_sha256":"afde05ec0b37b622f371d8bcccf4e2385b19c814896cffa00d6b48e18eb381b6"},"schema_version":"1.0"},"canonical_sha256":"5772d2b9fffb3570357347030a99f992883ef001cea603e43c810519d9e5453e","source":{"kind":"arxiv","id":"1907.08531","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.08531","created_at":"2026-05-17T23:40:09Z"},{"alias_kind":"arxiv_version","alias_value":"1907.08531v1","created_at":"2026-05-17T23:40:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.08531","created_at":"2026-05-17T23:40:09Z"},{"alias_kind":"pith_short_12","alias_value":"K5ZNFOP77M2X","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"K5ZNFOP77M2XANLT","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"K5ZNFOP7","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:K5ZNFOP77M2XANLTI4BQVGPZSK","target":"record","payload":{"canonical_record":{"source":{"id":"1907.08531","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2019-07-19T14:39:09Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"38010a4f61cc99f427e7c3f59f64337358cf869c53ffde4bf9ffc261cfa5466f","abstract_canon_sha256":"afde05ec0b37b622f371d8bcccf4e2385b19c814896cffa00d6b48e18eb381b6"},"schema_version":"1.0"},"canonical_sha256":"5772d2b9fffb3570357347030a99f992883ef001cea603e43c810519d9e5453e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:09.537252Z","signature_b64":"qEpqBhJEpoOz7gwvAXOFL0jQwjCt66XhxfYCMG7GHY20S9BR3g+h7twaAxM1ork0VBVUvG8SgP0YBXGq1bEIAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5772d2b9fffb3570357347030a99f992883ef001cea603e43c810519d9e5453e","last_reissued_at":"2026-05-17T23:40:09.536604Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:09.536604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.08531","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-17T23:40:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zg/pnlreCwpL7wL6vg4DQc46RcbO3hdo+r8//X4ApqQOcV78ocdZBghQ43WqabFE5k9PSiAE5aHSw6OeJ1llAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:35:12.481960Z"},"content_sha256":"3595452d0edfc886507b24798ff20d56d5b46cfe2ac961ce38bba2393a9970de","schema_version":"1.0","event_id":"sha256:3595452d0edfc886507b24798ff20d56d5b46cfe2ac961ce38bba2393a9970de"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:K5ZNFOP77M2XANLTI4BQVGPZSK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An optimization-based cooperative path-following framework for multiple robotic vehicles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Andrea Alessandretti, A. Pedro Aguiar","submitted_at":"2019-07-19T14:39:09Z","abstract_excerpt":"This paper addresses the design of an optimization-based cooperative path-following control law for multiple robotic vehicles that optimally balances the transient trade-off between coordination and path-following errors. To this end, we formulate a more general multi-agent framework where each agent is associated with (i) a continuous-time dynamical model, which governs the evolution of its state, and (ii) an output equation that is a function of both the state of the agent and a coordination vector. According to a given network topology, each agent can access its state and coordination vecto"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.08531","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-17T23:40:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AeaE1tOPy+QXF1YCSmPQ/+NaIOLoHTduqelOSmPGvE/U1ps27P030uL/lyCQi3x+qR90zF/DPZVz/CL6ssFJBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:35:12.482301Z"},"content_sha256":"67c6619e6300860f6afac045196c8774f7bf0dde6df116dcefe1e382d9d02dae","schema_version":"1.0","event_id":"sha256:67c6619e6300860f6afac045196c8774f7bf0dde6df116dcefe1e382d9d02dae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K5ZNFOP77M2XANLTI4BQVGPZSK/bundle.json","state_url":"https://pith.science/pith/K5ZNFOP77M2XANLTI4BQVGPZSK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K5ZNFOP77M2XANLTI4BQVGPZSK/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:35:12Z","links":{"resolver":"https://pith.science/pith/K5ZNFOP77M2XANLTI4BQVGPZSK","bundle":"https://pith.science/pith/K5ZNFOP77M2XANLTI4BQVGPZSK/bundle.json","state":"https://pith.science/pith/K5ZNFOP77M2XANLTI4BQVGPZSK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K5ZNFOP77M2XANLTI4BQVGPZSK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:K5ZNFOP77M2XANLTI4BQVGPZSK","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":"afde05ec0b37b622f371d8bcccf4e2385b19c814896cffa00d6b48e18eb381b6","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2019-07-19T14:39:09Z","title_canon_sha256":"38010a4f61cc99f427e7c3f59f64337358cf869c53ffde4bf9ffc261cfa5466f"},"schema_version":"1.0","source":{"id":"1907.08531","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.08531","created_at":"2026-05-17T23:40:09Z"},{"alias_kind":"arxiv_version","alias_value":"1907.08531v1","created_at":"2026-05-17T23:40:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.08531","created_at":"2026-05-17T23:40:09Z"},{"alias_kind":"pith_short_12","alias_value":"K5ZNFOP77M2X","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"K5ZNFOP77M2XANLT","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"K5ZNFOP7","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:67c6619e6300860f6afac045196c8774f7bf0dde6df116dcefe1e382d9d02dae","target":"graph","created_at":"2026-05-17T23:40:09Z","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":"This paper addresses the design of an optimization-based cooperative path-following control law for multiple robotic vehicles that optimally balances the transient trade-off between coordination and path-following errors. To this end, we formulate a more general multi-agent framework where each agent is associated with (i) a continuous-time dynamical model, which governs the evolution of its state, and (ii) an output equation that is a function of both the state of the agent and a coordination vector. According to a given network topology, each agent can access its state and coordination vecto","authors_text":"Andrea Alessandretti, A. Pedro Aguiar","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2019-07-19T14:39:09Z","title":"An optimization-based cooperative path-following framework for multiple robotic vehicles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.08531","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:3595452d0edfc886507b24798ff20d56d5b46cfe2ac961ce38bba2393a9970de","target":"record","created_at":"2026-05-17T23:40:09Z","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":"afde05ec0b37b622f371d8bcccf4e2385b19c814896cffa00d6b48e18eb381b6","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2019-07-19T14:39:09Z","title_canon_sha256":"38010a4f61cc99f427e7c3f59f64337358cf869c53ffde4bf9ffc261cfa5466f"},"schema_version":"1.0","source":{"id":"1907.08531","kind":"arxiv","version":1}},"canonical_sha256":"5772d2b9fffb3570357347030a99f992883ef001cea603e43c810519d9e5453e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5772d2b9fffb3570357347030a99f992883ef001cea603e43c810519d9e5453e","first_computed_at":"2026-05-17T23:40:09.536604Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:09.536604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qEpqBhJEpoOz7gwvAXOFL0jQwjCt66XhxfYCMG7GHY20S9BR3g+h7twaAxM1ork0VBVUvG8SgP0YBXGq1bEIAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:09.537252Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.08531","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3595452d0edfc886507b24798ff20d56d5b46cfe2ac961ce38bba2393a9970de","sha256:67c6619e6300860f6afac045196c8774f7bf0dde6df116dcefe1e382d9d02dae"],"state_sha256":"8e200109615d19d331c67a838cf45078764c1e669e6594b3540b4d9608630338"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s63TTYnib9ODH1qJhiazOyY/NHSMkPQV/TuPVx5hGl+GPfTfqqmffROxZtXVvJR+rtxITruPE7qELIYmSJ1QDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T02:35:12.484202Z","bundle_sha256":"683ac678650df2946cb1cc5f81889b3db330c7d655d16dbdcddd1bd7db6b596f"}}