{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:2PREQXUHMK46XRLZYT2ZDM3NYG","short_pith_number":"pith:2PREQXUH","canonical_record":{"source":{"id":"1704.04608","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-15T08:44:07Z","cross_cats_sorted":[],"title_canon_sha256":"b03af530d837e956b97bd5a78b1dbc264c327c688253d7b0b8218ef65dcfbe86","abstract_canon_sha256":"cd2710424f9e221c2366766a427a96736b9af01ca995f26f2c5a2e44aef0fa4d"},"schema_version":"1.0"},"canonical_sha256":"d3e2485e8762b9ebc579c4f591b36dc1953b1ef0c250bd2bb45d310e24277a59","source":{"kind":"arxiv","id":"1704.04608","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.04608","created_at":"2026-05-18T00:45:06Z"},{"alias_kind":"arxiv_version","alias_value":"1704.04608v2","created_at":"2026-05-18T00:45:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04608","created_at":"2026-05-18T00:45:06Z"},{"alias_kind":"pith_short_12","alias_value":"2PREQXUHMK46","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2PREQXUHMK46XRLZ","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2PREQXUH","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:2PREQXUHMK46XRLZYT2ZDM3NYG","target":"record","payload":{"canonical_record":{"source":{"id":"1704.04608","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-15T08:44:07Z","cross_cats_sorted":[],"title_canon_sha256":"b03af530d837e956b97bd5a78b1dbc264c327c688253d7b0b8218ef65dcfbe86","abstract_canon_sha256":"cd2710424f9e221c2366766a427a96736b9af01ca995f26f2c5a2e44aef0fa4d"},"schema_version":"1.0"},"canonical_sha256":"d3e2485e8762b9ebc579c4f591b36dc1953b1ef0c250bd2bb45d310e24277a59","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:06.001746Z","signature_b64":"4bTqKpfn3vQuXAUs3wWZ2vfVWQhH8TwphrOpZsp1RfHf1xt0JO1mYYTILbiixAguj0MS1n4qooqWk9ZAJVEFCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3e2485e8762b9ebc579c4f591b36dc1953b1ef0c250bd2bb45d310e24277a59","last_reissued_at":"2026-05-18T00:45:06.001384Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:06.001384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.04608","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-18T00:45:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"amQGDixlgOFl4+5QTyDetAAzZsWRyezppHyg0oAJdaVXS6xQwmzFA0KFHgGyRn8VeLhBEhj2T0ZQBbV4DBQkCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T03:00:07.740821Z"},"content_sha256":"e16c7a4442986a1ccf267683a3b2fa67cfd1e35a5f35bdab3d155d4d1576447b","schema_version":"1.0","event_id":"sha256:e16c7a4442986a1ccf267683a3b2fa67cfd1e35a5f35bdab3d155d4d1576447b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:2PREQXUHMK46XRLZYT2ZDM3NYG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximating Constrained Minimum Input Selection for State Space Structural Controllability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Madhu N. Belur, Prasanna Chaporkar, Shana Moothedath","submitted_at":"2017-04-15T08:44:07Z","abstract_excerpt":"This paper looks at two problems, minimum constrained input selection and minimum cost constrained input selection for state space structured systems. The input matrix is constrained in the sense that the set of states that each input can influence is pre-specified and each input has a cost associated with it. Our goal is to optimally select an input set from the set of inputs given that the system is controllable. These problems are known to be NP-hard. Firstly, we give a new necessary and sufficient graph theoretic condition for checking structural controllability using flow networks. Using "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.04608","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-18T00:45:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uw2/WP5of5D5AZUuEuJ2Zc/vFkp/qNkG2Y6BPvozmk0gq4HEPUNXzViI2zEPJwDhzSJgN0Ad3hddozNJnvcICg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T03:00:07.741182Z"},"content_sha256":"ec365f0748708f1da88f0abd857228eec092d619533f96ffc033b7b7005d11e9","schema_version":"1.0","event_id":"sha256:ec365f0748708f1da88f0abd857228eec092d619533f96ffc033b7b7005d11e9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2PREQXUHMK46XRLZYT2ZDM3NYG/bundle.json","state_url":"https://pith.science/pith/2PREQXUHMK46XRLZYT2ZDM3NYG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2PREQXUHMK46XRLZYT2ZDM3NYG/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-04T03:00:07Z","links":{"resolver":"https://pith.science/pith/2PREQXUHMK46XRLZYT2ZDM3NYG","bundle":"https://pith.science/pith/2PREQXUHMK46XRLZYT2ZDM3NYG/bundle.json","state":"https://pith.science/pith/2PREQXUHMK46XRLZYT2ZDM3NYG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2PREQXUHMK46XRLZYT2ZDM3NYG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:2PREQXUHMK46XRLZYT2ZDM3NYG","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":"cd2710424f9e221c2366766a427a96736b9af01ca995f26f2c5a2e44aef0fa4d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-15T08:44:07Z","title_canon_sha256":"b03af530d837e956b97bd5a78b1dbc264c327c688253d7b0b8218ef65dcfbe86"},"schema_version":"1.0","source":{"id":"1704.04608","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.04608","created_at":"2026-05-18T00:45:06Z"},{"alias_kind":"arxiv_version","alias_value":"1704.04608v2","created_at":"2026-05-18T00:45:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04608","created_at":"2026-05-18T00:45:06Z"},{"alias_kind":"pith_short_12","alias_value":"2PREQXUHMK46","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2PREQXUHMK46XRLZ","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2PREQXUH","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:ec365f0748708f1da88f0abd857228eec092d619533f96ffc033b7b7005d11e9","target":"graph","created_at":"2026-05-18T00:45:06Z","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":"This paper looks at two problems, minimum constrained input selection and minimum cost constrained input selection for state space structured systems. The input matrix is constrained in the sense that the set of states that each input can influence is pre-specified and each input has a cost associated with it. Our goal is to optimally select an input set from the set of inputs given that the system is controllable. These problems are known to be NP-hard. Firstly, we give a new necessary and sufficient graph theoretic condition for checking structural controllability using flow networks. Using ","authors_text":"Madhu N. Belur, Prasanna Chaporkar, Shana Moothedath","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-15T08:44:07Z","title":"Approximating Constrained Minimum Input Selection for State Space Structural Controllability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.04608","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:e16c7a4442986a1ccf267683a3b2fa67cfd1e35a5f35bdab3d155d4d1576447b","target":"record","created_at":"2026-05-18T00:45:06Z","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":"cd2710424f9e221c2366766a427a96736b9af01ca995f26f2c5a2e44aef0fa4d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-15T08:44:07Z","title_canon_sha256":"b03af530d837e956b97bd5a78b1dbc264c327c688253d7b0b8218ef65dcfbe86"},"schema_version":"1.0","source":{"id":"1704.04608","kind":"arxiv","version":2}},"canonical_sha256":"d3e2485e8762b9ebc579c4f591b36dc1953b1ef0c250bd2bb45d310e24277a59","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d3e2485e8762b9ebc579c4f591b36dc1953b1ef0c250bd2bb45d310e24277a59","first_computed_at":"2026-05-18T00:45:06.001384Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:06.001384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4bTqKpfn3vQuXAUs3wWZ2vfVWQhH8TwphrOpZsp1RfHf1xt0JO1mYYTILbiixAguj0MS1n4qooqWk9ZAJVEFCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:06.001746Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.04608","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e16c7a4442986a1ccf267683a3b2fa67cfd1e35a5f35bdab3d155d4d1576447b","sha256:ec365f0748708f1da88f0abd857228eec092d619533f96ffc033b7b7005d11e9"],"state_sha256":"f995278091871ff380a42fe85d64853e9416c3b1a5f92dbde163bea089c1ac4c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QT/7mATXgrnPdEOjmlKJzcIeGRM9uUBKKLIiR105kxh4cYO7D6L0tA4GItx9F9zVu2atVaZaLXDB65NR0ov7Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T03:00:07.743242Z","bundle_sha256":"7c8b3d1eced33235de9275454e2be97412266eaf7cc5f371b7068ef08f9c0bba"}}