{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:3Z7FE5CVBBVFVYROPCXAPIKVNS","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":"a34514d107a6bbb585ab33d59b408478f427911cce034c27a18881734a6a1ca8","cross_cats_sorted":["cs.SY"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"eess.SY","submitted_at":"2026-05-16T04:03:53Z","title_canon_sha256":"c2105d25a9299122bb4166b8278e96d0664e1abd94b8272e75cb0e95e1e6955a"},"schema_version":"1.0","source":{"id":"2605.16801","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16801","created_at":"2026-05-20T00:03:22Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16801v1","created_at":"2026-05-20T00:03:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16801","created_at":"2026-05-20T00:03:22Z"},{"alias_kind":"pith_short_12","alias_value":"3Z7FE5CVBBVF","created_at":"2026-05-20T00:03:22Z"},{"alias_kind":"pith_short_16","alias_value":"3Z7FE5CVBBVFVYRO","created_at":"2026-05-20T00:03:22Z"},{"alias_kind":"pith_short_8","alias_value":"3Z7FE5CV","created_at":"2026-05-20T00:03:22Z"}],"graph_snapshots":[{"event_id":"sha256:80b49b185ffdff96b52043df395ee261c97d8c460d15cbb251e909ec4251225c","target":"graph","created_at":"2026-05-20T00:03:22Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"The deficiency-weighted greedy algorithm provides an approximate yet efficient solution to the multidimensional minimum knapsack problem that selects sensors while satisfying the chance-constrained error bounds derived from the EKF covariance."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The EKF covariance matrix accurately represents the true probabilistic error bounds under the chosen sensor subset, and the chance constraints remain valid when the selected sensors change at each time step."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A deficiency-weighted greedy algorithm solves a multidimensional minimum knapsack problem to select external sensors online while satisfying EKF-derived chance constraints on state estimation error."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A deficiency-weighted greedy algorithm solves the knapsack problem to pick a low-cost sensor subset that keeps Extended Kalman Filter estimation errors inside chance constraints in real time."}],"snapshot_sha256":"6eee34dc22b487d61a282ee5e63ebfb3d6f17363ebf47cbac985d6eb41ceb46c"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T21:31:19.293009Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T21:21:18.534341Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T19:01:56.287165Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.423651Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.16801/integrity.json","findings":[],"snapshot_sha256":"afe1be008111f39dc9e808dc58a3958548d0255675c41563ef99e14c9d4fae35","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"As connected and autonomous driving technologies advance, vehicles increasingly rely on data from external sensors. Although this information can enhance state estimation, processing all available streams imposes significant communication and computational costs. To address this challenge, we introduce a Sensor Management Center (SMC) that selects a low-cost subset of external sensors in real time while satisfying chance-constrained error bounds derived from an Extended Kalman Filter (EKF) covariance. We formulate the selection problem as a multidimensional minimum knapsack problem and adopt a","authors_text":"Alessandro Colombo, Heejin Ahn, Jehyeop Han, Marcello Farina, Minhee Kang","cross_cats":["cs.SY"],"headline":"A deficiency-weighted greedy algorithm solves the knapsack problem to pick a low-cost sensor subset that keeps Extended Kalman Filter estimation errors inside chance constraints in real time.","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"eess.SY","submitted_at":"2026-05-16T04:03:53Z","title":"Knapsack-based Online Sensor Selection for Vehicle State Estimation"},"references":{"count":16,"internal_anchors":0,"resolved_work":16,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Vitus and Wei Zhang and Alessandro Abate and Jianghai Hu and Claire J","work_id":"2e122938-af21-4d97-9a52-f95165f94c6d","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Sensor scheduling for linear systems: A covariance tracking approach , author=. Automatica , year=","work_id":"ae75a85d-6e04-4a0a-b322-471e25b472d3","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"2019 American Control Conference (ACC) , year=","work_id":"445fd5ec-8f65-4a7b-9c81-50e27176396b","year":2019},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Anderson, Brian DO and Moore, John B , title=","work_id":"642466f3-9101-492e-a202-3f4cd29171d8","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Bar-Shalom, Yaakov and Li, X Rong and Kirubarajan, Thiagalingam , title=","work_id":"6f1938ea-19b3-4dfa-883e-4c78982a6257","year":null}],"snapshot_sha256":"b1f43caf77c2f85258fa3e99fddf118ac81ceb2674d598b66bd4c255ede94a87"},"source":{"id":"2605.16801","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T21:12:16.207216Z","id":"71ea3b6d-66ba-40b5-abfc-06e4115720c7","model_set":{"reader":"grok-4.3"},"one_line_summary":"A deficiency-weighted greedy algorithm solves a multidimensional minimum knapsack problem to select external sensors online while satisfying EKF-derived chance constraints on state estimation error.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A deficiency-weighted greedy algorithm solves the knapsack problem to pick a low-cost sensor subset that keeps Extended Kalman Filter estimation errors inside chance constraints in real time.","strongest_claim":"The deficiency-weighted greedy algorithm provides an approximate yet efficient solution to the multidimensional minimum knapsack problem that selects sensors while satisfying the chance-constrained error bounds derived from the EKF covariance.","weakest_assumption":"The EKF covariance matrix accurately represents the true probabilistic error bounds under the chosen sensor subset, and the chance constraints remain valid when the selected sensors change at each time step."}},"verdict_id":"71ea3b6d-66ba-40b5-abfc-06e4115720c7"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6759b06ad5ec0d39a0e6a6f6c6591c0ad24c391d955ed7ca5d7c82f0c5b7bd98","target":"record","created_at":"2026-05-20T00:03:22Z","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":"a34514d107a6bbb585ab33d59b408478f427911cce034c27a18881734a6a1ca8","cross_cats_sorted":["cs.SY"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"eess.SY","submitted_at":"2026-05-16T04:03:53Z","title_canon_sha256":"c2105d25a9299122bb4166b8278e96d0664e1abd94b8272e75cb0e95e1e6955a"},"schema_version":"1.0","source":{"id":"2605.16801","kind":"arxiv","version":1}},"canonical_sha256":"de7e527455086a5ae22e78ae07a1556c999f9489a1e2fe67598a0a7de9b2e796","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de7e527455086a5ae22e78ae07a1556c999f9489a1e2fe67598a0a7de9b2e796","first_computed_at":"2026-05-20T00:03:22.954439Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:03:22.954439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l8XlnWPkwDnr3ieZF3xpKSqTNRxHHvKr1H2E9Rxqa6XHgrmOIiOBLnfh12uo/DyR+hnuLJx2pMO74DN3Nu+vAQ==","signature_status":"signed_v1","signed_at":"2026-05-20T00:03:22.955339Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.16801","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6759b06ad5ec0d39a0e6a6f6c6591c0ad24c391d955ed7ca5d7c82f0c5b7bd98","sha256:80b49b185ffdff96b52043df395ee261c97d8c460d15cbb251e909ec4251225c"],"state_sha256":"a542b54451b4b3b4db0baf4ae83f384f41a9ef8a5b80a365a5500fa0a546842e"}