{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ED2RI44LDHJA6US4HWJCXVSNMB","short_pith_number":"pith:ED2RI44L","schema_version":"1.0","canonical_sha256":"20f514738b19d20f525c3d922bd64d606cc4930cd2f5ec274cf0e0460e8c86f3","source":{"kind":"arxiv","id":"1403.5151","version":1},"attestation_state":"computed","paper":{"title":"Performance vs complexity trade-offs for Markovian networked jump estimators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Daniel Dolz, Daniel E. Quevedo, Ignacio Pe\\~narrocha, Roberto Sanchis","submitted_at":"2014-03-20T14:40:10Z","abstract_excerpt":"This paper addresses the design of a state observer for networked systems with random delays and dropouts. The model of plant and network covers the cases of multiple sensors, out-of-sequence and buffered measurements. The measurement outcomes over a finite interval model the network measurement reception scenarios, which follow a Markov distribution. We present a tractable optimization problem to precalculate off-line a finite set of gains of jump observers. The proposed procedure allows us to trade the complexity of the observer implementation for achieved performance. Several examples illus"},"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":"1403.5151","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-03-20T14:40:10Z","cross_cats_sorted":[],"title_canon_sha256":"8bb963c6239e5df933a60c99021f574b7a34315090c4ce93f0b984d1fc73b187","abstract_canon_sha256":"b9183de9180b457deee47f1b119d7c2482d7732783d46f08bad3bec46cbf0aaa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:58.127218Z","signature_b64":"ZLheIeqHyiaN4bar1hhHyqcHS3XE0G4DrvF9ZVbMjC/lV9U9/EK9hy5pZNtN1ekKaFQsk4LsuNvCrh28Ic2xAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20f514738b19d20f525c3d922bd64d606cc4930cd2f5ec274cf0e0460e8c86f3","last_reissued_at":"2026-05-18T02:55:58.126763Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:58.126763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Performance vs complexity trade-offs for Markovian networked jump estimators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Daniel Dolz, Daniel E. Quevedo, Ignacio Pe\\~narrocha, Roberto Sanchis","submitted_at":"2014-03-20T14:40:10Z","abstract_excerpt":"This paper addresses the design of a state observer for networked systems with random delays and dropouts. The model of plant and network covers the cases of multiple sensors, out-of-sequence and buffered measurements. The measurement outcomes over a finite interval model the network measurement reception scenarios, which follow a Markov distribution. We present a tractable optimization problem to precalculate off-line a finite set of gains of jump observers. The proposed procedure allows us to trade the complexity of the observer implementation for achieved performance. Several examples illus"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.5151","kind":"arxiv","version":1},"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":"1403.5151","created_at":"2026-05-18T02:55:58.126830+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.5151v1","created_at":"2026-05-18T02:55:58.126830+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.5151","created_at":"2026-05-18T02:55:58.126830+00:00"},{"alias_kind":"pith_short_12","alias_value":"ED2RI44LDHJA","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"ED2RI44LDHJA6US4","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"ED2RI44L","created_at":"2026-05-18T12:28:25.294606+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/ED2RI44LDHJA6US4HWJCXVSNMB","json":"https://pith.science/pith/ED2RI44LDHJA6US4HWJCXVSNMB.json","graph_json":"https://pith.science/api/pith-number/ED2RI44LDHJA6US4HWJCXVSNMB/graph.json","events_json":"https://pith.science/api/pith-number/ED2RI44LDHJA6US4HWJCXVSNMB/events.json","paper":"https://pith.science/paper/ED2RI44L"},"agent_actions":{"view_html":"https://pith.science/pith/ED2RI44LDHJA6US4HWJCXVSNMB","download_json":"https://pith.science/pith/ED2RI44LDHJA6US4HWJCXVSNMB.json","view_paper":"https://pith.science/paper/ED2RI44L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.5151&json=true","fetch_graph":"https://pith.science/api/pith-number/ED2RI44LDHJA6US4HWJCXVSNMB/graph.json","fetch_events":"https://pith.science/api/pith-number/ED2RI44LDHJA6US4HWJCXVSNMB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ED2RI44LDHJA6US4HWJCXVSNMB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ED2RI44LDHJA6US4HWJCXVSNMB/action/storage_attestation","attest_author":"https://pith.science/pith/ED2RI44LDHJA6US4HWJCXVSNMB/action/author_attestation","sign_citation":"https://pith.science/pith/ED2RI44LDHJA6US4HWJCXVSNMB/action/citation_signature","submit_replication":"https://pith.science/pith/ED2RI44LDHJA6US4HWJCXVSNMB/action/replication_record"}},"created_at":"2026-05-18T02:55:58.126830+00:00","updated_at":"2026-05-18T02:55:58.126830+00:00"}