{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:K6NXUNODXKIK5OK5SL4HUPZSYZ","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":"5b85fab638f492e449c29f7c526008efd43e12ece5157f1e8f1afde124df4215","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-26T14:41:28Z","title_canon_sha256":"611b914d52b5c0537a095e22d5a33dae574d636433758e602555c1fb6b945f03"},"schema_version":"1.0","source":{"id":"1705.09600","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09600","created_at":"2026-05-18T00:26:18Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09600v2","created_at":"2026-05-18T00:26:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09600","created_at":"2026-05-18T00:26:18Z"},{"alias_kind":"pith_short_12","alias_value":"K6NXUNODXKIK","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"K6NXUNODXKIK5OK5","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"K6NXUNOD","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:95b21861af8ac942cd942e595e5804570b9505eb590d6e04444a87ec7b1a9239","target":"graph","created_at":"2026-05-18T00:26:18Z","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 is about minimum cost constrained selection of inputs and outputs for generic arbitrary pole placement. The input-output set is constrained in the sense that the set of states that each input can influence and the set of states that each output can sense is pre-specified. Our goal is to optimally select an input-output set that the system has no structurally fixed modes. Polynomial algorithms do not exist for solving this problem unless P=NP. To this end, we propose an approximation algorithm by splitting the problem in to three sub-problems: a) minimum cost accessibility problem, b","authors_text":"Madhu N. Belur, Prasanna Chaporkar, Shana Moothedath","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-26T14:41:28Z","title":"Approximating Constrained Minimum Cost Input-Output Selection for Generic Arbitrary Pole Placement in Structured Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09600","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:6795c6d3739f59adfab9cfe32df4c6e09e0733cec1277b4396f5c12f3a1eeba5","target":"record","created_at":"2026-05-18T00:26:18Z","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":"5b85fab638f492e449c29f7c526008efd43e12ece5157f1e8f1afde124df4215","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-26T14:41:28Z","title_canon_sha256":"611b914d52b5c0537a095e22d5a33dae574d636433758e602555c1fb6b945f03"},"schema_version":"1.0","source":{"id":"1705.09600","kind":"arxiv","version":2}},"canonical_sha256":"579b7a35c3ba90aeb95d92f87a3f32c6729852119a75bcfcffd5ed8b8f0b7b1f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"579b7a35c3ba90aeb95d92f87a3f32c6729852119a75bcfcffd5ed8b8f0b7b1f","first_computed_at":"2026-05-18T00:26:18.274749Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:18.274749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wHNQSXXfNfukwJVdeHWSiMKQP8u5Gjr+IlBlaQBEjEDwsILdL42ytjTYGZuaMUAMtw2VxZxwS5x+ORg89F0ODA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:18.275230Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.09600","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6795c6d3739f59adfab9cfe32df4c6e09e0733cec1277b4396f5c12f3a1eeba5","sha256:95b21861af8ac942cd942e595e5804570b9505eb590d6e04444a87ec7b1a9239"],"state_sha256":"916593d6da8afea4a63dd4b51f3a54bf248029a899bd86f06e518897dda8c6d2"}