{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:WSE647J37LQUMSA4TZ2YXZW6TL","short_pith_number":"pith:WSE647J3","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"},"canonical_sha256":"b489ee7d3bfae146481c9e758be6de9ae184a4d8ac093a845fe0cdd87b248356","source":{"kind":"arxiv","id":"1604.01227","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.01227","created_at":"2026-05-18T00:58:57Z"},{"alias_kind":"arxiv_version","alias_value":"1604.01227v1","created_at":"2026-05-18T00:58:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.01227","created_at":"2026-05-18T00:58:57Z"},{"alias_kind":"pith_short_12","alias_value":"WSE647J37LQU","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"WSE647J37LQUMSA4","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"WSE647J3","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:WSE647J37LQUMSA4TZ2YXZW6TL","target":"record","payload":{"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"},"canonical_sha256":"b489ee7d3bfae146481c9e758be6de9ae184a4d8ac093a845fe0cdd87b248356","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"},"source_kind":"arxiv","source_id":"1604.01227","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:58:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o0lho+BahQEFUFsMfBDHCOO2EVkrA1RmZC5T+vL0X8PP0aof8tudbzhxhfsBb8WR3q0xOHCqqT/5tUcVrWHPDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T22:53:41.678388Z"},"content_sha256":"e2a16a86710cf412a5a6b16f508bc5edac537e368195623c80e547722e5f7962","schema_version":"1.0","event_id":"sha256:e2a16a86710cf412a5a6b16f508bc5edac537e368195623c80e547722e5f7962"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:WSE647J37LQUMSA4TZ2YXZW6TL","target":"graph","payload":{"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"},"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:58:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"klteRC/k3d8/Erl32L0ADlX9qhjFa6vRdeL0UR74aL9oQD/X5xMx46I4vsNp8aaD1ie4hxLzveRoYwcMLp1hAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T22:53:41.679102Z"},"content_sha256":"a2b2fc635e69592ef401daa429d2fa213a020a8cef510c6b2e237b29f14aced4","schema_version":"1.0","event_id":"sha256:a2b2fc635e69592ef401daa429d2fa213a020a8cef510c6b2e237b29f14aced4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WSE647J37LQUMSA4TZ2YXZW6TL/bundle.json","state_url":"https://pith.science/pith/WSE647J37LQUMSA4TZ2YXZW6TL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WSE647J37LQUMSA4TZ2YXZW6TL/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-07T22:53:41Z","links":{"resolver":"https://pith.science/pith/WSE647J37LQUMSA4TZ2YXZW6TL","bundle":"https://pith.science/pith/WSE647J37LQUMSA4TZ2YXZW6TL/bundle.json","state":"https://pith.science/pith/WSE647J37LQUMSA4TZ2YXZW6TL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WSE647J37LQUMSA4TZ2YXZW6TL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:WSE647J37LQUMSA4TZ2YXZW6TL","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":"911fe96f89d51e4440d322efc0e920f8a1a88e45648f61321b9f97bdd2a7bb9c","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-05T11:59:51Z","title_canon_sha256":"da5e8f531ec7e1244001a32a5eba57ac86c1e1711ec799f2d7e5af5c7203327a"},"schema_version":"1.0","source":{"id":"1604.01227","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.01227","created_at":"2026-05-18T00:58:57Z"},{"alias_kind":"arxiv_version","alias_value":"1604.01227v1","created_at":"2026-05-18T00:58:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.01227","created_at":"2026-05-18T00:58:57Z"},{"alias_kind":"pith_short_12","alias_value":"WSE647J37LQU","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"WSE647J37LQUMSA4","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"WSE647J3","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:a2b2fc635e69592ef401daa429d2fa213a020a8cef510c6b2e237b29f14aced4","target":"graph","created_at":"2026-05-18T00:58:57Z","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 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","authors_text":"Henrik Sandberg, Karl Henrik Johansson, Mikael Skoglund, Takashi Tanaka, Tobias Oechtering","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-05T11:59:51Z","title":"Rate of Prefix-free Codes in LQG Control Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.01227","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:e2a16a86710cf412a5a6b16f508bc5edac537e368195623c80e547722e5f7962","target":"record","created_at":"2026-05-18T00:58:57Z","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":"911fe96f89d51e4440d322efc0e920f8a1a88e45648f61321b9f97bdd2a7bb9c","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-05T11:59:51Z","title_canon_sha256":"da5e8f531ec7e1244001a32a5eba57ac86c1e1711ec799f2d7e5af5c7203327a"},"schema_version":"1.0","source":{"id":"1604.01227","kind":"arxiv","version":1}},"canonical_sha256":"b489ee7d3bfae146481c9e758be6de9ae184a4d8ac093a845fe0cdd87b248356","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b489ee7d3bfae146481c9e758be6de9ae184a4d8ac093a845fe0cdd87b248356","first_computed_at":"2026-05-18T00:58:57.056244Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:57.056244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EYkCSxjH4CHjxdA0IZPMJnfgSU4p+qiqn60JoNreoYmhhnIucJzYeQlVwqyWr7t+vFijZaVCtjMeRxWc572pDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:57.056813Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.01227","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e2a16a86710cf412a5a6b16f508bc5edac537e368195623c80e547722e5f7962","sha256:a2b2fc635e69592ef401daa429d2fa213a020a8cef510c6b2e237b29f14aced4"],"state_sha256":"db39f8ef5c0ac911176604e2786f91f55d68eacf51786a06e7fe80684cb05e41"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E8Aw587la+HUNeKExPoBZsYRcwh5/Kw97YWOvxXX7TLQgv186/mvpLYjnMvNAcWJYpOk7UvEE9BKr4ml+rJWDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T22:53:41.682874Z","bundle_sha256":"57ff268df2035df88e417270ca7c8b13486c10c8609602f7bee494e9fb28b7c6"}}