{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:MHKH7LIIAV4M4Q5IW7A6B3KUB5","short_pith_number":"pith:MHKH7LII","canonical_record":{"source":{"id":"1402.1559","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-02-07T06:33:04Z","cross_cats_sorted":[],"title_canon_sha256":"e284c8d5ac3151dedd20be0aaeba11b9d862c3e5129c8e847b6b296144c50c8f","abstract_canon_sha256":"1fc90e07caeadc13ea557de13a827ec3a92b823692d1bda7b88347aa6b64c512"},"schema_version":"1.0"},"canonical_sha256":"61d47fad080578ce43a8b7c1e0ed540f57da28ff84b266b83262f5753fa40312","source":{"kind":"arxiv","id":"1402.1559","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.1559","created_at":"2026-05-18T02:59:33Z"},{"alias_kind":"arxiv_version","alias_value":"1402.1559v2","created_at":"2026-05-18T02:59:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.1559","created_at":"2026-05-18T02:59:33Z"},{"alias_kind":"pith_short_12","alias_value":"MHKH7LIIAV4M","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MHKH7LIIAV4M4Q5I","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MHKH7LII","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:MHKH7LIIAV4M4Q5IW7A6B3KUB5","target":"record","payload":{"canonical_record":{"source":{"id":"1402.1559","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-02-07T06:33:04Z","cross_cats_sorted":[],"title_canon_sha256":"e284c8d5ac3151dedd20be0aaeba11b9d862c3e5129c8e847b6b296144c50c8f","abstract_canon_sha256":"1fc90e07caeadc13ea557de13a827ec3a92b823692d1bda7b88347aa6b64c512"},"schema_version":"1.0"},"canonical_sha256":"61d47fad080578ce43a8b7c1e0ed540f57da28ff84b266b83262f5753fa40312","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:33.673963Z","signature_b64":"ad4Y4S0ciCb8eRHBUlCV3DsmhSW0H2fE3wIWnsRk+TIDZtnNEtD/hHrSmXp/vgTes9cO6AbeR4Dy/wULHDSaCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61d47fad080578ce43a8b7c1e0ed540f57da28ff84b266b83262f5753fa40312","last_reissued_at":"2026-05-18T02:59:33.673195Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:33.673195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.1559","source_version":2,"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:59:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"af/Fsquu5r0ICaEpGZH0ptCW4jmBkxEA5FAEgdJijmA0zlPRhqLYImk/cK/A+CZHwqnVHAQZ6vbE8ABfprIQBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:07:03.287969Z"},"content_sha256":"b2563d4d44c6ebe69dfc01d5aa6869009ce04de17b69f3dee833ee45af4887de","schema_version":"1.0","event_id":"sha256:b2563d4d44c6ebe69dfc01d5aa6869009ce04de17b69f3dee833ee45af4887de"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:MHKH7LIIAV4M4Q5IW7A6B3KUB5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Control Subject to Delays Satisfying an $\\mathcal{H}_\\infty$ Norm Bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Nikolai Matni","submitted_at":"2014-02-07T06:33:04Z","abstract_excerpt":"This paper presents a characterization of distributed controllers subject to delay constraints induced by a strongly connected communication graph that achieve a prescribed closed loop $\\mathcal{H}_\\infty$ norm. Inspired by the solution to the $\\mathcal{H}_2$ problem subject to delays, we exploit the fact that the communication graph is strongly connected to decompose the controller into a local finite impulse response component and a global but delayed infinite impulse response component. This allows us to reduce the control synthesis problem to a linear matrix inequality feasibility test."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.1559","kind":"arxiv","version":2},"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:59:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nIiHFSNMZNBkcaGVf9k2X667TmLme9lUWN+CGV5QmoJzgA0Zb8/d3Q5tx7wPdHU0BuLRkSNKV+KbbzlEVbM+Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:07:03.288313Z"},"content_sha256":"b88f3c53ac9bd411f2bcf4a3c10f7e76df99cb44d8f3dd3874a950715e551338","schema_version":"1.0","event_id":"sha256:b88f3c53ac9bd411f2bcf4a3c10f7e76df99cb44d8f3dd3874a950715e551338"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MHKH7LIIAV4M4Q5IW7A6B3KUB5/bundle.json","state_url":"https://pith.science/pith/MHKH7LIIAV4M4Q5IW7A6B3KUB5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MHKH7LIIAV4M4Q5IW7A6B3KUB5/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-05T10:07:03Z","links":{"resolver":"https://pith.science/pith/MHKH7LIIAV4M4Q5IW7A6B3KUB5","bundle":"https://pith.science/pith/MHKH7LIIAV4M4Q5IW7A6B3KUB5/bundle.json","state":"https://pith.science/pith/MHKH7LIIAV4M4Q5IW7A6B3KUB5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MHKH7LIIAV4M4Q5IW7A6B3KUB5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:MHKH7LIIAV4M4Q5IW7A6B3KUB5","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":"1fc90e07caeadc13ea557de13a827ec3a92b823692d1bda7b88347aa6b64c512","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-02-07T06:33:04Z","title_canon_sha256":"e284c8d5ac3151dedd20be0aaeba11b9d862c3e5129c8e847b6b296144c50c8f"},"schema_version":"1.0","source":{"id":"1402.1559","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.1559","created_at":"2026-05-18T02:59:33Z"},{"alias_kind":"arxiv_version","alias_value":"1402.1559v2","created_at":"2026-05-18T02:59:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.1559","created_at":"2026-05-18T02:59:33Z"},{"alias_kind":"pith_short_12","alias_value":"MHKH7LIIAV4M","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MHKH7LIIAV4M4Q5I","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MHKH7LII","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:b88f3c53ac9bd411f2bcf4a3c10f7e76df99cb44d8f3dd3874a950715e551338","target":"graph","created_at":"2026-05-18T02:59:33Z","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 presents a characterization of distributed controllers subject to delay constraints induced by a strongly connected communication graph that achieve a prescribed closed loop $\\mathcal{H}_\\infty$ norm. Inspired by the solution to the $\\mathcal{H}_2$ problem subject to delays, we exploit the fact that the communication graph is strongly connected to decompose the controller into a local finite impulse response component and a global but delayed infinite impulse response component. This allows us to reduce the control synthesis problem to a linear matrix inequality feasibility test.","authors_text":"Nikolai Matni","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-02-07T06:33:04Z","title":"Distributed Control Subject to Delays Satisfying an $\\mathcal{H}_\\infty$ Norm Bound"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.1559","kind":"arxiv","version":2},"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:b2563d4d44c6ebe69dfc01d5aa6869009ce04de17b69f3dee833ee45af4887de","target":"record","created_at":"2026-05-18T02:59:33Z","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":"1fc90e07caeadc13ea557de13a827ec3a92b823692d1bda7b88347aa6b64c512","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-02-07T06:33:04Z","title_canon_sha256":"e284c8d5ac3151dedd20be0aaeba11b9d862c3e5129c8e847b6b296144c50c8f"},"schema_version":"1.0","source":{"id":"1402.1559","kind":"arxiv","version":2}},"canonical_sha256":"61d47fad080578ce43a8b7c1e0ed540f57da28ff84b266b83262f5753fa40312","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"61d47fad080578ce43a8b7c1e0ed540f57da28ff84b266b83262f5753fa40312","first_computed_at":"2026-05-18T02:59:33.673195Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:59:33.673195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ad4Y4S0ciCb8eRHBUlCV3DsmhSW0H2fE3wIWnsRk+TIDZtnNEtD/hHrSmXp/vgTes9cO6AbeR4Dy/wULHDSaCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:59:33.673963Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.1559","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b2563d4d44c6ebe69dfc01d5aa6869009ce04de17b69f3dee833ee45af4887de","sha256:b88f3c53ac9bd411f2bcf4a3c10f7e76df99cb44d8f3dd3874a950715e551338"],"state_sha256":"0bd935bc13d6f0bf03c2306f61f4de669ba71ce01493b98f64ac466d17c895f3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2uKTPITsVHgHY1FZJQuQd84nwXEvTbuLg+gRNodkVgMU30khfeI0cZSEwT9ezIEgf1PlrWF1QN26fRDAu62HCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T10:07:03.290300Z","bundle_sha256":"e34da84e221344a8d36f0b60e91f2a8cc414566a36114cb5a5eb58b680847a3d"}}