{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:V7UEBKJGU5V7XQ2LECDHTQEZYR","short_pith_number":"pith:V7UEBKJG","canonical_record":{"source":{"id":"1409.6037","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-09-21T20:20:12Z","cross_cats_sorted":[],"title_canon_sha256":"1cbb1eace2615bd826504f657287d90effee9975d828e7a069049480fba4f10c","abstract_canon_sha256":"150c35bf4c02c90bd5daca49b26cd770f493920a540b25f57a94cb3ee548fc93"},"schema_version":"1.0"},"canonical_sha256":"afe840a926a76bfbc34b208679c099c45002e2acccd0d08b50aa1a7c83d1c64a","source":{"kind":"arxiv","id":"1409.6037","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.6037","created_at":"2026-05-18T02:42:13Z"},{"alias_kind":"arxiv_version","alias_value":"1409.6037v1","created_at":"2026-05-18T02:42:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.6037","created_at":"2026-05-18T02:42:13Z"},{"alias_kind":"pith_short_12","alias_value":"V7UEBKJGU5V7","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"V7UEBKJGU5V7XQ2L","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"V7UEBKJG","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:V7UEBKJGU5V7XQ2LECDHTQEZYR","target":"record","payload":{"canonical_record":{"source":{"id":"1409.6037","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-09-21T20:20:12Z","cross_cats_sorted":[],"title_canon_sha256":"1cbb1eace2615bd826504f657287d90effee9975d828e7a069049480fba4f10c","abstract_canon_sha256":"150c35bf4c02c90bd5daca49b26cd770f493920a540b25f57a94cb3ee548fc93"},"schema_version":"1.0"},"canonical_sha256":"afe840a926a76bfbc34b208679c099c45002e2acccd0d08b50aa1a7c83d1c64a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:13.888696Z","signature_b64":"s4mrdrAM+7WJ56K/8YYECfifZlJ62jIjREHnAADPeoNN/g9+oRUGReQJHkj1NH2R8TkalRtSJiQyIybAvv8HAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"afe840a926a76bfbc34b208679c099c45002e2acccd0d08b50aa1a7c83d1c64a","last_reissued_at":"2026-05-18T02:42:13.888230Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:13.888230Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.6037","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-18T02:42:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SDDgaYTxB1Xja/S+eFCkbyIGmhRgD/iiO+T43mHcUeOp6Xx5+k2xKO32RIt+eGo3v6//viBLcjZGUmtUeZdeDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:17:09.929713Z"},"content_sha256":"6e81e1c1accbc1bf9b2698c00928a314a4490ed3d597c93ea7d78279993b8c96","schema_version":"1.0","event_id":"sha256:6e81e1c1accbc1bf9b2698c00928a314a4490ed3d597c93ea7d78279993b8c96"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:V7UEBKJGU5V7XQ2LECDHTQEZYR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Network entropy and data rates required for networked control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Christoph Kawan, Jean-Charles Delvenne","submitted_at":"2014-09-21T20:20:12Z","abstract_excerpt":"We consider the problem of making a set of states invariant for a network of controlled systems. We assume that the subsystems, initially uncoupled, must be interconnected through controllers to be designed with a constraint on the data rate obtained by every subsystem from all the other subsystems. We introduce the notion of subsystem invariance entropy, which is a measure for the smallest data rate arriving at a fixed subsystem, above which the overall system is able to achieve the control goal. Moreover, we associate to a network of n subsystems a closed convex set of R^n encompassing all p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.6037","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-18T02:42:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"74GEpCQiLS9rdv1QicRE0XQ0hEISymMWEuZXr2QWI/K+NDDgK1HKH4QM2gGXZd0k2oshgjNDijzWnircT2P2DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:17:09.930339Z"},"content_sha256":"3dc7984f7880441f920bf61b708da79b05b5c9515ab6993f0a9e2a7269fd8719","schema_version":"1.0","event_id":"sha256:3dc7984f7880441f920bf61b708da79b05b5c9515ab6993f0a9e2a7269fd8719"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V7UEBKJGU5V7XQ2LECDHTQEZYR/bundle.json","state_url":"https://pith.science/pith/V7UEBKJGU5V7XQ2LECDHTQEZYR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V7UEBKJGU5V7XQ2LECDHTQEZYR/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-02T14:17:09Z","links":{"resolver":"https://pith.science/pith/V7UEBKJGU5V7XQ2LECDHTQEZYR","bundle":"https://pith.science/pith/V7UEBKJGU5V7XQ2LECDHTQEZYR/bundle.json","state":"https://pith.science/pith/V7UEBKJGU5V7XQ2LECDHTQEZYR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V7UEBKJGU5V7XQ2LECDHTQEZYR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:V7UEBKJGU5V7XQ2LECDHTQEZYR","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":"150c35bf4c02c90bd5daca49b26cd770f493920a540b25f57a94cb3ee548fc93","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-09-21T20:20:12Z","title_canon_sha256":"1cbb1eace2615bd826504f657287d90effee9975d828e7a069049480fba4f10c"},"schema_version":"1.0","source":{"id":"1409.6037","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.6037","created_at":"2026-05-18T02:42:13Z"},{"alias_kind":"arxiv_version","alias_value":"1409.6037v1","created_at":"2026-05-18T02:42:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.6037","created_at":"2026-05-18T02:42:13Z"},{"alias_kind":"pith_short_12","alias_value":"V7UEBKJGU5V7","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"V7UEBKJGU5V7XQ2L","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"V7UEBKJG","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:3dc7984f7880441f920bf61b708da79b05b5c9515ab6993f0a9e2a7269fd8719","target":"graph","created_at":"2026-05-18T02:42:13Z","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 consider the problem of making a set of states invariant for a network of controlled systems. We assume that the subsystems, initially uncoupled, must be interconnected through controllers to be designed with a constraint on the data rate obtained by every subsystem from all the other subsystems. We introduce the notion of subsystem invariance entropy, which is a measure for the smallest data rate arriving at a fixed subsystem, above which the overall system is able to achieve the control goal. Moreover, we associate to a network of n subsystems a closed convex set of R^n encompassing all p","authors_text":"Christoph Kawan, Jean-Charles Delvenne","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-09-21T20:20:12Z","title":"Network entropy and data rates required for networked control"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.6037","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:6e81e1c1accbc1bf9b2698c00928a314a4490ed3d597c93ea7d78279993b8c96","target":"record","created_at":"2026-05-18T02:42:13Z","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":"150c35bf4c02c90bd5daca49b26cd770f493920a540b25f57a94cb3ee548fc93","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-09-21T20:20:12Z","title_canon_sha256":"1cbb1eace2615bd826504f657287d90effee9975d828e7a069049480fba4f10c"},"schema_version":"1.0","source":{"id":"1409.6037","kind":"arxiv","version":1}},"canonical_sha256":"afe840a926a76bfbc34b208679c099c45002e2acccd0d08b50aa1a7c83d1c64a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"afe840a926a76bfbc34b208679c099c45002e2acccd0d08b50aa1a7c83d1c64a","first_computed_at":"2026-05-18T02:42:13.888230Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:42:13.888230Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s4mrdrAM+7WJ56K/8YYECfifZlJ62jIjREHnAADPeoNN/g9+oRUGReQJHkj1NH2R8TkalRtSJiQyIybAvv8HAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:42:13.888696Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.6037","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e81e1c1accbc1bf9b2698c00928a314a4490ed3d597c93ea7d78279993b8c96","sha256:3dc7984f7880441f920bf61b708da79b05b5c9515ab6993f0a9e2a7269fd8719"],"state_sha256":"73056fa02efd3c30491f849c1eec6765d284cb204e546c6bdd762700ea364809"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lHVv7+vSGx8Ixjr8GNH5cJ1N+atCFRc1WKe0NekOTiXhqfkiuPqMNtzujg3wCIZbpfFIpks38LwG4gRMVXU0AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T14:17:09.933166Z","bundle_sha256":"1cfec6612bd70670adf95cd0b08ec0e1d60541061370fe9aa199ca525e8725e1"}}