{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:QGN4PV2XD66UOZ4QKPVA2Q7CFO","short_pith_number":"pith:QGN4PV2X","canonical_record":{"source":{"id":"1304.3071","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-04-10T19:54:55Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"c785457639c6a7ed9f15a78d66aa9c36f8bc4615470327495959c7b9b99571c9","abstract_canon_sha256":"e70f248c4344012e280c3402b718d274dd30adf9a8a5bcec60618352a916256f"},"schema_version":"1.0"},"canonical_sha256":"819bc7d7571fbd47679053ea0d43e22b8576102de4c461c025380dd174e88f42","source":{"kind":"arxiv","id":"1304.3071","version":7},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.3071","created_at":"2026-05-18T02:52:42Z"},{"alias_kind":"arxiv_version","alias_value":"1304.3071v7","created_at":"2026-05-18T02:52:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.3071","created_at":"2026-05-18T02:52:42Z"},{"alias_kind":"pith_short_12","alias_value":"QGN4PV2XD66U","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QGN4PV2XD66UOZ4Q","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QGN4PV2X","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:QGN4PV2XD66UOZ4QKPVA2Q7CFO","target":"record","payload":{"canonical_record":{"source":{"id":"1304.3071","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-04-10T19:54:55Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"c785457639c6a7ed9f15a78d66aa9c36f8bc4615470327495959c7b9b99571c9","abstract_canon_sha256":"e70f248c4344012e280c3402b718d274dd30adf9a8a5bcec60618352a916256f"},"schema_version":"1.0"},"canonical_sha256":"819bc7d7571fbd47679053ea0d43e22b8576102de4c461c025380dd174e88f42","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:42.124449Z","signature_b64":"xzyXojkahH1bTLBZxNEyeK1MRKWOA5Kp5Z1WT2/POsOjJ3Yo9Dzmdk88R2FNrYI8mKXWPpIS6lDmouky6+EyAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"819bc7d7571fbd47679053ea0d43e22b8576102de4c461c025380dd174e88f42","last_reissued_at":"2026-05-18T02:52:42.123953Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:42.123953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.3071","source_version":7,"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:52:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CHQ9QCSB9ub7jcDbVLW9Y0rVpWDlElvEAfq00Lx1ln1l3kE6ISKqOsYaOWE4bDKOqKQLmzYRnf6orPiMClsRAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T16:51:31.707301Z"},"content_sha256":"908738245d96ec7f9527ad8ef17eff43abebfadc877844fb091f535f9983a041","schema_version":"1.0","event_id":"sha256:908738245d96ec7f9527ad8ef17eff43abebfadc877844fb091f535f9983a041"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:QGN4PV2XD66UOZ4QKPVA2Q7CFO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimal Controllability Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Alex Olshevsky","submitted_at":"2013-04-10T19:54:55Z","abstract_excerpt":"Given a linear system, we consider the problem of finding a small set of variables to affect with an input so that the resulting system is controllable. We show that this problem is NP-hard; indeed, we show that even approximating the minimum number of variables that need to be affected within a multiplicative factor of $c \\log n$ is NP-hard for some positive $c$. On the positive side, we show it is possible to find sets of variables matching this inapproximability barrier in polynomial time. This can be done by a simple greedy heuristic which sequentially picks variables to maximize the rank "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.3071","kind":"arxiv","version":7},"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:52:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0AGUDAy9hLJAUTkSfsRp1pcu3bisou+ODPYdZCMQKrWWFhMCN+CR7i9NeqKi5DIGS1INHDFzSpt7ufH4PuNLCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T16:51:31.708497Z"},"content_sha256":"d31e2eeb057fc6c39760558aa1b61c433df620539cff0a3cb2580cf2f1766852","schema_version":"1.0","event_id":"sha256:d31e2eeb057fc6c39760558aa1b61c433df620539cff0a3cb2580cf2f1766852"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QGN4PV2XD66UOZ4QKPVA2Q7CFO/bundle.json","state_url":"https://pith.science/pith/QGN4PV2XD66UOZ4QKPVA2Q7CFO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QGN4PV2XD66UOZ4QKPVA2Q7CFO/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-08-10T16:51:31Z","links":{"resolver":"https://pith.science/pith/QGN4PV2XD66UOZ4QKPVA2Q7CFO","bundle":"https://pith.science/pith/QGN4PV2XD66UOZ4QKPVA2Q7CFO/bundle.json","state":"https://pith.science/pith/QGN4PV2XD66UOZ4QKPVA2Q7CFO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QGN4PV2XD66UOZ4QKPVA2Q7CFO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:QGN4PV2XD66UOZ4QKPVA2Q7CFO","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":"e70f248c4344012e280c3402b718d274dd30adf9a8a5bcec60618352a916256f","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-04-10T19:54:55Z","title_canon_sha256":"c785457639c6a7ed9f15a78d66aa9c36f8bc4615470327495959c7b9b99571c9"},"schema_version":"1.0","source":{"id":"1304.3071","kind":"arxiv","version":7}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.3071","created_at":"2026-05-18T02:52:42Z"},{"alias_kind":"arxiv_version","alias_value":"1304.3071v7","created_at":"2026-05-18T02:52:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.3071","created_at":"2026-05-18T02:52:42Z"},{"alias_kind":"pith_short_12","alias_value":"QGN4PV2XD66U","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QGN4PV2XD66UOZ4Q","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QGN4PV2X","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:d31e2eeb057fc6c39760558aa1b61c433df620539cff0a3cb2580cf2f1766852","target":"graph","created_at":"2026-05-18T02:52:42Z","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":"Given a linear system, we consider the problem of finding a small set of variables to affect with an input so that the resulting system is controllable. We show that this problem is NP-hard; indeed, we show that even approximating the minimum number of variables that need to be affected within a multiplicative factor of $c \\log n$ is NP-hard for some positive $c$. On the positive side, we show it is possible to find sets of variables matching this inapproximability barrier in polynomial time. This can be done by a simple greedy heuristic which sequentially picks variables to maximize the rank ","authors_text":"Alex Olshevsky","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-04-10T19:54:55Z","title":"Minimal Controllability Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.3071","kind":"arxiv","version":7},"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:908738245d96ec7f9527ad8ef17eff43abebfadc877844fb091f535f9983a041","target":"record","created_at":"2026-05-18T02:52:42Z","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":"e70f248c4344012e280c3402b718d274dd30adf9a8a5bcec60618352a916256f","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-04-10T19:54:55Z","title_canon_sha256":"c785457639c6a7ed9f15a78d66aa9c36f8bc4615470327495959c7b9b99571c9"},"schema_version":"1.0","source":{"id":"1304.3071","kind":"arxiv","version":7}},"canonical_sha256":"819bc7d7571fbd47679053ea0d43e22b8576102de4c461c025380dd174e88f42","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"819bc7d7571fbd47679053ea0d43e22b8576102de4c461c025380dd174e88f42","first_computed_at":"2026-05-18T02:52:42.123953Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:42.123953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xzyXojkahH1bTLBZxNEyeK1MRKWOA5Kp5Z1WT2/POsOjJ3Yo9Dzmdk88R2FNrYI8mKXWPpIS6lDmouky6+EyAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:42.124449Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.3071","source_kind":"arxiv","source_version":7}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:908738245d96ec7f9527ad8ef17eff43abebfadc877844fb091f535f9983a041","sha256:d31e2eeb057fc6c39760558aa1b61c433df620539cff0a3cb2580cf2f1766852"],"state_sha256":"56aa1d3b84f910a1b32c200058dcab583e008bb13c2ae8f2977314fb40b4898f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OXdsNpsRxceAvOXhLMLwus4qAHjBMAd6O+qJZSFy9Inq8Q1/xtK/6umavF4j+4FcrFMTcUesdTTHsa5Ie6eeBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T16:51:31.716352Z","bundle_sha256":"c92e4f8aa38503d76b4310609b8bf290b47bcc6f05dcbd5838ef95eb952d4d73"}}