{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:K6NXUNODXKIK5OK5SL4HUPZSYZ","short_pith_number":"pith:K6NXUNOD","schema_version":"1.0","canonical_sha256":"579b7a35c3ba90aeb95d92f87a3f32c6729852119a75bcfcffd5ed8b8f0b7b1f","source":{"kind":"arxiv","id":"1705.09600","version":2},"attestation_state":"computed","paper":{"title":"Approximating Constrained Minimum Cost Input-Output Selection for Generic Arbitrary Pole Placement in Structured Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Madhu N. Belur, Prasanna Chaporkar, Shana Moothedath","submitted_at":"2017-05-26T14:41:28Z","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"},"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":"1705.09600","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-26T14:41:28Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"611b914d52b5c0537a095e22d5a33dae574d636433758e602555c1fb6b945f03","abstract_canon_sha256":"5b85fab638f492e449c29f7c526008efd43e12ece5157f1e8f1afde124df4215"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:18.275230Z","signature_b64":"wHNQSXXfNfukwJVdeHWSiMKQP8u5Gjr+IlBlaQBEjEDwsILdL42ytjTYGZuaMUAMtw2VxZxwS5x+ORg89F0ODA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"579b7a35c3ba90aeb95d92f87a3f32c6729852119a75bcfcffd5ed8b8f0b7b1f","last_reissued_at":"2026-05-18T00:26:18.274749Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:18.274749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating Constrained Minimum Cost Input-Output Selection for Generic Arbitrary Pole Placement in Structured Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Madhu N. Belur, Prasanna Chaporkar, Shana Moothedath","submitted_at":"2017-05-26T14:41:28Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09600","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":"1705.09600","created_at":"2026-05-18T00:26:18.274829+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.09600v2","created_at":"2026-05-18T00:26:18.274829+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09600","created_at":"2026-05-18T00:26:18.274829+00:00"},{"alias_kind":"pith_short_12","alias_value":"K6NXUNODXKIK","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"K6NXUNODXKIK5OK5","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"K6NXUNOD","created_at":"2026-05-18T12:31:24.725408+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/K6NXUNODXKIK5OK5SL4HUPZSYZ","json":"https://pith.science/pith/K6NXUNODXKIK5OK5SL4HUPZSYZ.json","graph_json":"https://pith.science/api/pith-number/K6NXUNODXKIK5OK5SL4HUPZSYZ/graph.json","events_json":"https://pith.science/api/pith-number/K6NXUNODXKIK5OK5SL4HUPZSYZ/events.json","paper":"https://pith.science/paper/K6NXUNOD"},"agent_actions":{"view_html":"https://pith.science/pith/K6NXUNODXKIK5OK5SL4HUPZSYZ","download_json":"https://pith.science/pith/K6NXUNODXKIK5OK5SL4HUPZSYZ.json","view_paper":"https://pith.science/paper/K6NXUNOD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.09600&json=true","fetch_graph":"https://pith.science/api/pith-number/K6NXUNODXKIK5OK5SL4HUPZSYZ/graph.json","fetch_events":"https://pith.science/api/pith-number/K6NXUNODXKIK5OK5SL4HUPZSYZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K6NXUNODXKIK5OK5SL4HUPZSYZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K6NXUNODXKIK5OK5SL4HUPZSYZ/action/storage_attestation","attest_author":"https://pith.science/pith/K6NXUNODXKIK5OK5SL4HUPZSYZ/action/author_attestation","sign_citation":"https://pith.science/pith/K6NXUNODXKIK5OK5SL4HUPZSYZ/action/citation_signature","submit_replication":"https://pith.science/pith/K6NXUNODXKIK5OK5SL4HUPZSYZ/action/replication_record"}},"created_at":"2026-05-18T00:26:18.274829+00:00","updated_at":"2026-05-18T00:26:18.274829+00:00"}