{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EC2TXTPCPGLYLI3NLO64DSN3ET","short_pith_number":"pith:EC2TXTPC","schema_version":"1.0","canonical_sha256":"20b53bcde2799785a36d5bbdc1c9bb24fffcec1bb0b3d0447f6149de71061437","source":{"kind":"arxiv","id":"1803.05640","version":2},"attestation_state":"computed","paper":{"title":"Optimal Weight Allocation of Dynamic Distribution Networks and Positive Semi-definiteness of Signed Laplacians","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":"2018-03-15T08:52:00Z","abstract_excerpt":"In this paper, we consider the robustness of a basic model of a dynamical distribution network. In the first problem, i.e., optimal weight allocation, we minimize the H-inf- norm of the dynamical distribution network subject to allocation of the weights on the edges. It is shown that this optimization problem can be formulated as a semi-definite program. Next we consider the semi-definiteness of the weighted graph Laplacian matrix with negative weights on the edges. A necessary and sufficient condition, using the effective resistance matrix, is established to guarantee the positive semi-defini"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1803.05640","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-15T08:52:00Z","cross_cats_sorted":[],"title_canon_sha256":"88ef2fc421cd45409d407a8aab9415a7cbe497d69a839be1a5c2d4ec0bd2fe51","abstract_canon_sha256":"b6b92824f10128dd427cf32a5d1f1e31b008a233eea1ca93eb5cc752a1b330f5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:59.014999Z","signature_b64":"MA5DlVTl/1emjj9L+jSH6rIASOGpHr1khS43WtCdWrV+EMYXdOv8HDHVt3ZnNYXjr1subqYbdXx6pb6PepxaCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20b53bcde2799785a36d5bbdc1c9bb24fffcec1bb0b3d0447f6149de71061437","last_reissued_at":"2026-05-18T00:16:59.014194Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:59.014194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Weight Allocation of Dynamic Distribution Networks and Positive Semi-definiteness of Signed Laplacians","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":"2018-03-15T08:52:00Z","abstract_excerpt":"In this paper, we consider the robustness of a basic model of a dynamical distribution network. In the first problem, i.e., optimal weight allocation, we minimize the H-inf- norm of the dynamical distribution network subject to allocation of the weights on the edges. It is shown that this optimization problem can be formulated as a semi-definite program. Next we consider the semi-definiteness of the weighted graph Laplacian matrix with negative weights on the edges. A necessary and sufficient condition, using the effective resistance matrix, is established to guarantee the positive semi-defini"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.05640","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1803.05640","created_at":"2026-05-18T00:16:59.014332+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.05640v2","created_at":"2026-05-18T00:16:59.014332+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.05640","created_at":"2026-05-18T00:16:59.014332+00:00"},{"alias_kind":"pith_short_12","alias_value":"EC2TXTPCPGLY","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EC2TXTPCPGLYLI3N","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EC2TXTPC","created_at":"2026-05-18T12:32:22.470017+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EC2TXTPCPGLYLI3NLO64DSN3ET","json":"https://pith.science/pith/EC2TXTPCPGLYLI3NLO64DSN3ET.json","graph_json":"https://pith.science/api/pith-number/EC2TXTPCPGLYLI3NLO64DSN3ET/graph.json","events_json":"https://pith.science/api/pith-number/EC2TXTPCPGLYLI3NLO64DSN3ET/events.json","paper":"https://pith.science/paper/EC2TXTPC"},"agent_actions":{"view_html":"https://pith.science/pith/EC2TXTPCPGLYLI3NLO64DSN3ET","download_json":"https://pith.science/pith/EC2TXTPCPGLYLI3NLO64DSN3ET.json","view_paper":"https://pith.science/paper/EC2TXTPC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.05640&json=true","fetch_graph":"https://pith.science/api/pith-number/EC2TXTPCPGLYLI3NLO64DSN3ET/graph.json","fetch_events":"https://pith.science/api/pith-number/EC2TXTPCPGLYLI3NLO64DSN3ET/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EC2TXTPCPGLYLI3NLO64DSN3ET/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EC2TXTPCPGLYLI3NLO64DSN3ET/action/storage_attestation","attest_author":"https://pith.science/pith/EC2TXTPCPGLYLI3NLO64DSN3ET/action/author_attestation","sign_citation":"https://pith.science/pith/EC2TXTPCPGLYLI3NLO64DSN3ET/action/citation_signature","submit_replication":"https://pith.science/pith/EC2TXTPCPGLYLI3NLO64DSN3ET/action/replication_record"}},"created_at":"2026-05-18T00:16:59.014332+00:00","updated_at":"2026-05-18T00:16:59.014332+00:00"}