{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:BXYANTJ6BYF3HIJH2EYH7ZH4KF","short_pith_number":"pith:BXYANTJ6","canonical_record":{"source":{"id":"1409.3289","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-09-11T01:15:24Z","cross_cats_sorted":["cs.MA","cs.SY","math.DS"],"title_canon_sha256":"26ad0fb3542ac0afe87a3a41a8b23bd432647cfc394776c1d15b4aaa03f6be75","abstract_canon_sha256":"51413933d1c61adb7f47303d9ac94cbe8fd41e67b02b7d7e6c64ee78def7d373"},"schema_version":"1.0"},"canonical_sha256":"0df006cd3e0e0bb3a127d1307fe4fc5160c2f3b04f1b288d6b428987a5968e82","source":{"kind":"arxiv","id":"1409.3289","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.3289","created_at":"2026-05-18T00:53:51Z"},{"alias_kind":"arxiv_version","alias_value":"1409.3289v5","created_at":"2026-05-18T00:53:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.3289","created_at":"2026-05-18T00:53:51Z"},{"alias_kind":"pith_short_12","alias_value":"BXYANTJ6BYF3","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BXYANTJ6BYF3HIJH","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BXYANTJ6","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:BXYANTJ6BYF3HIJH2EYH7ZH4KF","target":"record","payload":{"canonical_record":{"source":{"id":"1409.3289","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-09-11T01:15:24Z","cross_cats_sorted":["cs.MA","cs.SY","math.DS"],"title_canon_sha256":"26ad0fb3542ac0afe87a3a41a8b23bd432647cfc394776c1d15b4aaa03f6be75","abstract_canon_sha256":"51413933d1c61adb7f47303d9ac94cbe8fd41e67b02b7d7e6c64ee78def7d373"},"schema_version":"1.0"},"canonical_sha256":"0df006cd3e0e0bb3a127d1307fe4fc5160c2f3b04f1b288d6b428987a5968e82","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:51.493380Z","signature_b64":"yRn/g2Bs08i11pq/5F7K1QPgSRyNrNxHDnLQMH9qt6X0EEqoyWXMFuJhOCIOav4zR/miDjMRPI+Q2YmBHXelAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0df006cd3e0e0bb3a127d1307fe4fc5160c2f3b04f1b288d6b428987a5968e82","last_reissued_at":"2026-05-18T00:53:51.492973Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:51.492973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.3289","source_version":5,"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-18T00:53:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FpCu2z4Zx6/MrNYhKdSCtuKVXRAV4JHXuhDaNwdqyvzHhwRIFlnkvmZPdhqLJGawC9llloXN17QoieMlhLFtAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T10:03:28.608641Z"},"content_sha256":"e88dd5a4fa10420fb6eaf0e231a677bfc35f48857cd358277ae1aa536adef3b9","schema_version":"1.0","event_id":"sha256:e88dd5a4fa10420fb6eaf0e231a677bfc35f48857cd358277ae1aa536adef3b9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:BXYANTJ6BYF3HIJH2EYH7ZH4KF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimal Actuator Placement with Bounds on Control Effort","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA","cs.SY","math.DS"],"primary_cat":"math.OC","authors_text":"A. Jadbabaie, G. J. Pappas, M. A. Rahimian, V. Tzoumas","submitted_at":"2014-09-11T01:15:24Z","abstract_excerpt":"We address the problem of minimal actuator placement in linear systems so that the volume of the set of states reachable with one unit or less of input energy is lower bounded by a desired value. First, following the recent work of Olshevsky, we prove that this is NP-hard. Then, we provide an efficient algorithm which, for a given range of problem parameters, approximates up to a multiplicative factor of O(logn), n being the network size, any optimal actuator set that meets the same energy criteria; this is the best approximation factor one can achieve in polynomial time, in the worst case. Mo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.3289","kind":"arxiv","version":5},"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-18T00:53:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ox/A16TbLYYONcztWwqCT1LRfVSQ9UKGKxkKIKWO6WAOJxvaEeQvkRXwu/MSLwIXyBubktv5C++VdbNkxC3HBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T10:03:28.608985Z"},"content_sha256":"ac1f62f430fd7704808c1c19c2267e7df0bb2b5d6d8476cabf6a48bd1f2b3d8c","schema_version":"1.0","event_id":"sha256:ac1f62f430fd7704808c1c19c2267e7df0bb2b5d6d8476cabf6a48bd1f2b3d8c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BXYANTJ6BYF3HIJH2EYH7ZH4KF/bundle.json","state_url":"https://pith.science/pith/BXYANTJ6BYF3HIJH2EYH7ZH4KF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BXYANTJ6BYF3HIJH2EYH7ZH4KF/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-08T10:03:28Z","links":{"resolver":"https://pith.science/pith/BXYANTJ6BYF3HIJH2EYH7ZH4KF","bundle":"https://pith.science/pith/BXYANTJ6BYF3HIJH2EYH7ZH4KF/bundle.json","state":"https://pith.science/pith/BXYANTJ6BYF3HIJH2EYH7ZH4KF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BXYANTJ6BYF3HIJH2EYH7ZH4KF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:BXYANTJ6BYF3HIJH2EYH7ZH4KF","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":"51413933d1c61adb7f47303d9ac94cbe8fd41e67b02b7d7e6c64ee78def7d373","cross_cats_sorted":["cs.MA","cs.SY","math.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-09-11T01:15:24Z","title_canon_sha256":"26ad0fb3542ac0afe87a3a41a8b23bd432647cfc394776c1d15b4aaa03f6be75"},"schema_version":"1.0","source":{"id":"1409.3289","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.3289","created_at":"2026-05-18T00:53:51Z"},{"alias_kind":"arxiv_version","alias_value":"1409.3289v5","created_at":"2026-05-18T00:53:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.3289","created_at":"2026-05-18T00:53:51Z"},{"alias_kind":"pith_short_12","alias_value":"BXYANTJ6BYF3","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BXYANTJ6BYF3HIJH","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BXYANTJ6","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:ac1f62f430fd7704808c1c19c2267e7df0bb2b5d6d8476cabf6a48bd1f2b3d8c","target":"graph","created_at":"2026-05-18T00:53:51Z","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 address the problem of minimal actuator placement in linear systems so that the volume of the set of states reachable with one unit or less of input energy is lower bounded by a desired value. First, following the recent work of Olshevsky, we prove that this is NP-hard. Then, we provide an efficient algorithm which, for a given range of problem parameters, approximates up to a multiplicative factor of O(logn), n being the network size, any optimal actuator set that meets the same energy criteria; this is the best approximation factor one can achieve in polynomial time, in the worst case. Mo","authors_text":"A. Jadbabaie, G. J. Pappas, M. A. Rahimian, V. Tzoumas","cross_cats":["cs.MA","cs.SY","math.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-09-11T01:15:24Z","title":"Minimal Actuator Placement with Bounds on Control Effort"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.3289","kind":"arxiv","version":5},"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:e88dd5a4fa10420fb6eaf0e231a677bfc35f48857cd358277ae1aa536adef3b9","target":"record","created_at":"2026-05-18T00:53:51Z","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":"51413933d1c61adb7f47303d9ac94cbe8fd41e67b02b7d7e6c64ee78def7d373","cross_cats_sorted":["cs.MA","cs.SY","math.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-09-11T01:15:24Z","title_canon_sha256":"26ad0fb3542ac0afe87a3a41a8b23bd432647cfc394776c1d15b4aaa03f6be75"},"schema_version":"1.0","source":{"id":"1409.3289","kind":"arxiv","version":5}},"canonical_sha256":"0df006cd3e0e0bb3a127d1307fe4fc5160c2f3b04f1b288d6b428987a5968e82","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0df006cd3e0e0bb3a127d1307fe4fc5160c2f3b04f1b288d6b428987a5968e82","first_computed_at":"2026-05-18T00:53:51.492973Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:51.492973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yRn/g2Bs08i11pq/5F7K1QPgSRyNrNxHDnLQMH9qt6X0EEqoyWXMFuJhOCIOav4zR/miDjMRPI+Q2YmBHXelAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:51.493380Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.3289","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e88dd5a4fa10420fb6eaf0e231a677bfc35f48857cd358277ae1aa536adef3b9","sha256:ac1f62f430fd7704808c1c19c2267e7df0bb2b5d6d8476cabf6a48bd1f2b3d8c"],"state_sha256":"d53af6284b10c65d808c400d82f8b8f5090db48766172daedcd84b2d274b2184"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"98fafq0LtzkidWmBxRTxGIr0Wlb1K/RUMLCb+AEwyoKyMnFzsKZpElV6sOpDeTePOMG1srMvRhOzE2P9POeqBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T10:03:28.610915Z","bundle_sha256":"896c273fbaa3cfaad50e5c148c90227abdb532aa2d56863bc7cdcf0adf170c3e"}}