{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:OHJVI4Y4A77XYLHP53FQRZ35PC","short_pith_number":"pith:OHJVI4Y4","canonical_record":{"source":{"id":"1710.03154","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-09T15:41:24Z","cross_cats_sorted":[],"title_canon_sha256":"86a92b0f592a269279d2d0f13e7ad0c5cecc3ee849281ffc003f09b5941e4117","abstract_canon_sha256":"445d524b5d3a64d17c8d0283f24c948cc3e2cb60cc47b54d726d8449c9865352"},"schema_version":"1.0"},"canonical_sha256":"71d354731c07ff7c2cefeecb08e77d789e0470a303d1d2c2a03ec13563c382ed","source":{"kind":"arxiv","id":"1710.03154","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.03154","created_at":"2026-05-18T00:33:26Z"},{"alias_kind":"arxiv_version","alias_value":"1710.03154v1","created_at":"2026-05-18T00:33:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.03154","created_at":"2026-05-18T00:33:26Z"},{"alias_kind":"pith_short_12","alias_value":"OHJVI4Y4A77X","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OHJVI4Y4A77XYLHP","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OHJVI4Y4","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:OHJVI4Y4A77XYLHP53FQRZ35PC","target":"record","payload":{"canonical_record":{"source":{"id":"1710.03154","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-09T15:41:24Z","cross_cats_sorted":[],"title_canon_sha256":"86a92b0f592a269279d2d0f13e7ad0c5cecc3ee849281ffc003f09b5941e4117","abstract_canon_sha256":"445d524b5d3a64d17c8d0283f24c948cc3e2cb60cc47b54d726d8449c9865352"},"schema_version":"1.0"},"canonical_sha256":"71d354731c07ff7c2cefeecb08e77d789e0470a303d1d2c2a03ec13563c382ed","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:26.921157Z","signature_b64":"fVREVZMS3Xc7T27PMTeUjbFGSC/ifXViiisN8fbacWKJwnT/BPhrCjzD+v+HSFDDnFtBrelR7vouQDDVVWsLCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71d354731c07ff7c2cefeecb08e77d789e0470a303d1d2c2a03ec13563c382ed","last_reissued_at":"2026-05-18T00:33:26.920580Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:26.920580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.03154","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:33:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zO5CcAe9KLO7ZIcpGX/jLQNz0chkMHATxsaQDsj0jsi4tazIuPIk8S8KObR5zoS8zrcka/kqqWTP/GMA2DEFAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:27:08.569091Z"},"content_sha256":"0b507075048797d4e20fda2cddff765f7f7151f9e26ac34a75df886f78c906bf","schema_version":"1.0","event_id":"sha256:0b507075048797d4e20fda2cddff765f7f7151f9e26ac34a75df886f78c906bf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:OHJVI4Y4A77XYLHP53FQRZ35PC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimization of the $H_\\infty$-norm of Dynamic Flow Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexander Johansson, Henrik Sandberg, Jie Chen, Jieqiang Wei, Karl H. Johansson","submitted_at":"2017-10-09T15:41:24Z","abstract_excerpt":"In this paper, we study the $H_\\infty$-norm of linear systems over graphs, which is used to model distribution networks. In particular, we aim to minimize the $H_\\infty$-norm subject to allocation of the weights on the edges. The optimization problem is formulated with LMI (Linear-Matrix-Inequality) constraints. For distribution networks with one port, i.e., SISO systems, we show that the $H_\\infty$-norm coincides with the effective resistance between the nodes in the port. Moreover, we derive an upper bound of the $H_\\infty$-norm, which is in terms of the algebraic connectivity of the graph o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.03154","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:33:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OMKG1MJKGQPSXcJjRVPUYGcpqkTVmJyAyKFkNL+IdikVc2XXVBU+4Bue4jPEBLPIFBOht/MxkRZr8gjiwj08Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:27:08.569450Z"},"content_sha256":"7490f6bd4c1c66fcad063e36536ebb7c1366214312c8a676843b6dd88daaba66","schema_version":"1.0","event_id":"sha256:7490f6bd4c1c66fcad063e36536ebb7c1366214312c8a676843b6dd88daaba66"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OHJVI4Y4A77XYLHP53FQRZ35PC/bundle.json","state_url":"https://pith.science/pith/OHJVI4Y4A77XYLHP53FQRZ35PC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OHJVI4Y4A77XYLHP53FQRZ35PC/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-02T01:27:08Z","links":{"resolver":"https://pith.science/pith/OHJVI4Y4A77XYLHP53FQRZ35PC","bundle":"https://pith.science/pith/OHJVI4Y4A77XYLHP53FQRZ35PC/bundle.json","state":"https://pith.science/pith/OHJVI4Y4A77XYLHP53FQRZ35PC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OHJVI4Y4A77XYLHP53FQRZ35PC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:OHJVI4Y4A77XYLHP53FQRZ35PC","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":"445d524b5d3a64d17c8d0283f24c948cc3e2cb60cc47b54d726d8449c9865352","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-09T15:41:24Z","title_canon_sha256":"86a92b0f592a269279d2d0f13e7ad0c5cecc3ee849281ffc003f09b5941e4117"},"schema_version":"1.0","source":{"id":"1710.03154","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.03154","created_at":"2026-05-18T00:33:26Z"},{"alias_kind":"arxiv_version","alias_value":"1710.03154v1","created_at":"2026-05-18T00:33:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.03154","created_at":"2026-05-18T00:33:26Z"},{"alias_kind":"pith_short_12","alias_value":"OHJVI4Y4A77X","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OHJVI4Y4A77XYLHP","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OHJVI4Y4","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:7490f6bd4c1c66fcad063e36536ebb7c1366214312c8a676843b6dd88daaba66","target":"graph","created_at":"2026-05-18T00:33:26Z","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 study the $H_\\infty$-norm of linear systems over graphs, which is used to model distribution networks. In particular, we aim to minimize the $H_\\infty$-norm subject to allocation of the weights on the edges. The optimization problem is formulated with LMI (Linear-Matrix-Inequality) constraints. For distribution networks with one port, i.e., SISO systems, we show that the $H_\\infty$-norm coincides with the effective resistance between the nodes in the port. Moreover, we derive an upper bound of the $H_\\infty$-norm, which is in terms of the algebraic connectivity of the graph o","authors_text":"Alexander Johansson, Henrik Sandberg, Jie Chen, Jieqiang Wei, Karl H. Johansson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-09T15:41:24Z","title":"Optimization of the $H_\\infty$-norm of Dynamic Flow Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.03154","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:0b507075048797d4e20fda2cddff765f7f7151f9e26ac34a75df886f78c906bf","target":"record","created_at":"2026-05-18T00:33:26Z","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":"445d524b5d3a64d17c8d0283f24c948cc3e2cb60cc47b54d726d8449c9865352","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-09T15:41:24Z","title_canon_sha256":"86a92b0f592a269279d2d0f13e7ad0c5cecc3ee849281ffc003f09b5941e4117"},"schema_version":"1.0","source":{"id":"1710.03154","kind":"arxiv","version":1}},"canonical_sha256":"71d354731c07ff7c2cefeecb08e77d789e0470a303d1d2c2a03ec13563c382ed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"71d354731c07ff7c2cefeecb08e77d789e0470a303d1d2c2a03ec13563c382ed","first_computed_at":"2026-05-18T00:33:26.920580Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:26.920580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fVREVZMS3Xc7T27PMTeUjbFGSC/ifXViiisN8fbacWKJwnT/BPhrCjzD+v+HSFDDnFtBrelR7vouQDDVVWsLCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:26.921157Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.03154","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0b507075048797d4e20fda2cddff765f7f7151f9e26ac34a75df886f78c906bf","sha256:7490f6bd4c1c66fcad063e36536ebb7c1366214312c8a676843b6dd88daaba66"],"state_sha256":"7d355fab02501615dd0b5f57e9846d95813002444ed0bf69596ec10f971e54ac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GCyxn26u2InaZXXylkckq1euSPgTrKRhwTk79hktVQUMOX7jWW7Otr401tal9eg7LY4oWO/Zy/PQTOLBzjWLCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T01:27:08.571550Z","bundle_sha256":"5a20eb66ab7e7056d7bf42e3513f4278cfa612259c8c682ac5ea3f912b744649"}}