{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:CZWZWZFPTYO5YCBFFENV3D7HQO","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":"f918fb0208fc1781c7cf228534c83425fa8ccffaa451af140a7a8ab971af6b38","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-28T17:07:57Z","title_canon_sha256":"80bc6870e9c1ea66c76e69cd6a65fe3415c36d5750f539784beef307754c01ac"},"schema_version":"1.0","source":{"id":"1203.6318","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.6318","created_at":"2026-05-18T03:59:03Z"},{"alias_kind":"arxiv_version","alias_value":"1203.6318v1","created_at":"2026-05-18T03:59:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.6318","created_at":"2026-05-18T03:59:03Z"},{"alias_kind":"pith_short_12","alias_value":"CZWZWZFPTYO5","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CZWZWZFPTYO5YCBF","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CZWZWZFP","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:1e8a66dd0f581cd6138029b72fe019b20b4d7187d6d87673d3b505cc49fca2dc","target":"graph","created_at":"2026-05-18T03:59: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 problem of joint source-channel coding is considered for a stationary remote (noisy) Gaussian source and a Gaussian channel. The encoder and decoder are assumed to be causal and their combined operations are subject to a delay constraint. It is shown that, under the mean-square error distortion metric, an optimal encoder-decoder pair from the linear and time-invariant (LTI) class can be found by minimization of a convex functional and a spectral factorization. The functional to be minimized is the sum of the well-known cost in a corresponding Wiener filter problem and a new term, which is ","authors_text":"Anders Rantzer, Andrey Ghulchak, Bo Bernhardsson, Erik Johannesson","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-28T17:07:57Z","title":"Optimal Linear Joint Source-Channel Coding with Delay Constraint"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.6318","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:93d8c2c79f6a363d552130090772e4ccf93618150886997e1ed3885527897d0e","target":"record","created_at":"2026-05-18T03:59: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":"f918fb0208fc1781c7cf228534c83425fa8ccffaa451af140a7a8ab971af6b38","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-28T17:07:57Z","title_canon_sha256":"80bc6870e9c1ea66c76e69cd6a65fe3415c36d5750f539784beef307754c01ac"},"schema_version":"1.0","source":{"id":"1203.6318","kind":"arxiv","version":1}},"canonical_sha256":"166d9b64af9e1ddc0825291b5d8fe7839f5220b361afad0c965b6c810de8817b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"166d9b64af9e1ddc0825291b5d8fe7839f5220b361afad0c965b6c810de8817b","first_computed_at":"2026-05-18T03:59:03.640875Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:59:03.640875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zy9qKHoPV8CL5L8ro3slHQpZ42m6iv+36aJDj7D/Ii+KKjghjrciOMKvD49N9n6W0LjEZpxHVgi+QMqhqJfjAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:59:03.641462Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.6318","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:93d8c2c79f6a363d552130090772e4ccf93618150886997e1ed3885527897d0e","sha256:1e8a66dd0f581cd6138029b72fe019b20b4d7187d6d87673d3b505cc49fca2dc"],"state_sha256":"210f0c4f47df29db7bc2d0b980170e825b18b6f6aaf2df25669d2845b5e4f61c"}