{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:RV6KOKHYQNPFC3KQAYWJSP7OW3","short_pith_number":"pith:RV6KOKHY","canonical_record":{"source":{"id":"1810.07220","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-16T18:28:40Z","cross_cats_sorted":[],"title_canon_sha256":"d505e820d80ef53eedf15580bd1a2146347282f6f5a4032533802aeb71d84de6","abstract_canon_sha256":"b4fe0ba8a2a4fabea38e4c82bfcb51b220eedc60b9c9a87d8bbfe96f5cdf0e5a"},"schema_version":"1.0"},"canonical_sha256":"8d7ca728f8835e516d50062c993feeb6c15b3947cc3b0aaaced3356ae6dd140b","source":{"kind":"arxiv","id":"1810.07220","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.07220","created_at":"2026-05-17T23:55:03Z"},{"alias_kind":"arxiv_version","alias_value":"1810.07220v2","created_at":"2026-05-17T23:55:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.07220","created_at":"2026-05-17T23:55:03Z"},{"alias_kind":"pith_short_12","alias_value":"RV6KOKHYQNPF","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RV6KOKHYQNPFC3KQ","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RV6KOKHY","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:RV6KOKHYQNPFC3KQAYWJSP7OW3","target":"record","payload":{"canonical_record":{"source":{"id":"1810.07220","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-16T18:28:40Z","cross_cats_sorted":[],"title_canon_sha256":"d505e820d80ef53eedf15580bd1a2146347282f6f5a4032533802aeb71d84de6","abstract_canon_sha256":"b4fe0ba8a2a4fabea38e4c82bfcb51b220eedc60b9c9a87d8bbfe96f5cdf0e5a"},"schema_version":"1.0"},"canonical_sha256":"8d7ca728f8835e516d50062c993feeb6c15b3947cc3b0aaaced3356ae6dd140b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:03.206528Z","signature_b64":"P7GCt/by2lo09o1zVRhbQSI8G/TOJ/D1x9Yxqu34XmGEB16Z/248f0Bf3V6OQOFW69j2QrjumZK/YWD/6kOFCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d7ca728f8835e516d50062c993feeb6c15b3947cc3b0aaaced3356ae6dd140b","last_reissued_at":"2026-05-17T23:55:03.206063Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:03.206063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.07220","source_version":2,"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-17T23:55:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2+s70tiFZZl980aBxoIiyYq3IhASxiIsKkhq/2xxMsew0jNFhAOZqIJEKxHvASfrk1h10eU2U9RRQRiU93oODQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:10:29.264890Z"},"content_sha256":"ce099899b4bc3c557251bc308cf1bd9f0cc380c7fc7899b17f90042a231e9fa3","schema_version":"1.0","event_id":"sha256:ce099899b4bc3c557251bc308cf1bd9f0cc380c7fc7899b17f90042a231e9fa3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:RV6KOKHYQNPFC3KQAYWJSP7OW3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimizing Inputs for Strong Structural Controllability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Kumar Yashashwi, Prasanna Chaporkar, Shana Moothedath","submitted_at":"2018-10-16T18:28:40Z","abstract_excerpt":"The notion of strong structural controllability (s-controllability) allows for determining controllability properties of large linear time-invariant systems even when numerical values of the system parameters are not known a priori. The s-controllability guarantees controllability for all numerical realizations of the system parameters. We address the optimization problem of minimal cardinality input selection for s-controllability. Previous work shows that not only the optimization problem is NP-hard, but finding an approximate solution is also hard. We propose a randomized algorithm using th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.07220","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"},"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-17T23:55:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TZ9hd3yEG5r87iyWmwzVW8/pG3QjPs2IZwtbsv4fXDgyrb3i+Qv7bn0NxJ8AVg+q8MLZuh8GSo3qLOxqx0asDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:10:29.265233Z"},"content_sha256":"0462facf6ef143039b457e692c57b70dc49741b812e0171f3817d1254610dcf4","schema_version":"1.0","event_id":"sha256:0462facf6ef143039b457e692c57b70dc49741b812e0171f3817d1254610dcf4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RV6KOKHYQNPFC3KQAYWJSP7OW3/bundle.json","state_url":"https://pith.science/pith/RV6KOKHYQNPFC3KQAYWJSP7OW3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RV6KOKHYQNPFC3KQAYWJSP7OW3/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-03T20:10:29Z","links":{"resolver":"https://pith.science/pith/RV6KOKHYQNPFC3KQAYWJSP7OW3","bundle":"https://pith.science/pith/RV6KOKHYQNPFC3KQAYWJSP7OW3/bundle.json","state":"https://pith.science/pith/RV6KOKHYQNPFC3KQAYWJSP7OW3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RV6KOKHYQNPFC3KQAYWJSP7OW3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RV6KOKHYQNPFC3KQAYWJSP7OW3","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":"b4fe0ba8a2a4fabea38e4c82bfcb51b220eedc60b9c9a87d8bbfe96f5cdf0e5a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-16T18:28:40Z","title_canon_sha256":"d505e820d80ef53eedf15580bd1a2146347282f6f5a4032533802aeb71d84de6"},"schema_version":"1.0","source":{"id":"1810.07220","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.07220","created_at":"2026-05-17T23:55:03Z"},{"alias_kind":"arxiv_version","alias_value":"1810.07220v2","created_at":"2026-05-17T23:55:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.07220","created_at":"2026-05-17T23:55:03Z"},{"alias_kind":"pith_short_12","alias_value":"RV6KOKHYQNPF","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RV6KOKHYQNPFC3KQ","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RV6KOKHY","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:0462facf6ef143039b457e692c57b70dc49741b812e0171f3817d1254610dcf4","target":"graph","created_at":"2026-05-17T23:55:03Z","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":"The notion of strong structural controllability (s-controllability) allows for determining controllability properties of large linear time-invariant systems even when numerical values of the system parameters are not known a priori. The s-controllability guarantees controllability for all numerical realizations of the system parameters. We address the optimization problem of minimal cardinality input selection for s-controllability. Previous work shows that not only the optimization problem is NP-hard, but finding an approximate solution is also hard. We propose a randomized algorithm using th","authors_text":"Kumar Yashashwi, Prasanna Chaporkar, Shana Moothedath","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-16T18:28:40Z","title":"Minimizing Inputs for Strong Structural Controllability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.07220","kind":"arxiv","version":2},"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:ce099899b4bc3c557251bc308cf1bd9f0cc380c7fc7899b17f90042a231e9fa3","target":"record","created_at":"2026-05-17T23:55:03Z","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":"b4fe0ba8a2a4fabea38e4c82bfcb51b220eedc60b9c9a87d8bbfe96f5cdf0e5a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-16T18:28:40Z","title_canon_sha256":"d505e820d80ef53eedf15580bd1a2146347282f6f5a4032533802aeb71d84de6"},"schema_version":"1.0","source":{"id":"1810.07220","kind":"arxiv","version":2}},"canonical_sha256":"8d7ca728f8835e516d50062c993feeb6c15b3947cc3b0aaaced3356ae6dd140b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8d7ca728f8835e516d50062c993feeb6c15b3947cc3b0aaaced3356ae6dd140b","first_computed_at":"2026-05-17T23:55:03.206063Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:03.206063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P7GCt/by2lo09o1zVRhbQSI8G/TOJ/D1x9Yxqu34XmGEB16Z/248f0Bf3V6OQOFW69j2QrjumZK/YWD/6kOFCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:03.206528Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.07220","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ce099899b4bc3c557251bc308cf1bd9f0cc380c7fc7899b17f90042a231e9fa3","sha256:0462facf6ef143039b457e692c57b70dc49741b812e0171f3817d1254610dcf4"],"state_sha256":"e4b067212c008d369ce54313580eb5f5b6cda06cec8fe29d019be99097cb069d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"acT1OEMxQ0eH1qNfYbx7yvjUiBwxpLMuk9bDUqx5+nUl3hoZDDFnU9Rw+Yao4iQiNE9JRm11zi5VBslfeANCBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T20:10:29.267162Z","bundle_sha256":"931ea9c03f707b61ac0e940e5d9caf213c555e4f5c792a3e5d53b2ce719bc6c5"}}