{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:CZWZWZFPTYO5YCBFFENV3D7HQO","short_pith_number":"pith:CZWZWZFP","schema_version":"1.0","canonical_sha256":"166d9b64af9e1ddc0825291b5d8fe7839f5220b361afad0c965b6c810de8817b","source":{"kind":"arxiv","id":"1203.6318","version":1},"attestation_state":"computed","paper":{"title":"Optimal Linear Joint Source-Channel Coding with Delay Constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anders Rantzer, Andrey Ghulchak, Bo Bernhardsson, Erik Johannesson","submitted_at":"2012-03-28T17:07:57Z","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 "},"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":"1203.6318","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-28T17:07:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"80bc6870e9c1ea66c76e69cd6a65fe3415c36d5750f539784beef307754c01ac","abstract_canon_sha256":"f918fb0208fc1781c7cf228534c83425fa8ccffaa451af140a7a8ab971af6b38"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:59:03.641462Z","signature_b64":"zy9qKHoPV8CL5L8ro3slHQpZ42m6iv+36aJDj7D/Ii+KKjghjrciOMKvD49N9n6W0LjEZpxHVgi+QMqhqJfjAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"166d9b64af9e1ddc0825291b5d8fe7839f5220b361afad0c965b6c810de8817b","last_reissued_at":"2026-05-18T03:59:03.640875Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:59:03.640875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Linear Joint Source-Channel Coding with Delay Constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anders Rantzer, Andrey Ghulchak, Bo Bernhardsson, Erik Johannesson","submitted_at":"2012-03-28T17:07:57Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.6318","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":"1203.6318","created_at":"2026-05-18T03:59:03.640947+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.6318v1","created_at":"2026-05-18T03:59:03.640947+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.6318","created_at":"2026-05-18T03:59:03.640947+00:00"},{"alias_kind":"pith_short_12","alias_value":"CZWZWZFPTYO5","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"CZWZWZFPTYO5YCBF","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"CZWZWZFP","created_at":"2026-05-18T12:27:01.376967+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/CZWZWZFPTYO5YCBFFENV3D7HQO","json":"https://pith.science/pith/CZWZWZFPTYO5YCBFFENV3D7HQO.json","graph_json":"https://pith.science/api/pith-number/CZWZWZFPTYO5YCBFFENV3D7HQO/graph.json","events_json":"https://pith.science/api/pith-number/CZWZWZFPTYO5YCBFFENV3D7HQO/events.json","paper":"https://pith.science/paper/CZWZWZFP"},"agent_actions":{"view_html":"https://pith.science/pith/CZWZWZFPTYO5YCBFFENV3D7HQO","download_json":"https://pith.science/pith/CZWZWZFPTYO5YCBFFENV3D7HQO.json","view_paper":"https://pith.science/paper/CZWZWZFP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.6318&json=true","fetch_graph":"https://pith.science/api/pith-number/CZWZWZFPTYO5YCBFFENV3D7HQO/graph.json","fetch_events":"https://pith.science/api/pith-number/CZWZWZFPTYO5YCBFFENV3D7HQO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CZWZWZFPTYO5YCBFFENV3D7HQO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CZWZWZFPTYO5YCBFFENV3D7HQO/action/storage_attestation","attest_author":"https://pith.science/pith/CZWZWZFPTYO5YCBFFENV3D7HQO/action/author_attestation","sign_citation":"https://pith.science/pith/CZWZWZFPTYO5YCBFFENV3D7HQO/action/citation_signature","submit_replication":"https://pith.science/pith/CZWZWZFPTYO5YCBFFENV3D7HQO/action/replication_record"}},"created_at":"2026-05-18T03:59:03.640947+00:00","updated_at":"2026-05-18T03:59:03.640947+00:00"}