{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QSGNVTK5ZMQOWZ3I6PVZJEG4M6","short_pith_number":"pith:QSGNVTK5","canonical_record":{"source":{"id":"1702.07934","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2017-02-25T18:10:37Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"1e350e4939aa3c544cfd3df2c860039890806a0ea8bfb60c13640c41311ce404","abstract_canon_sha256":"9cb38f37ba4caa58183f8e06715ab96050d4d6bf14f40bda214f5f32008f7543"},"schema_version":"1.0"},"canonical_sha256":"848cdacd5dcb20eb6768f3eb9490dc67865181ab42811128052eae4d614f3780","source":{"kind":"arxiv","id":"1702.07934","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.07934","created_at":"2026-05-18T00:49:56Z"},{"alias_kind":"arxiv_version","alias_value":"1702.07934v1","created_at":"2026-05-18T00:49:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07934","created_at":"2026-05-18T00:49:56Z"},{"alias_kind":"pith_short_12","alias_value":"QSGNVTK5ZMQO","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QSGNVTK5ZMQOWZ3I","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QSGNVTK5","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QSGNVTK5ZMQOWZ3I6PVZJEG4M6","target":"record","payload":{"canonical_record":{"source":{"id":"1702.07934","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2017-02-25T18:10:37Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"1e350e4939aa3c544cfd3df2c860039890806a0ea8bfb60c13640c41311ce404","abstract_canon_sha256":"9cb38f37ba4caa58183f8e06715ab96050d4d6bf14f40bda214f5f32008f7543"},"schema_version":"1.0"},"canonical_sha256":"848cdacd5dcb20eb6768f3eb9490dc67865181ab42811128052eae4d614f3780","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:56.647743Z","signature_b64":"BCv79OBfCtRpXj9JWiRWqEa8810sb6aD07BrfwVTUXPT69FPAo/WvXcdUglf0F2QhyyXDSiFEHAWJP5SW7wkDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"848cdacd5dcb20eb6768f3eb9490dc67865181ab42811128052eae4d614f3780","last_reissued_at":"2026-05-18T00:49:56.647152Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:56.647152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.07934","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:49:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6aWBVSHSdR48vZ/53kVg3QXbWna9dW+kwTpf8mYzwiUL+Ck2TEW+BNcsgTLjiKePMNJXztroq31bPySLdg/jDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T04:27:05.621948Z"},"content_sha256":"bad6e75ec57f11f288c2c26885d7b519c59378d4e741cde1b2989d7d64287b7e","schema_version":"1.0","event_id":"sha256:bad6e75ec57f11f288c2c26885d7b519c59378d4e741cde1b2989d7d64287b7e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QSGNVTK5ZMQOWZ3I6PVZJEG4M6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A decentralized algorithm for control of autonomous agents coupled by feasibility constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"cs.MA","authors_text":"Andrew G. Alleyne, Edoardo Sabbioni, Francesco Braghin, Stijn De Bruyne, Ugo Rosolia","submitted_at":"2017-02-25T18:10:37Z","abstract_excerpt":"In this paper a decentralized control algorithm for systems composed of $N$ dynamically decoupled agents, coupled by feasibility constraints, is presented. The control problem is divided into $N$ optimal control sub-problems and a communication scheme is proposed to decouple computations. The derivative of the solution of each sub-problem is used to approximate the evolution of the system allowing the algorithm to decentralize and parallelize computations. The effectiveness of the proposed algorithm is shown through simulations in a cooperative driving scenario."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07934","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:49:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QJC4lV5bLGTLvlB4yd71nK+apXbzg3WtoJVXYU5sn00/5uz1xzzxQGHM6QUtcuxOD0ryYwBJVEJS73a43HsUDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T04:27:05.622558Z"},"content_sha256":"b8bce15367c014fc879821ff851401325fada370bd2859e6b42b27f86a74fdf2","schema_version":"1.0","event_id":"sha256:b8bce15367c014fc879821ff851401325fada370bd2859e6b42b27f86a74fdf2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QSGNVTK5ZMQOWZ3I6PVZJEG4M6/bundle.json","state_url":"https://pith.science/pith/QSGNVTK5ZMQOWZ3I6PVZJEG4M6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QSGNVTK5ZMQOWZ3I6PVZJEG4M6/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-08T04:27:05Z","links":{"resolver":"https://pith.science/pith/QSGNVTK5ZMQOWZ3I6PVZJEG4M6","bundle":"https://pith.science/pith/QSGNVTK5ZMQOWZ3I6PVZJEG4M6/bundle.json","state":"https://pith.science/pith/QSGNVTK5ZMQOWZ3I6PVZJEG4M6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QSGNVTK5ZMQOWZ3I6PVZJEG4M6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QSGNVTK5ZMQOWZ3I6PVZJEG4M6","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":"9cb38f37ba4caa58183f8e06715ab96050d4d6bf14f40bda214f5f32008f7543","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2017-02-25T18:10:37Z","title_canon_sha256":"1e350e4939aa3c544cfd3df2c860039890806a0ea8bfb60c13640c41311ce404"},"schema_version":"1.0","source":{"id":"1702.07934","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.07934","created_at":"2026-05-18T00:49:56Z"},{"alias_kind":"arxiv_version","alias_value":"1702.07934v1","created_at":"2026-05-18T00:49:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07934","created_at":"2026-05-18T00:49:56Z"},{"alias_kind":"pith_short_12","alias_value":"QSGNVTK5ZMQO","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QSGNVTK5ZMQOWZ3I","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QSGNVTK5","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:b8bce15367c014fc879821ff851401325fada370bd2859e6b42b27f86a74fdf2","target":"graph","created_at":"2026-05-18T00:49:56Z","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":"In this paper a decentralized control algorithm for systems composed of $N$ dynamically decoupled agents, coupled by feasibility constraints, is presented. The control problem is divided into $N$ optimal control sub-problems and a communication scheme is proposed to decouple computations. The derivative of the solution of each sub-problem is used to approximate the evolution of the system allowing the algorithm to decentralize and parallelize computations. The effectiveness of the proposed algorithm is shown through simulations in a cooperative driving scenario.","authors_text":"Andrew G. Alleyne, Edoardo Sabbioni, Francesco Braghin, Stijn De Bruyne, Ugo Rosolia","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2017-02-25T18:10:37Z","title":"A decentralized algorithm for control of autonomous agents coupled by feasibility constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07934","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:bad6e75ec57f11f288c2c26885d7b519c59378d4e741cde1b2989d7d64287b7e","target":"record","created_at":"2026-05-18T00:49:56Z","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":"9cb38f37ba4caa58183f8e06715ab96050d4d6bf14f40bda214f5f32008f7543","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2017-02-25T18:10:37Z","title_canon_sha256":"1e350e4939aa3c544cfd3df2c860039890806a0ea8bfb60c13640c41311ce404"},"schema_version":"1.0","source":{"id":"1702.07934","kind":"arxiv","version":1}},"canonical_sha256":"848cdacd5dcb20eb6768f3eb9490dc67865181ab42811128052eae4d614f3780","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"848cdacd5dcb20eb6768f3eb9490dc67865181ab42811128052eae4d614f3780","first_computed_at":"2026-05-18T00:49:56.647152Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:56.647152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BCv79OBfCtRpXj9JWiRWqEa8810sb6aD07BrfwVTUXPT69FPAo/WvXcdUglf0F2QhyyXDSiFEHAWJP5SW7wkDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:56.647743Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.07934","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bad6e75ec57f11f288c2c26885d7b519c59378d4e741cde1b2989d7d64287b7e","sha256:b8bce15367c014fc879821ff851401325fada370bd2859e6b42b27f86a74fdf2"],"state_sha256":"37678973305f2d86af8f4f562a23259aa072c22871dbd3ba91a95b839878e69a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IaSrq7Y+tDfem8ZfWY/GHTqU+gmCv/3BugUwl8ABz3ILrBYwb2Csg1Bzssg9LYo/9bTXqh3JKR5IIJFbR5NcBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T04:27:05.626867Z","bundle_sha256":"f481359ef28253f63f4e2b7004f1e0afa6005b197fb23f0fb2d68143a7982edd"}}