{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:WSE647J37LQUMSA4TZ2YXZW6TL","short_pith_number":"pith:WSE647J3","schema_version":"1.0","canonical_sha256":"b489ee7d3bfae146481c9e758be6de9ae184a4d8ac093a845fe0cdd87b248356","source":{"kind":"arxiv","id":"1604.01227","version":1},"attestation_state":"computed","paper":{"title":"Rate of Prefix-free Codes in LQG Control Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.OC","authors_text":"Henrik Sandberg, Karl Henrik Johansson, Mikael Skoglund, Takashi Tanaka, Tobias Oechtering","submitted_at":"2016-04-05T11:59:51Z","abstract_excerpt":"In this paper, we consider a discrete time linear quadratic Gaussian (LQG) control problem in which state information of the plant is encoded in a variable-length binary codeword at every time step, and a control input is determined based on the codewords generated in the past. We derive a lower bound of the rate achievable by the class of prefix-free codes attaining the required LQG control performance. This lower bound coincides with the infimum of a certain directed information expression, and is computable by semidefinite programming (SDP). Based on a technique by Silva et al., we also pro"},"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":"1604.01227","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-05T11:59:51Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"da5e8f531ec7e1244001a32a5eba57ac86c1e1711ec799f2d7e5af5c7203327a","abstract_canon_sha256":"911fe96f89d51e4440d322efc0e920f8a1a88e45648f61321b9f97bdd2a7bb9c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:57.056813Z","signature_b64":"EYkCSxjH4CHjxdA0IZPMJnfgSU4p+qiqn60JoNreoYmhhnIucJzYeQlVwqyWr7t+vFijZaVCtjMeRxWc572pDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b489ee7d3bfae146481c9e758be6de9ae184a4d8ac093a845fe0cdd87b248356","last_reissued_at":"2026-05-18T00:58:57.056244Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:57.056244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rate of Prefix-free Codes in LQG Control Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.OC","authors_text":"Henrik Sandberg, Karl Henrik Johansson, Mikael Skoglund, Takashi Tanaka, Tobias Oechtering","submitted_at":"2016-04-05T11:59:51Z","abstract_excerpt":"In this paper, we consider a discrete time linear quadratic Gaussian (LQG) control problem in which state information of the plant is encoded in a variable-length binary codeword at every time step, and a control input is determined based on the codewords generated in the past. We derive a lower bound of the rate achievable by the class of prefix-free codes attaining the required LQG control performance. This lower bound coincides with the infimum of a certain directed information expression, and is computable by semidefinite programming (SDP). Based on a technique by Silva et al., we also pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.01227","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":"1604.01227","created_at":"2026-05-18T00:58:57.056335+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.01227v1","created_at":"2026-05-18T00:58:57.056335+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.01227","created_at":"2026-05-18T00:58:57.056335+00:00"},{"alias_kind":"pith_short_12","alias_value":"WSE647J37LQU","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"WSE647J37LQUMSA4","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"WSE647J3","created_at":"2026-05-18T12:30:51.357362+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.20369","citing_title":"Rate-Cost Tradeoffs in Nonlinear Control","ref_index":53,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WSE647J37LQUMSA4TZ2YXZW6TL","json":"https://pith.science/pith/WSE647J37LQUMSA4TZ2YXZW6TL.json","graph_json":"https://pith.science/api/pith-number/WSE647J37LQUMSA4TZ2YXZW6TL/graph.json","events_json":"https://pith.science/api/pith-number/WSE647J37LQUMSA4TZ2YXZW6TL/events.json","paper":"https://pith.science/paper/WSE647J3"},"agent_actions":{"view_html":"https://pith.science/pith/WSE647J37LQUMSA4TZ2YXZW6TL","download_json":"https://pith.science/pith/WSE647J37LQUMSA4TZ2YXZW6TL.json","view_paper":"https://pith.science/paper/WSE647J3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.01227&json=true","fetch_graph":"https://pith.science/api/pith-number/WSE647J37LQUMSA4TZ2YXZW6TL/graph.json","fetch_events":"https://pith.science/api/pith-number/WSE647J37LQUMSA4TZ2YXZW6TL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WSE647J37LQUMSA4TZ2YXZW6TL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WSE647J37LQUMSA4TZ2YXZW6TL/action/storage_attestation","attest_author":"https://pith.science/pith/WSE647J37LQUMSA4TZ2YXZW6TL/action/author_attestation","sign_citation":"https://pith.science/pith/WSE647J37LQUMSA4TZ2YXZW6TL/action/citation_signature","submit_replication":"https://pith.science/pith/WSE647J37LQUMSA4TZ2YXZW6TL/action/replication_record"}},"created_at":"2026-05-18T00:58:57.056335+00:00","updated_at":"2026-05-18T00:58:57.056335+00:00"}