{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4XMRXSS2BHI6KISPW6DHIO5PVT","short_pith_number":"pith:4XMRXSS2","schema_version":"1.0","canonical_sha256":"e5d91bca5a09d1e5224fb786743baface7c077f9647f2de7e608170bde3a4d46","source":{"kind":"arxiv","id":"1810.11831","version":1},"attestation_state":"computed","paper":{"title":"Latency-Reliability Tradeoffs for State Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.SY","math.IT"],"primary_cat":"math.OC","authors_text":"George J. Pappas, Hamed Hassani, Konstantinos Gatsis","submitted_at":"2018-10-28T16:35:52Z","abstract_excerpt":"The emerging interest in low-latency high-reliability applications, such as connected vehicles, necessitates a new abstraction between communication and control. Thanks to advances in cyber-physical systems over the past decades, we understand this interface for classical bit-rate models of channels as well as packet-loss-type channels. This work proposes a new abstraction characterized as a tradeoff curve between latency, reliability and rate. Our aim is to understand: Do we (control engineers) prefer faster but less reliable communications (with shorter codes), or slower but more reliable co"},"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":"1810.11831","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-28T16:35:52Z","cross_cats_sorted":["cs.IT","cs.SY","math.IT"],"title_canon_sha256":"efbce0ce5bbb2bf11817e19204b06b3d2f2283a6fc7183794da8a0eae82d9e8d","abstract_canon_sha256":"e6febfed81de6cd3c09058ff80b21b9b98bf5d1bc9d788791e7fe5590281b49b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:03.019450Z","signature_b64":"L2GrmbMrAx4SIoOSMQwp6gSwnsMnBKtemHMShDIgk3KHgbR2KbNadsWRPEL6Dd/Sjj/oD65rE9VQ9TzN9zheDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5d91bca5a09d1e5224fb786743baface7c077f9647f2de7e608170bde3a4d46","last_reissued_at":"2026-05-18T00:02:03.018808Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:03.018808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Latency-Reliability Tradeoffs for State Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.SY","math.IT"],"primary_cat":"math.OC","authors_text":"George J. Pappas, Hamed Hassani, Konstantinos Gatsis","submitted_at":"2018-10-28T16:35:52Z","abstract_excerpt":"The emerging interest in low-latency high-reliability applications, such as connected vehicles, necessitates a new abstraction between communication and control. Thanks to advances in cyber-physical systems over the past decades, we understand this interface for classical bit-rate models of channels as well as packet-loss-type channels. This work proposes a new abstraction characterized as a tradeoff curve between latency, reliability and rate. Our aim is to understand: Do we (control engineers) prefer faster but less reliable communications (with shorter codes), or slower but more reliable co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.11831","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":"1810.11831","created_at":"2026-05-18T00:02:03.018903+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.11831v1","created_at":"2026-05-18T00:02:03.018903+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.11831","created_at":"2026-05-18T00:02:03.018903+00:00"},{"alias_kind":"pith_short_12","alias_value":"4XMRXSS2BHI6","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4XMRXSS2BHI6KISP","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4XMRXSS2","created_at":"2026-05-18T12:32:05.422762+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/4XMRXSS2BHI6KISPW6DHIO5PVT","json":"https://pith.science/pith/4XMRXSS2BHI6KISPW6DHIO5PVT.json","graph_json":"https://pith.science/api/pith-number/4XMRXSS2BHI6KISPW6DHIO5PVT/graph.json","events_json":"https://pith.science/api/pith-number/4XMRXSS2BHI6KISPW6DHIO5PVT/events.json","paper":"https://pith.science/paper/4XMRXSS2"},"agent_actions":{"view_html":"https://pith.science/pith/4XMRXSS2BHI6KISPW6DHIO5PVT","download_json":"https://pith.science/pith/4XMRXSS2BHI6KISPW6DHIO5PVT.json","view_paper":"https://pith.science/paper/4XMRXSS2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.11831&json=true","fetch_graph":"https://pith.science/api/pith-number/4XMRXSS2BHI6KISPW6DHIO5PVT/graph.json","fetch_events":"https://pith.science/api/pith-number/4XMRXSS2BHI6KISPW6DHIO5PVT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4XMRXSS2BHI6KISPW6DHIO5PVT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4XMRXSS2BHI6KISPW6DHIO5PVT/action/storage_attestation","attest_author":"https://pith.science/pith/4XMRXSS2BHI6KISPW6DHIO5PVT/action/author_attestation","sign_citation":"https://pith.science/pith/4XMRXSS2BHI6KISPW6DHIO5PVT/action/citation_signature","submit_replication":"https://pith.science/pith/4XMRXSS2BHI6KISPW6DHIO5PVT/action/replication_record"}},"created_at":"2026-05-18T00:02:03.018903+00:00","updated_at":"2026-05-18T00:02:03.018903+00:00"}