{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WQPUF7O2BP46XEUXRUQMRZ7T3D","short_pith_number":"pith:WQPUF7O2","canonical_record":{"source":{"id":"1804.04432","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2018-04-12T11:27:55Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"31bfeb06f4c9fab2574b774a3f1c3182cc53db3507903f22ee3da71a7b6289e7","abstract_canon_sha256":"bdc615a3ba9a98b356d73eff29add742e75c2148db5dab417a62c9454022cf78"},"schema_version":"1.0"},"canonical_sha256":"b41f42fdda0bf9eb92978d20c8e7f3d8ec246f7f102c090856ef503e5ff6ba58","source":{"kind":"arxiv","id":"1804.04432","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.04432","created_at":"2026-05-18T00:02:35Z"},{"alias_kind":"arxiv_version","alias_value":"1804.04432v2","created_at":"2026-05-18T00:02:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.04432","created_at":"2026-05-18T00:02:35Z"},{"alias_kind":"pith_short_12","alias_value":"WQPUF7O2BP46","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WQPUF7O2BP46XEUX","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WQPUF7O2","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WQPUF7O2BP46XEUXRUQMRZ7T3D","target":"record","payload":{"canonical_record":{"source":{"id":"1804.04432","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2018-04-12T11:27:55Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"31bfeb06f4c9fab2574b774a3f1c3182cc53db3507903f22ee3da71a7b6289e7","abstract_canon_sha256":"bdc615a3ba9a98b356d73eff29add742e75c2148db5dab417a62c9454022cf78"},"schema_version":"1.0"},"canonical_sha256":"b41f42fdda0bf9eb92978d20c8e7f3d8ec246f7f102c090856ef503e5ff6ba58","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:35.224072Z","signature_b64":"Umbt8dzgBtPUltsD1sP2N0PATrlA/pHQXKKpe7eM1YVLuMlV9I3u/EHhwenc0eqR7TVZUVjApuzbotP2lHH1CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b41f42fdda0bf9eb92978d20c8e7f3d8ec246f7f102c090856ef503e5ff6ba58","last_reissued_at":"2026-05-18T00:02:35.223459Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:35.223459Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.04432","source_version":2,"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:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wfy5ZPxno/OUTZAXM9aqU+uc6ESMUoBKG2TgMr4ieY88r499EnwCeSJVGO5T8xxacsi2esIomBni/S8LlsW4Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:01:17.080413Z"},"content_sha256":"09067b7342166870ee2c0d7ed534272d4f7049a7542ece43bc1f175b2dcbd3a0","schema_version":"1.0","event_id":"sha256:09067b7342166870ee2c0d7ed534272d4f7049a7542ece43bc1f175b2dcbd3a0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WQPUF7O2BP46XEUXRUQMRZ7T3D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Numerical approximation of the data-rate limit for state estimation under communication constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.DS","authors_text":"Christoph Kawan, Sigurdur Hafstein","submitted_at":"2018-04-12T11:27:55Z","abstract_excerpt":"In networked control, a fundamental problem is to determine the smallest capacity of a communication channel between a dynamical system and a controller above which a prescribed control objective can be achieved. Often, a preliminary task of the controller, before selecting the control input, is to estimate the state with a sufficient accuracy. For time-invariant systems, it has been shown that the smallest channel capacity $C_0$ above which the state can be estimated with an arbitrarily small error, depending on the precise formulation of the estimation objective, is given by the topological "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.04432","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"},"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:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kL6+30yxDrRkuWZAXteqMvIf1T8QEXDP43eeHSAGX46ZhabgPkogXcS+f7+zfGsuLVPCrpK/6+Jy9iFuSrRmDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:01:17.080768Z"},"content_sha256":"aceba65262eb173632dc6df97dfc3da31b118942152bb42a7d287887c00f2027","schema_version":"1.0","event_id":"sha256:aceba65262eb173632dc6df97dfc3da31b118942152bb42a7d287887c00f2027"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WQPUF7O2BP46XEUXRUQMRZ7T3D/bundle.json","state_url":"https://pith.science/pith/WQPUF7O2BP46XEUXRUQMRZ7T3D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WQPUF7O2BP46XEUXRUQMRZ7T3D/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-06-02T10:01:17Z","links":{"resolver":"https://pith.science/pith/WQPUF7O2BP46XEUXRUQMRZ7T3D","bundle":"https://pith.science/pith/WQPUF7O2BP46XEUXRUQMRZ7T3D/bundle.json","state":"https://pith.science/pith/WQPUF7O2BP46XEUXRUQMRZ7T3D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WQPUF7O2BP46XEUXRUQMRZ7T3D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WQPUF7O2BP46XEUXRUQMRZ7T3D","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":"bdc615a3ba9a98b356d73eff29add742e75c2148db5dab417a62c9454022cf78","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2018-04-12T11:27:55Z","title_canon_sha256":"31bfeb06f4c9fab2574b774a3f1c3182cc53db3507903f22ee3da71a7b6289e7"},"schema_version":"1.0","source":{"id":"1804.04432","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.04432","created_at":"2026-05-18T00:02:35Z"},{"alias_kind":"arxiv_version","alias_value":"1804.04432v2","created_at":"2026-05-18T00:02:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.04432","created_at":"2026-05-18T00:02:35Z"},{"alias_kind":"pith_short_12","alias_value":"WQPUF7O2BP46","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WQPUF7O2BP46XEUX","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WQPUF7O2","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:aceba65262eb173632dc6df97dfc3da31b118942152bb42a7d287887c00f2027","target":"graph","created_at":"2026-05-18T00:02:35Z","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":"In networked control, a fundamental problem is to determine the smallest capacity of a communication channel between a dynamical system and a controller above which a prescribed control objective can be achieved. Often, a preliminary task of the controller, before selecting the control input, is to estimate the state with a sufficient accuracy. For time-invariant systems, it has been shown that the smallest channel capacity $C_0$ above which the state can be estimated with an arbitrarily small error, depending on the precise formulation of the estimation objective, is given by the topological ","authors_text":"Christoph Kawan, Sigurdur Hafstein","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2018-04-12T11:27:55Z","title":"Numerical approximation of the data-rate limit for state estimation under communication constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.04432","kind":"arxiv","version":2},"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:09067b7342166870ee2c0d7ed534272d4f7049a7542ece43bc1f175b2dcbd3a0","target":"record","created_at":"2026-05-18T00:02:35Z","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":"bdc615a3ba9a98b356d73eff29add742e75c2148db5dab417a62c9454022cf78","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2018-04-12T11:27:55Z","title_canon_sha256":"31bfeb06f4c9fab2574b774a3f1c3182cc53db3507903f22ee3da71a7b6289e7"},"schema_version":"1.0","source":{"id":"1804.04432","kind":"arxiv","version":2}},"canonical_sha256":"b41f42fdda0bf9eb92978d20c8e7f3d8ec246f7f102c090856ef503e5ff6ba58","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b41f42fdda0bf9eb92978d20c8e7f3d8ec246f7f102c090856ef503e5ff6ba58","first_computed_at":"2026-05-18T00:02:35.223459Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:35.223459Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Umbt8dzgBtPUltsD1sP2N0PATrlA/pHQXKKpe7eM1YVLuMlV9I3u/EHhwenc0eqR7TVZUVjApuzbotP2lHH1CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:35.224072Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.04432","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:09067b7342166870ee2c0d7ed534272d4f7049a7542ece43bc1f175b2dcbd3a0","sha256:aceba65262eb173632dc6df97dfc3da31b118942152bb42a7d287887c00f2027"],"state_sha256":"fca2d1c34ea5b46d0b5595f6e30910793d0a51b56f58eba9ed6da3d1d939c1f0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mah5dcEegHevDermFcJwIlCYyBfxUPnYRgcW7hGaMq3Cr+hZ6jG3Gz9di9X98+iYXHZPa2MuQWKcfieJ4InRBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T10:01:17.082723Z","bundle_sha256":"cd715fcb730ee17906c815932d467adf4274486caf2aef67d29461c7faa6fdfe"}}