{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:TREGV2ZOXFZUX5CHQYHJ4B6ITV","short_pith_number":"pith:TREGV2ZO","canonical_record":{"source":{"id":"1503.02764","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-03-10T03:31:27Z","cross_cats_sorted":[],"title_canon_sha256":"4f328a2a18f3e567072e9ace9999dfee7905e2a8b8c3a79b536c84e20264d5f5","abstract_canon_sha256":"86a21a621eee4372d8570891036e2a89092412f05ed9186416c2955ae5a86cf4"},"schema_version":"1.0"},"canonical_sha256":"9c486aeb2eb9734bf447860e9e07c89d4585dd2bdc87ea6e9fd2376522df9549","source":{"kind":"arxiv","id":"1503.02764","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.02764","created_at":"2026-05-18T02:23:25Z"},{"alias_kind":"arxiv_version","alias_value":"1503.02764v2","created_at":"2026-05-18T02:23:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02764","created_at":"2026-05-18T02:23:25Z"},{"alias_kind":"pith_short_12","alias_value":"TREGV2ZOXFZU","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TREGV2ZOXFZUX5CH","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TREGV2ZO","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:TREGV2ZOXFZUX5CHQYHJ4B6ITV","target":"record","payload":{"canonical_record":{"source":{"id":"1503.02764","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-03-10T03:31:27Z","cross_cats_sorted":[],"title_canon_sha256":"4f328a2a18f3e567072e9ace9999dfee7905e2a8b8c3a79b536c84e20264d5f5","abstract_canon_sha256":"86a21a621eee4372d8570891036e2a89092412f05ed9186416c2955ae5a86cf4"},"schema_version":"1.0"},"canonical_sha256":"9c486aeb2eb9734bf447860e9e07c89d4585dd2bdc87ea6e9fd2376522df9549","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:25.868228Z","signature_b64":"5NoyT+1LPuPWbRJvSIAsQsUsTsqXfRaCLOhLr6E2bkOjTr1ZRiA+fKRx9SGxQ7z0VKRe/NM/LgBfx50lGwTUDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c486aeb2eb9734bf447860e9e07c89d4585dd2bdc87ea6e9fd2376522df9549","last_reissued_at":"2026-05-18T02:23:25.867628Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:25.867628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.02764","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:23:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tr3yU5imAvbSgjZrgYQDUBg+MFtNDLxqYPtG7M8aU2ROpr1ErYgJ2lU++J3QtC/gHzCAOxF2CaADNyR8z5F6Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:00:26.433183Z"},"content_sha256":"5546cab1fe8fcfbe43c5b6e6d10da1d1cbd761791a30c116056c18fbab7c3992","schema_version":"1.0","event_id":"sha256:5546cab1fe8fcfbe43c5b6e6d10da1d1cbd761791a30c116056c18fbab7c3992"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:TREGV2ZOXFZUX5CHQYHJ4B6ITV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimum Cost Constrained Input-Output and Control Configuration Co-Design Problem: A Structural Systems Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"George J. Pappas, Sergio Pequito, Soummya Kar","submitted_at":"2015-03-10T03:31:27Z","abstract_excerpt":"In this paper, we study the minimal cost constrained input-output (I/O) and control configuration co-design problem. Given a linear time-invariant plant, where a collection of possible inputs and outputs is known a priori, we aim to determine the collection of inputs, outputs and communication among them incurring in the minimum cost, such that desired control performance, measured in terms of arbitrary pole-placement capability of the closed-loop system, is ensured. We show that this problem is NP-hard in general (in the size of the state space). However, the subclass of problems, in which th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02764","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:23:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SRZ+jfV4ZtQyoIeQ43htT2NGPK/6MhfPk5Q04O1QULykuuNIvUKN7dUinEakVV2qSfYBfe/AFjYJ63LDHuntCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:00:26.433572Z"},"content_sha256":"8e84cd77795052b67485e1ef6dc5e806c69ee77df53f83a80c643b055c2aecbe","schema_version":"1.0","event_id":"sha256:8e84cd77795052b67485e1ef6dc5e806c69ee77df53f83a80c643b055c2aecbe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TREGV2ZOXFZUX5CHQYHJ4B6ITV/bundle.json","state_url":"https://pith.science/pith/TREGV2ZOXFZUX5CHQYHJ4B6ITV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TREGV2ZOXFZUX5CHQYHJ4B6ITV/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-01T19:00:26Z","links":{"resolver":"https://pith.science/pith/TREGV2ZOXFZUX5CHQYHJ4B6ITV","bundle":"https://pith.science/pith/TREGV2ZOXFZUX5CHQYHJ4B6ITV/bundle.json","state":"https://pith.science/pith/TREGV2ZOXFZUX5CHQYHJ4B6ITV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TREGV2ZOXFZUX5CHQYHJ4B6ITV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:TREGV2ZOXFZUX5CHQYHJ4B6ITV","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":"86a21a621eee4372d8570891036e2a89092412f05ed9186416c2955ae5a86cf4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-03-10T03:31:27Z","title_canon_sha256":"4f328a2a18f3e567072e9ace9999dfee7905e2a8b8c3a79b536c84e20264d5f5"},"schema_version":"1.0","source":{"id":"1503.02764","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.02764","created_at":"2026-05-18T02:23:25Z"},{"alias_kind":"arxiv_version","alias_value":"1503.02764v2","created_at":"2026-05-18T02:23:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02764","created_at":"2026-05-18T02:23:25Z"},{"alias_kind":"pith_short_12","alias_value":"TREGV2ZOXFZU","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TREGV2ZOXFZUX5CH","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TREGV2ZO","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:8e84cd77795052b67485e1ef6dc5e806c69ee77df53f83a80c643b055c2aecbe","target":"graph","created_at":"2026-05-18T02:23:25Z","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 minimal cost constrained input-output (I/O) and control configuration co-design problem. Given a linear time-invariant plant, where a collection of possible inputs and outputs is known a priori, we aim to determine the collection of inputs, outputs and communication among them incurring in the minimum cost, such that desired control performance, measured in terms of arbitrary pole-placement capability of the closed-loop system, is ensured. We show that this problem is NP-hard in general (in the size of the state space). However, the subclass of problems, in which th","authors_text":"George J. Pappas, Sergio Pequito, Soummya Kar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-03-10T03:31:27Z","title":"Minimum Cost Constrained Input-Output and Control Configuration Co-Design Problem: A Structural Systems Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02764","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:5546cab1fe8fcfbe43c5b6e6d10da1d1cbd761791a30c116056c18fbab7c3992","target":"record","created_at":"2026-05-18T02:23:25Z","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":"86a21a621eee4372d8570891036e2a89092412f05ed9186416c2955ae5a86cf4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-03-10T03:31:27Z","title_canon_sha256":"4f328a2a18f3e567072e9ace9999dfee7905e2a8b8c3a79b536c84e20264d5f5"},"schema_version":"1.0","source":{"id":"1503.02764","kind":"arxiv","version":2}},"canonical_sha256":"9c486aeb2eb9734bf447860e9e07c89d4585dd2bdc87ea6e9fd2376522df9549","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9c486aeb2eb9734bf447860e9e07c89d4585dd2bdc87ea6e9fd2376522df9549","first_computed_at":"2026-05-18T02:23:25.867628Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:23:25.867628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5NoyT+1LPuPWbRJvSIAsQsUsTsqXfRaCLOhLr6E2bkOjTr1ZRiA+fKRx9SGxQ7z0VKRe/NM/LgBfx50lGwTUDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:23:25.868228Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.02764","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5546cab1fe8fcfbe43c5b6e6d10da1d1cbd761791a30c116056c18fbab7c3992","sha256:8e84cd77795052b67485e1ef6dc5e806c69ee77df53f83a80c643b055c2aecbe"],"state_sha256":"44cd137f95371ed694acd8d9d002fe8ec004d1ec45d9ef8b28945fa0b042afa6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fdj4BojT6t7SwKODAx+pKlA62OcgH/0knUfs9Wd7V7u1yRencLy1ZYC9Zaywzb9jsLm04GqiuBQON2c0c7neDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T19:00:26.435686Z","bundle_sha256":"27914b02234f87825c65f14e1f9019cc08fdafafea65062409c9cfd2d518eb50"}}