{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:3XDIXGVZ32UQLNWXFB6QCHDOHS","short_pith_number":"pith:3XDIXGVZ","schema_version":"1.0","canonical_sha256":"ddc68b9ab9dea905b6d7287d011c6e3cac37eb1d9c074a3a4339b5a3de554770","source":{"kind":"arxiv","id":"1504.02532","version":2},"attestation_state":"computed","paper":{"title":"Optimal Design of Switched Networks of Positive Linear Systems via Geometric Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"math.OC","authors_text":"Masaki Ogura, Victor M. Preciado","submitted_at":"2015-04-10T02:02:51Z","abstract_excerpt":"In this paper, we propose an optimization framework to design a network of positive linear systems whose structure switches according to a Markov process. The optimization framework herein proposed allows the network designer to optimize the coupling elements of a directed network, as well as the dynamics of the nodes in order to maximize the stabilization rate of the network and/or the disturbance rejection against an exogenous input. The cost of implementing a particular network is modeled using posynomial cost functions, which allow for a wide variety of modeling options. In this context, w"},"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":"1504.02532","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-04-10T02:02:51Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"d09b3feed75bb098b54993bef1e441ffb3499877331722edc96444f77e9d6030","abstract_canon_sha256":"a4238f8ee3d48f1f9e100988dcb9f6e86763ccc993405ee7e5d6554ae11c1fbb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:06.516456Z","signature_b64":"nH0oc2OvZ/bPHh5QleNrHHAiXc98J8wqgyfqiCtExvL4tCkr7EErywY2++X+ZaIMqIhwvqVtyocQPko9V89lBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ddc68b9ab9dea905b6d7287d011c6e3cac37eb1d9c074a3a4339b5a3de554770","last_reissued_at":"2026-05-17T23:51:06.515972Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:06.515972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Design of Switched Networks of Positive Linear Systems via Geometric Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"math.OC","authors_text":"Masaki Ogura, Victor M. Preciado","submitted_at":"2015-04-10T02:02:51Z","abstract_excerpt":"In this paper, we propose an optimization framework to design a network of positive linear systems whose structure switches according to a Markov process. The optimization framework herein proposed allows the network designer to optimize the coupling elements of a directed network, as well as the dynamics of the nodes in order to maximize the stabilization rate of the network and/or the disturbance rejection against an exogenous input. The cost of implementing a particular network is modeled using posynomial cost functions, which allow for a wide variety of modeling options. In this context, w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.02532","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":"1504.02532","created_at":"2026-05-17T23:51:06.516043+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.02532v2","created_at":"2026-05-17T23:51:06.516043+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.02532","created_at":"2026-05-17T23:51:06.516043+00:00"},{"alias_kind":"pith_short_12","alias_value":"3XDIXGVZ32UQ","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"3XDIXGVZ32UQLNWX","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"3XDIXGVZ","created_at":"2026-05-18T12:29:02.477457+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/3XDIXGVZ32UQLNWXFB6QCHDOHS","json":"https://pith.science/pith/3XDIXGVZ32UQLNWXFB6QCHDOHS.json","graph_json":"https://pith.science/api/pith-number/3XDIXGVZ32UQLNWXFB6QCHDOHS/graph.json","events_json":"https://pith.science/api/pith-number/3XDIXGVZ32UQLNWXFB6QCHDOHS/events.json","paper":"https://pith.science/paper/3XDIXGVZ"},"agent_actions":{"view_html":"https://pith.science/pith/3XDIXGVZ32UQLNWXFB6QCHDOHS","download_json":"https://pith.science/pith/3XDIXGVZ32UQLNWXFB6QCHDOHS.json","view_paper":"https://pith.science/paper/3XDIXGVZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.02532&json=true","fetch_graph":"https://pith.science/api/pith-number/3XDIXGVZ32UQLNWXFB6QCHDOHS/graph.json","fetch_events":"https://pith.science/api/pith-number/3XDIXGVZ32UQLNWXFB6QCHDOHS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3XDIXGVZ32UQLNWXFB6QCHDOHS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3XDIXGVZ32UQLNWXFB6QCHDOHS/action/storage_attestation","attest_author":"https://pith.science/pith/3XDIXGVZ32UQLNWXFB6QCHDOHS/action/author_attestation","sign_citation":"https://pith.science/pith/3XDIXGVZ32UQLNWXFB6QCHDOHS/action/citation_signature","submit_replication":"https://pith.science/pith/3XDIXGVZ32UQLNWXFB6QCHDOHS/action/replication_record"}},"created_at":"2026-05-17T23:51:06.516043+00:00","updated_at":"2026-05-17T23:51:06.516043+00:00"}