{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:C22UX2WTCHR3A565NWYXYSWYU7","short_pith_number":"pith:C22UX2WT","schema_version":"1.0","canonical_sha256":"16b54bead311e3b077dd6db17c4ad8a7c67bc6f71f4f119bcca51ce5ab9e1028","source":{"kind":"arxiv","id":"1505.01034","version":2},"attestation_state":"computed","paper":{"title":"A probabilistic interpretation of set-membership filtering: application to polynomial systems through polytopic bounding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Alessio Benavoli, Dario Piga","submitted_at":"2015-05-05T15:13:28Z","abstract_excerpt":"Set-membership estimation is usually formulated in the context of set-valued calculus and no probabilistic calculations are necessary. In this paper, we show that set-membership estimation can be equivalently formulated in the probabilistic setting by employing sets of probability measures. Inference in set-membership estimation is thus carried out by computing expectations with respect to the updated set of probability measures P as in the probabilistic case. In particular, it is shown that inference can be performed by solving a particular semi-infinite linear programming problem, which is a"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1505.01034","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-05-05T15:13:28Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"234e8b8b19c48f7276ba17a7a665124793632a77d569ae3bca491ae57690a549","abstract_canon_sha256":"39ca8ad6d92aa72e8401c652d960f8d9ba953c0fd019843352ea664c1138ee9f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:20.511274Z","signature_b64":"XLDDlJsfTMeFyUGPD9GFaOG4ST6BmV6+1LrxxoCKfUOhMTcMppZ/ymN2o7+T76MXZoaiH1AB5UEgbx+dpBL6Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16b54bead311e3b077dd6db17c4ad8a7c67bc6f71f4f119bcca51ce5ab9e1028","last_reissued_at":"2026-05-18T01:17:20.510777Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:20.510777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A probabilistic interpretation of set-membership filtering: application to polynomial systems through polytopic bounding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Alessio Benavoli, Dario Piga","submitted_at":"2015-05-05T15:13:28Z","abstract_excerpt":"Set-membership estimation is usually formulated in the context of set-valued calculus and no probabilistic calculations are necessary. In this paper, we show that set-membership estimation can be equivalently formulated in the probabilistic setting by employing sets of probability measures. Inference in set-membership estimation is thus carried out by computing expectations with respect to the updated set of probability measures P as in the probabilistic case. In particular, it is shown that inference can be performed by solving a particular semi-infinite linear programming problem, which is a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.01034","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1505.01034","created_at":"2026-05-18T01:17:20.510849+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.01034v2","created_at":"2026-05-18T01:17:20.510849+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.01034","created_at":"2026-05-18T01:17:20.510849+00:00"},{"alias_kind":"pith_short_12","alias_value":"C22UX2WTCHR3","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"C22UX2WTCHR3A565","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"C22UX2WT","created_at":"2026-05-18T12:29:14.074870+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/C22UX2WTCHR3A565NWYXYSWYU7","json":"https://pith.science/pith/C22UX2WTCHR3A565NWYXYSWYU7.json","graph_json":"https://pith.science/api/pith-number/C22UX2WTCHR3A565NWYXYSWYU7/graph.json","events_json":"https://pith.science/api/pith-number/C22UX2WTCHR3A565NWYXYSWYU7/events.json","paper":"https://pith.science/paper/C22UX2WT"},"agent_actions":{"view_html":"https://pith.science/pith/C22UX2WTCHR3A565NWYXYSWYU7","download_json":"https://pith.science/pith/C22UX2WTCHR3A565NWYXYSWYU7.json","view_paper":"https://pith.science/paper/C22UX2WT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.01034&json=true","fetch_graph":"https://pith.science/api/pith-number/C22UX2WTCHR3A565NWYXYSWYU7/graph.json","fetch_events":"https://pith.science/api/pith-number/C22UX2WTCHR3A565NWYXYSWYU7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C22UX2WTCHR3A565NWYXYSWYU7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C22UX2WTCHR3A565NWYXYSWYU7/action/storage_attestation","attest_author":"https://pith.science/pith/C22UX2WTCHR3A565NWYXYSWYU7/action/author_attestation","sign_citation":"https://pith.science/pith/C22UX2WTCHR3A565NWYXYSWYU7/action/citation_signature","submit_replication":"https://pith.science/pith/C22UX2WTCHR3A565NWYXYSWYU7/action/replication_record"}},"created_at":"2026-05-18T01:17:20.510849+00:00","updated_at":"2026-05-18T01:17:20.510849+00:00"}