{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WQPUF7O2BP46XEUXRUQMRZ7T3D","short_pith_number":"pith:WQPUF7O2","schema_version":"1.0","canonical_sha256":"b41f42fdda0bf9eb92978d20c8e7f3d8ec246f7f102c090856ef503e5ff6ba58","source":{"kind":"arxiv","id":"1804.04432","version":2},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1804.04432","created_at":"2026-05-18T00:02:35.223566+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.04432v2","created_at":"2026-05-18T00:02:35.223566+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.04432","created_at":"2026-05-18T00:02:35.223566+00:00"},{"alias_kind":"pith_short_12","alias_value":"WQPUF7O2BP46","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"WQPUF7O2BP46XEUX","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"WQPUF7O2","created_at":"2026-05-18T12:33:01.666342+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/WQPUF7O2BP46XEUXRUQMRZ7T3D","json":"https://pith.science/pith/WQPUF7O2BP46XEUXRUQMRZ7T3D.json","graph_json":"https://pith.science/api/pith-number/WQPUF7O2BP46XEUXRUQMRZ7T3D/graph.json","events_json":"https://pith.science/api/pith-number/WQPUF7O2BP46XEUXRUQMRZ7T3D/events.json","paper":"https://pith.science/paper/WQPUF7O2"},"agent_actions":{"view_html":"https://pith.science/pith/WQPUF7O2BP46XEUXRUQMRZ7T3D","download_json":"https://pith.science/pith/WQPUF7O2BP46XEUXRUQMRZ7T3D.json","view_paper":"https://pith.science/paper/WQPUF7O2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.04432&json=true","fetch_graph":"https://pith.science/api/pith-number/WQPUF7O2BP46XEUXRUQMRZ7T3D/graph.json","fetch_events":"https://pith.science/api/pith-number/WQPUF7O2BP46XEUXRUQMRZ7T3D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WQPUF7O2BP46XEUXRUQMRZ7T3D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WQPUF7O2BP46XEUXRUQMRZ7T3D/action/storage_attestation","attest_author":"https://pith.science/pith/WQPUF7O2BP46XEUXRUQMRZ7T3D/action/author_attestation","sign_citation":"https://pith.science/pith/WQPUF7O2BP46XEUXRUQMRZ7T3D/action/citation_signature","submit_replication":"https://pith.science/pith/WQPUF7O2BP46XEUXRUQMRZ7T3D/action/replication_record"}},"created_at":"2026-05-18T00:02:35.223566+00:00","updated_at":"2026-05-18T00:02:35.223566+00:00"}