{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:C5ITXCMOFVUS6ZSCGMES6HYHO6","short_pith_number":"pith:C5ITXCMO","canonical_record":{"source":{"id":"1610.01461","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-10-05T14:53:40Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"07b078ece0f12d69ba999be11f9e4090a6b9601d9a7f28655e499ae33f996061","abstract_canon_sha256":"5930eccc0205c6d82e02b73f27c00e815fc5957a59c7e6d49059259cc2ec817c"},"schema_version":"1.0"},"canonical_sha256":"17513b898e2d692f664233092f1f0777927c973d58a7b18d187dee10df49e776","source":{"kind":"arxiv","id":"1610.01461","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.01461","created_at":"2026-05-18T01:03:07Z"},{"alias_kind":"arxiv_version","alias_value":"1610.01461v1","created_at":"2026-05-18T01:03:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.01461","created_at":"2026-05-18T01:03:07Z"},{"alias_kind":"pith_short_12","alias_value":"C5ITXCMOFVUS","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"C5ITXCMOFVUS6ZSC","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"C5ITXCMO","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:C5ITXCMOFVUS6ZSCGMES6HYHO6","target":"record","payload":{"canonical_record":{"source":{"id":"1610.01461","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-10-05T14:53:40Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"07b078ece0f12d69ba999be11f9e4090a6b9601d9a7f28655e499ae33f996061","abstract_canon_sha256":"5930eccc0205c6d82e02b73f27c00e815fc5957a59c7e6d49059259cc2ec817c"},"schema_version":"1.0"},"canonical_sha256":"17513b898e2d692f664233092f1f0777927c973d58a7b18d187dee10df49e776","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:07.105760Z","signature_b64":"Q2QfiprTYz9vMcQBZQlNZUzBFiOAXMGG5UjezbKa/3Kte8wD/YjGXefXkZrgu+2Pw7XIczA1k+m1Mx/BLEjQDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17513b898e2d692f664233092f1f0777927c973d58a7b18d187dee10df49e776","last_reissued_at":"2026-05-18T01:03:07.105304Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:07.105304Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.01461","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:03:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z9M+UJtM4cQC7EzxILX+AelGdS/deH+2st7Z0G9CcU7Ioeil5QkHtz1ZHNnNuiZfzs8alzl+KCtsmpljWehqCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T20:39:15.745343Z"},"content_sha256":"93a90a0e82167ca0817df41f31f0b04db0b799756a63eb82c4d6e4a920e40133","schema_version":"1.0","event_id":"sha256:93a90a0e82167ca0817df41f31f0b04db0b799756a63eb82c4d6e4a920e40133"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:C5ITXCMOFVUS6ZSCGMES6HYHO6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cooperative Output Regulation of Linear Multi-agent Systems with Communication Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Abdelhamid Tayebi, Abdelkader Abdessameud","submitted_at":"2016-10-05T14:53:40Z","abstract_excerpt":"In this paper, we consider the cooperative output regulation problem for heterogeneous linear multi-agent systems in the presence of communication constraints. Under standard assumptions on the agents dynamics, we propose a distributed control algorithm relying on intermittent and asynchronous discrete-time information exchange that can be subject to unknown time-varying delays and information losses. We show that cooperative output regulation can be reached for arbitrary characteristics of the discrete-time communication process and under mild assumptions on the interconnection topology betwe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.01461","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:03:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"834S2vS+yzy9psSvRDY19oPCDYMkbHry4IrMK6nJrn0RS8srx3TGXiVNyIBhS2s3C/wsBg6WXzTyuEjQ2OthAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T20:39:15.745717Z"},"content_sha256":"e20bca0f5e4caacb461b67728d0716d6b6d76e964d2db5a33b15c99a113cecbe","schema_version":"1.0","event_id":"sha256:e20bca0f5e4caacb461b67728d0716d6b6d76e964d2db5a33b15c99a113cecbe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C5ITXCMOFVUS6ZSCGMES6HYHO6/bundle.json","state_url":"https://pith.science/pith/C5ITXCMOFVUS6ZSCGMES6HYHO6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C5ITXCMOFVUS6ZSCGMES6HYHO6/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-24T20:39:15Z","links":{"resolver":"https://pith.science/pith/C5ITXCMOFVUS6ZSCGMES6HYHO6","bundle":"https://pith.science/pith/C5ITXCMOFVUS6ZSCGMES6HYHO6/bundle.json","state":"https://pith.science/pith/C5ITXCMOFVUS6ZSCGMES6HYHO6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C5ITXCMOFVUS6ZSCGMES6HYHO6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:C5ITXCMOFVUS6ZSCGMES6HYHO6","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":"5930eccc0205c6d82e02b73f27c00e815fc5957a59c7e6d49059259cc2ec817c","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-10-05T14:53:40Z","title_canon_sha256":"07b078ece0f12d69ba999be11f9e4090a6b9601d9a7f28655e499ae33f996061"},"schema_version":"1.0","source":{"id":"1610.01461","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.01461","created_at":"2026-05-18T01:03:07Z"},{"alias_kind":"arxiv_version","alias_value":"1610.01461v1","created_at":"2026-05-18T01:03:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.01461","created_at":"2026-05-18T01:03:07Z"},{"alias_kind":"pith_short_12","alias_value":"C5ITXCMOFVUS","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"C5ITXCMOFVUS6ZSC","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"C5ITXCMO","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:e20bca0f5e4caacb461b67728d0716d6b6d76e964d2db5a33b15c99a113cecbe","target":"graph","created_at":"2026-05-18T01:03: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":"In this paper, we consider the cooperative output regulation problem for heterogeneous linear multi-agent systems in the presence of communication constraints. Under standard assumptions on the agents dynamics, we propose a distributed control algorithm relying on intermittent and asynchronous discrete-time information exchange that can be subject to unknown time-varying delays and information losses. We show that cooperative output regulation can be reached for arbitrary characteristics of the discrete-time communication process and under mild assumptions on the interconnection topology betwe","authors_text":"Abdelhamid Tayebi, Abdelkader Abdessameud","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-10-05T14:53:40Z","title":"Cooperative Output Regulation of Linear Multi-agent Systems with Communication Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.01461","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:93a90a0e82167ca0817df41f31f0b04db0b799756a63eb82c4d6e4a920e40133","target":"record","created_at":"2026-05-18T01:03: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":"5930eccc0205c6d82e02b73f27c00e815fc5957a59c7e6d49059259cc2ec817c","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-10-05T14:53:40Z","title_canon_sha256":"07b078ece0f12d69ba999be11f9e4090a6b9601d9a7f28655e499ae33f996061"},"schema_version":"1.0","source":{"id":"1610.01461","kind":"arxiv","version":1}},"canonical_sha256":"17513b898e2d692f664233092f1f0777927c973d58a7b18d187dee10df49e776","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"17513b898e2d692f664233092f1f0777927c973d58a7b18d187dee10df49e776","first_computed_at":"2026-05-18T01:03:07.105304Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:07.105304Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Q2QfiprTYz9vMcQBZQlNZUzBFiOAXMGG5UjezbKa/3Kte8wD/YjGXefXkZrgu+2Pw7XIczA1k+m1Mx/BLEjQDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:07.105760Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.01461","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:93a90a0e82167ca0817df41f31f0b04db0b799756a63eb82c4d6e4a920e40133","sha256:e20bca0f5e4caacb461b67728d0716d6b6d76e964d2db5a33b15c99a113cecbe"],"state_sha256":"bf9f3456815c6571cf182a95c17cbcd0387dcb97f91ddbfffeef57aa604ac7a9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WmBfRnFB6cXUa6fgkaZHdYfJv5x2R/ejdsT20WQkVJWsXsJEEjef7hKbjT3LyPj+bTB+bpTINA5FtGCo1K9HAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T20:39:15.747706Z","bundle_sha256":"6171d34f10bd2e3c833d379a943cc65b8af633376c8c353e5e06f470b4d46530"}}