{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:4XMRXSS2BHI6KISPW6DHIO5PVT","short_pith_number":"pith:4XMRXSS2","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"},"canonical_sha256":"e5d91bca5a09d1e5224fb786743baface7c077f9647f2de7e608170bde3a4d46","source":{"kind":"arxiv","id":"1810.11831","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.11831","created_at":"2026-05-18T00:02:03Z"},{"alias_kind":"arxiv_version","alias_value":"1810.11831v1","created_at":"2026-05-18T00:02:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.11831","created_at":"2026-05-18T00:02:03Z"},{"alias_kind":"pith_short_12","alias_value":"4XMRXSS2BHI6","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4XMRXSS2BHI6KISP","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4XMRXSS2","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:4XMRXSS2BHI6KISPW6DHIO5PVT","target":"record","payload":{"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"},"canonical_sha256":"e5d91bca5a09d1e5224fb786743baface7c077f9647f2de7e608170bde3a4d46","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"},"source_kind":"arxiv","source_id":"1810.11831","source_version":1,"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:02:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nz5lhFwXKgUI1MCnGAPeeOH52lOJxTAdIsSCQJb2QFvt7rPO6Jn/M9PrJjLxN/hGUDGL4W3VbPscuevCQKJ1AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:01:49.510019Z"},"content_sha256":"6844e8b811b73b7966b88cd0b28fe6338a3c3fe33a032e8ee078166eb10978ac","schema_version":"1.0","event_id":"sha256:6844e8b811b73b7966b88cd0b28fe6338a3c3fe33a032e8ee078166eb10978ac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:4XMRXSS2BHI6KISPW6DHIO5PVT","target":"graph","payload":{"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"},"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:02:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V4Pj8POJcy9oekg4B8L/VUigFv5Fb51uKo7wwkN4ZRdWFjXBC1n6sxZyLaSWeE4zM8gSE2SEwMc07yPG8+J3Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:01:49.510726Z"},"content_sha256":"bc241cccd82c7545f8f3395ae75bc45651dd47d4cdf92a49c0948a2929adca92","schema_version":"1.0","event_id":"sha256:bc241cccd82c7545f8f3395ae75bc45651dd47d4cdf92a49c0948a2929adca92"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4XMRXSS2BHI6KISPW6DHIO5PVT/bundle.json","state_url":"https://pith.science/pith/4XMRXSS2BHI6KISPW6DHIO5PVT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4XMRXSS2BHI6KISPW6DHIO5PVT/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-05-26T11:01:49Z","links":{"resolver":"https://pith.science/pith/4XMRXSS2BHI6KISPW6DHIO5PVT","bundle":"https://pith.science/pith/4XMRXSS2BHI6KISPW6DHIO5PVT/bundle.json","state":"https://pith.science/pith/4XMRXSS2BHI6KISPW6DHIO5PVT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4XMRXSS2BHI6KISPW6DHIO5PVT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4XMRXSS2BHI6KISPW6DHIO5PVT","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":"e6febfed81de6cd3c09058ff80b21b9b98bf5d1bc9d788791e7fe5590281b49b","cross_cats_sorted":["cs.IT","cs.SY","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-28T16:35:52Z","title_canon_sha256":"efbce0ce5bbb2bf11817e19204b06b3d2f2283a6fc7183794da8a0eae82d9e8d"},"schema_version":"1.0","source":{"id":"1810.11831","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.11831","created_at":"2026-05-18T00:02:03Z"},{"alias_kind":"arxiv_version","alias_value":"1810.11831v1","created_at":"2026-05-18T00:02:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.11831","created_at":"2026-05-18T00:02:03Z"},{"alias_kind":"pith_short_12","alias_value":"4XMRXSS2BHI6","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4XMRXSS2BHI6KISP","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4XMRXSS2","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:bc241cccd82c7545f8f3395ae75bc45651dd47d4cdf92a49c0948a2929adca92","target":"graph","created_at":"2026-05-18T00:02:03Z","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":"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","authors_text":"George J. Pappas, Hamed Hassani, Konstantinos Gatsis","cross_cats":["cs.IT","cs.SY","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-28T16:35:52Z","title":"Latency-Reliability Tradeoffs for State Estimation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.11831","kind":"arxiv","version":1},"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:6844e8b811b73b7966b88cd0b28fe6338a3c3fe33a032e8ee078166eb10978ac","target":"record","created_at":"2026-05-18T00:02:03Z","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":"e6febfed81de6cd3c09058ff80b21b9b98bf5d1bc9d788791e7fe5590281b49b","cross_cats_sorted":["cs.IT","cs.SY","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-28T16:35:52Z","title_canon_sha256":"efbce0ce5bbb2bf11817e19204b06b3d2f2283a6fc7183794da8a0eae82d9e8d"},"schema_version":"1.0","source":{"id":"1810.11831","kind":"arxiv","version":1}},"canonical_sha256":"e5d91bca5a09d1e5224fb786743baface7c077f9647f2de7e608170bde3a4d46","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e5d91bca5a09d1e5224fb786743baface7c077f9647f2de7e608170bde3a4d46","first_computed_at":"2026-05-18T00:02:03.018808Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:03.018808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L2GrmbMrAx4SIoOSMQwp6gSwnsMnBKtemHMShDIgk3KHgbR2KbNadsWRPEL6Dd/Sjj/oD65rE9VQ9TzN9zheDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:03.019450Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.11831","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6844e8b811b73b7966b88cd0b28fe6338a3c3fe33a032e8ee078166eb10978ac","sha256:bc241cccd82c7545f8f3395ae75bc45651dd47d4cdf92a49c0948a2929adca92"],"state_sha256":"6387a5aacca038c07f3743af53d1eb3ae98a2dd77424f7c781f3bdf6cc1c82c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0LE30sO++gKq/THI/OY0nmIk/OpyowU5BrVJSFTWltmQvIlqqeLZKLbR4ag9xjapv6r96FvJU4/Kp+a8UvFIBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:01:49.515178Z","bundle_sha256":"36dda80587a091e196370c7858a215140bee6eec42d835d46b6b9b41db1f07ce"}}