{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:VLFJ6O67KHMEUREMBORDNJSGZO","short_pith_number":"pith:VLFJ6O67","canonical_record":{"source":{"id":"1711.01920","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-06T14:54:52Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"a5441f89f8f5518d85884bc8a37410a654e6c3efff14f13d47abcb8c12a2b165","abstract_canon_sha256":"38e3eab742a3ee8fa64ca150cdf8b6e7cae7de213980b67a5f0d0fb11cc12198"},"schema_version":"1.0"},"canonical_sha256":"aaca9f3bdf51d84a448c0ba236a646cb9011d47bc400b7f2f79d18289400f6bc","source":{"kind":"arxiv","id":"1711.01920","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.01920","created_at":"2026-05-18T00:19:56Z"},{"alias_kind":"arxiv_version","alias_value":"1711.01920v2","created_at":"2026-05-18T00:19:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01920","created_at":"2026-05-18T00:19:56Z"},{"alias_kind":"pith_short_12","alias_value":"VLFJ6O67KHME","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VLFJ6O67KHMEUREM","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VLFJ6O67","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:VLFJ6O67KHMEUREMBORDNJSGZO","target":"record","payload":{"canonical_record":{"source":{"id":"1711.01920","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-06T14:54:52Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"a5441f89f8f5518d85884bc8a37410a654e6c3efff14f13d47abcb8c12a2b165","abstract_canon_sha256":"38e3eab742a3ee8fa64ca150cdf8b6e7cae7de213980b67a5f0d0fb11cc12198"},"schema_version":"1.0"},"canonical_sha256":"aaca9f3bdf51d84a448c0ba236a646cb9011d47bc400b7f2f79d18289400f6bc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:56.818592Z","signature_b64":"o8QDG2OJLCFZEGOvCzuzWubym1XC8ygda/s/MAXBJlTDHvTmUg2uoM7KVgNlMMh2V+SgNjwdBgoTHRS3ThgsAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aaca9f3bdf51d84a448c0ba236a646cb9011d47bc400b7f2f79d18289400f6bc","last_reissued_at":"2026-05-18T00:19:56.818016Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:56.818016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.01920","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:19:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OZWsRjl0fBdpHVx4PNLNzzvUPF0tjLtqUbZG38Px5znjU8usUWg/y112HqK2cPd8REs4SdaVxDZwYKaJDpMXDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T12:17:53.083533Z"},"content_sha256":"191b3ec581d5542c900a15a41c9b953cfd46a63299b246b018daf64aeb63821c","schema_version":"1.0","event_id":"sha256:191b3ec581d5542c900a15a41c9b953cfd46a63299b246b018daf64aeb63821c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:VLFJ6O67KHMEUREMBORDNJSGZO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Complexity and Approximability of Optimal Sensor Selection for Kalman Filtering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Lintao Ye, Sandip Roy, Shreyas Sundaram","submitted_at":"2017-11-06T14:54:52Z","abstract_excerpt":"Given a linear dynamical system, we consider the problem of selecting (at design-time) an optimal set of sensors (subject to certain budget constraints) to minimize the trace of the steady state error covariance matrix of the Kalman filter. Previous work has shown that this problem is NP-hard for certain classes of systems and sensor costs; in this paper, we show that the problem remains NP-hard even for the special case where the system is stable and all sensor costs are identical. Furthermore, we show the stronger result that there is no constant-factor (polynomial-time) approximation algori"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01920","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:19:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4wS4ByN3fJyOlwlDMwFUjlXHV0pEm8hUzoS5jTEdQ8dPOSNVsQTiic/dgUEgtiISSvF2uUXZVyCIKLAY9UmhDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T12:17:53.084253Z"},"content_sha256":"17894bf601f7b14fa51f85843e139453733be204f7b639fc4312dfe6ffe22f30","schema_version":"1.0","event_id":"sha256:17894bf601f7b14fa51f85843e139453733be204f7b639fc4312dfe6ffe22f30"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VLFJ6O67KHMEUREMBORDNJSGZO/bundle.json","state_url":"https://pith.science/pith/VLFJ6O67KHMEUREMBORDNJSGZO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VLFJ6O67KHMEUREMBORDNJSGZO/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-02T12:17:53Z","links":{"resolver":"https://pith.science/pith/VLFJ6O67KHMEUREMBORDNJSGZO","bundle":"https://pith.science/pith/VLFJ6O67KHMEUREMBORDNJSGZO/bundle.json","state":"https://pith.science/pith/VLFJ6O67KHMEUREMBORDNJSGZO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VLFJ6O67KHMEUREMBORDNJSGZO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:VLFJ6O67KHMEUREMBORDNJSGZO","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":"38e3eab742a3ee8fa64ca150cdf8b6e7cae7de213980b67a5f0d0fb11cc12198","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-06T14:54:52Z","title_canon_sha256":"a5441f89f8f5518d85884bc8a37410a654e6c3efff14f13d47abcb8c12a2b165"},"schema_version":"1.0","source":{"id":"1711.01920","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.01920","created_at":"2026-05-18T00:19:56Z"},{"alias_kind":"arxiv_version","alias_value":"1711.01920v2","created_at":"2026-05-18T00:19:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01920","created_at":"2026-05-18T00:19:56Z"},{"alias_kind":"pith_short_12","alias_value":"VLFJ6O67KHME","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VLFJ6O67KHMEUREM","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VLFJ6O67","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:17894bf601f7b14fa51f85843e139453733be204f7b639fc4312dfe6ffe22f30","target":"graph","created_at":"2026-05-18T00:19:56Z","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 dynamical system, we consider the problem of selecting (at design-time) an optimal set of sensors (subject to certain budget constraints) to minimize the trace of the steady state error covariance matrix of the Kalman filter. Previous work has shown that this problem is NP-hard for certain classes of systems and sensor costs; in this paper, we show that the problem remains NP-hard even for the special case where the system is stable and all sensor costs are identical. Furthermore, we show the stronger result that there is no constant-factor (polynomial-time) approximation algori","authors_text":"Lintao Ye, Sandip Roy, Shreyas Sundaram","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-06T14:54:52Z","title":"On the Complexity and Approximability of Optimal Sensor Selection for Kalman Filtering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01920","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:191b3ec581d5542c900a15a41c9b953cfd46a63299b246b018daf64aeb63821c","target":"record","created_at":"2026-05-18T00:19:56Z","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":"38e3eab742a3ee8fa64ca150cdf8b6e7cae7de213980b67a5f0d0fb11cc12198","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-06T14:54:52Z","title_canon_sha256":"a5441f89f8f5518d85884bc8a37410a654e6c3efff14f13d47abcb8c12a2b165"},"schema_version":"1.0","source":{"id":"1711.01920","kind":"arxiv","version":2}},"canonical_sha256":"aaca9f3bdf51d84a448c0ba236a646cb9011d47bc400b7f2f79d18289400f6bc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aaca9f3bdf51d84a448c0ba236a646cb9011d47bc400b7f2f79d18289400f6bc","first_computed_at":"2026-05-18T00:19:56.818016Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:56.818016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"o8QDG2OJLCFZEGOvCzuzWubym1XC8ygda/s/MAXBJlTDHvTmUg2uoM7KVgNlMMh2V+SgNjwdBgoTHRS3ThgsAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:56.818592Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.01920","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:191b3ec581d5542c900a15a41c9b953cfd46a63299b246b018daf64aeb63821c","sha256:17894bf601f7b14fa51f85843e139453733be204f7b639fc4312dfe6ffe22f30"],"state_sha256":"3a26df7a8e6af30cc03d405c5be98d408968c64aef07340a4545f3d7f0d6867c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2qCzQxlybbNwvThDnNSlc8M9Dl7iJIYxRZvXxn+uuZZ1lBFfMWMF/d836/6N3tvS7hMi9o83/0iq8RbgCdNrAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T12:17:53.086921Z","bundle_sha256":"e239844e4200cdefebdf573b90931a9fb8644077f874ff920a26641175b683a1"}}