{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:UFWKQEZ4XXIO2OYM5HKBXIYACO","short_pith_number":"pith:UFWKQEZ4","schema_version":"1.0","canonical_sha256":"a16ca8133cbdd0ed3b0ce9d41ba30013b7da47cd8e650baf42cf91a4f81d8e2e","source":{"kind":"arxiv","id":"1503.04693","version":1},"attestation_state":"computed","paper":{"title":"Minimal Actuator Placement with Optimal Control Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","math.OC"],"primary_cat":"cs.SY","authors_text":"Ali Jadbabaie, George J. Pappas, Mohammad Amin Rahimian, Vasileios Tzoumas","submitted_at":"2015-03-16T15:42:08Z","abstract_excerpt":"We introduce the problem of minimal actuator placement in a linear control system so that a bound on the minimum control effort for a given state transfer is satisfied while controllability is ensured. We first show that this is an NP-hard problem following the recent work of Olshevsky. Next, we prove that this problem has a supermodular structure. Afterwards, we provide an efficient algorithm that approximates up to a multiplicative factor of O(logn), where n is the size of the multi-agent network, any optimal actuator set that meets the specified energy criterion. Moreover, we show that this"},"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":"1503.04693","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-03-16T15:42:08Z","cross_cats_sorted":["cs.SI","math.OC"],"title_canon_sha256":"9d9d68831eac029569779d5cd6b772970b805f2ec5d138318d0694a85a291a30","abstract_canon_sha256":"1e1856db65d808c02dbe95dd7e72bac0e23e967bbb4e4200495408a2abfc67d4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:24.244788Z","signature_b64":"2xUOewzXzC7BkDqzWskJlv77zdme+Km7Sxul+tpMEsh+1BZNEi1uBSxbwh97AA1bxQBmMpZsNcC0OtKR8EcBBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a16ca8133cbdd0ed3b0ce9d41ba30013b7da47cd8e650baf42cf91a4f81d8e2e","last_reissued_at":"2026-05-18T02:23:24.244180Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:24.244180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimal Actuator Placement with Optimal Control Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","math.OC"],"primary_cat":"cs.SY","authors_text":"Ali Jadbabaie, George J. Pappas, Mohammad Amin Rahimian, Vasileios Tzoumas","submitted_at":"2015-03-16T15:42:08Z","abstract_excerpt":"We introduce the problem of minimal actuator placement in a linear control system so that a bound on the minimum control effort for a given state transfer is satisfied while controllability is ensured. We first show that this is an NP-hard problem following the recent work of Olshevsky. Next, we prove that this problem has a supermodular structure. Afterwards, we provide an efficient algorithm that approximates up to a multiplicative factor of O(logn), where n is the size of the multi-agent network, any optimal actuator set that meets the specified energy criterion. Moreover, we show that this"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.04693","kind":"arxiv","version":1},"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":"1503.04693","created_at":"2026-05-18T02:23:24.244269+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.04693v1","created_at":"2026-05-18T02:23:24.244269+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.04693","created_at":"2026-05-18T02:23:24.244269+00:00"},{"alias_kind":"pith_short_12","alias_value":"UFWKQEZ4XXIO","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"UFWKQEZ4XXIO2OYM","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"UFWKQEZ4","created_at":"2026-05-18T12:29:44.643036+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/UFWKQEZ4XXIO2OYM5HKBXIYACO","json":"https://pith.science/pith/UFWKQEZ4XXIO2OYM5HKBXIYACO.json","graph_json":"https://pith.science/api/pith-number/UFWKQEZ4XXIO2OYM5HKBXIYACO/graph.json","events_json":"https://pith.science/api/pith-number/UFWKQEZ4XXIO2OYM5HKBXIYACO/events.json","paper":"https://pith.science/paper/UFWKQEZ4"},"agent_actions":{"view_html":"https://pith.science/pith/UFWKQEZ4XXIO2OYM5HKBXIYACO","download_json":"https://pith.science/pith/UFWKQEZ4XXIO2OYM5HKBXIYACO.json","view_paper":"https://pith.science/paper/UFWKQEZ4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.04693&json=true","fetch_graph":"https://pith.science/api/pith-number/UFWKQEZ4XXIO2OYM5HKBXIYACO/graph.json","fetch_events":"https://pith.science/api/pith-number/UFWKQEZ4XXIO2OYM5HKBXIYACO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UFWKQEZ4XXIO2OYM5HKBXIYACO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UFWKQEZ4XXIO2OYM5HKBXIYACO/action/storage_attestation","attest_author":"https://pith.science/pith/UFWKQEZ4XXIO2OYM5HKBXIYACO/action/author_attestation","sign_citation":"https://pith.science/pith/UFWKQEZ4XXIO2OYM5HKBXIYACO/action/citation_signature","submit_replication":"https://pith.science/pith/UFWKQEZ4XXIO2OYM5HKBXIYACO/action/replication_record"}},"created_at":"2026-05-18T02:23:24.244269+00:00","updated_at":"2026-05-18T02:23:24.244269+00:00"}