{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:UFWKQEZ4XXIO2OYM5HKBXIYACO","short_pith_number":"pith:UFWKQEZ4","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"},"canonical_sha256":"a16ca8133cbdd0ed3b0ce9d41ba30013b7da47cd8e650baf42cf91a4f81d8e2e","source":{"kind":"arxiv","id":"1503.04693","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.04693","created_at":"2026-05-18T02:23:24Z"},{"alias_kind":"arxiv_version","alias_value":"1503.04693v1","created_at":"2026-05-18T02:23:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.04693","created_at":"2026-05-18T02:23:24Z"},{"alias_kind":"pith_short_12","alias_value":"UFWKQEZ4XXIO","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UFWKQEZ4XXIO2OYM","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UFWKQEZ4","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:UFWKQEZ4XXIO2OYM5HKBXIYACO","target":"record","payload":{"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"},"canonical_sha256":"a16ca8133cbdd0ed3b0ce9d41ba30013b7da47cd8e650baf42cf91a4f81d8e2e","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"},"source_kind":"arxiv","source_id":"1503.04693","source_version":1,"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:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3CmJfyUr3vEIJPcA4BRFRdSXrpifYtTbZ17dUYR8hxPGlgfdjHNT2Gj/dmimkBMFgCURIY6DW1UVQYCrfNBJBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:58:45.184951Z"},"content_sha256":"f1f8fec8dbdc19b79801240900120f196f47d313f465afaf5ff7b1d92ca042d4","schema_version":"1.0","event_id":"sha256:f1f8fec8dbdc19b79801240900120f196f47d313f465afaf5ff7b1d92ca042d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:UFWKQEZ4XXIO2OYM5HKBXIYACO","target":"graph","payload":{"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"},"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:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yVWdB/ynT3LeTjY/Ud66ZZXxXgZ7U15YH5Ve5gX37M8XkOSchPT53EQvTK295QfWaMLhBmSov9HCshGMxKYSCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:58:45.185307Z"},"content_sha256":"3a9c5adbd478b4e80c279d2357b845754a0941d2eb1b11b76d5a23a91340e3fd","schema_version":"1.0","event_id":"sha256:3a9c5adbd478b4e80c279d2357b845754a0941d2eb1b11b76d5a23a91340e3fd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UFWKQEZ4XXIO2OYM5HKBXIYACO/bundle.json","state_url":"https://pith.science/pith/UFWKQEZ4XXIO2OYM5HKBXIYACO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UFWKQEZ4XXIO2OYM5HKBXIYACO/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-02T14:58:45Z","links":{"resolver":"https://pith.science/pith/UFWKQEZ4XXIO2OYM5HKBXIYACO","bundle":"https://pith.science/pith/UFWKQEZ4XXIO2OYM5HKBXIYACO/bundle.json","state":"https://pith.science/pith/UFWKQEZ4XXIO2OYM5HKBXIYACO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UFWKQEZ4XXIO2OYM5HKBXIYACO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:UFWKQEZ4XXIO2OYM5HKBXIYACO","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":"1e1856db65d808c02dbe95dd7e72bac0e23e967bbb4e4200495408a2abfc67d4","cross_cats_sorted":["cs.SI","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-03-16T15:42:08Z","title_canon_sha256":"9d9d68831eac029569779d5cd6b772970b805f2ec5d138318d0694a85a291a30"},"schema_version":"1.0","source":{"id":"1503.04693","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.04693","created_at":"2026-05-18T02:23:24Z"},{"alias_kind":"arxiv_version","alias_value":"1503.04693v1","created_at":"2026-05-18T02:23:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.04693","created_at":"2026-05-18T02:23:24Z"},{"alias_kind":"pith_short_12","alias_value":"UFWKQEZ4XXIO","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UFWKQEZ4XXIO2OYM","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UFWKQEZ4","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:3a9c5adbd478b4e80c279d2357b845754a0941d2eb1b11b76d5a23a91340e3fd","target":"graph","created_at":"2026-05-18T02:23:24Z","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":"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","authors_text":"Ali Jadbabaie, George J. Pappas, Mohammad Amin Rahimian, Vasileios Tzoumas","cross_cats":["cs.SI","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-03-16T15:42:08Z","title":"Minimal Actuator Placement with Optimal Control Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.04693","kind":"arxiv","version":1},"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:f1f8fec8dbdc19b79801240900120f196f47d313f465afaf5ff7b1d92ca042d4","target":"record","created_at":"2026-05-18T02:23:24Z","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":"1e1856db65d808c02dbe95dd7e72bac0e23e967bbb4e4200495408a2abfc67d4","cross_cats_sorted":["cs.SI","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-03-16T15:42:08Z","title_canon_sha256":"9d9d68831eac029569779d5cd6b772970b805f2ec5d138318d0694a85a291a30"},"schema_version":"1.0","source":{"id":"1503.04693","kind":"arxiv","version":1}},"canonical_sha256":"a16ca8133cbdd0ed3b0ce9d41ba30013b7da47cd8e650baf42cf91a4f81d8e2e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a16ca8133cbdd0ed3b0ce9d41ba30013b7da47cd8e650baf42cf91a4f81d8e2e","first_computed_at":"2026-05-18T02:23:24.244180Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:23:24.244180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2xUOewzXzC7BkDqzWskJlv77zdme+Km7Sxul+tpMEsh+1BZNEi1uBSxbwh97AA1bxQBmMpZsNcC0OtKR8EcBBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:23:24.244788Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.04693","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f1f8fec8dbdc19b79801240900120f196f47d313f465afaf5ff7b1d92ca042d4","sha256:3a9c5adbd478b4e80c279d2357b845754a0941d2eb1b11b76d5a23a91340e3fd"],"state_sha256":"97aa9b2ea11c431b09fc581da477a04a32f61391712fc3ac1d15367d19852600"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lieN1Sr2OM091Lvh00FzrNtZa6nz13JnKke2ETZuXX2paQDJusMX64PpaWAb1gLoKdG9eCJrObeQdJ/eIkS2BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T14:58:45.187324Z","bundle_sha256":"00896ed296288289107a4d90501a3c3626081f3455ba33e6453885dfdab3b472"}}