{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:XOH7E5DJXZ2SNYBUXYHH6OPNRO","short_pith_number":"pith:XOH7E5DJ","schema_version":"1.0","canonical_sha256":"bb8ff27469be7526e034be0e7f39ed8b84c47fc87a78a3c28b2449427a94b549","source":{"kind":"arxiv","id":"1709.03026","version":1},"attestation_state":"computed","paper":{"title":"Optimal Sensor Design and Zero-Delay Source Coding for Continuous-Time Vector Gauss-Markov Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.OC","authors_text":"Mikael Skoglund, Takashi Tanaka, Valeri Ugrinovskii","submitted_at":"2017-09-10T01:29:15Z","abstract_excerpt":"We consider the situation in which a continuous-time vector Gauss-Markov process is observed through a vector Gaussian channel (sensor) and estimated by the Kalman-Bucy filter. Unlike in standard filtering problems where a sensor model is given a priori, we are concerned with the optimal sensor design by which (i) the mutual information between the source random process and the reproduction (estimation) process is minimized, and (ii) the minimum mean-square estimation error meets a given distortion constraint. We show that such a sensor design problem is tractable by semidefinite programming. "},"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":"1709.03026","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-10T01:29:15Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"048db39768faf9e1bcb82d01d946c401bff8713cc856e7fec3614f344ec72c06","abstract_canon_sha256":"5f3b71fca8c911769a2c0fc929ccfe3a434faea05338e8425573c58cac738c3b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:39.653222Z","signature_b64":"+qfPUeZy+JKhqCEVV52NjkLKs0vqz12ZJbURYQ17I6R6zj/hxmb81dF4dj0jxCbLRlc0ohJIa6OEb99uwGeRCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb8ff27469be7526e034be0e7f39ed8b84c47fc87a78a3c28b2449427a94b549","last_reissued_at":"2026-05-18T00:35:39.652579Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:39.652579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Sensor Design and Zero-Delay Source Coding for Continuous-Time Vector Gauss-Markov Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.OC","authors_text":"Mikael Skoglund, Takashi Tanaka, Valeri Ugrinovskii","submitted_at":"2017-09-10T01:29:15Z","abstract_excerpt":"We consider the situation in which a continuous-time vector Gauss-Markov process is observed through a vector Gaussian channel (sensor) and estimated by the Kalman-Bucy filter. Unlike in standard filtering problems where a sensor model is given a priori, we are concerned with the optimal sensor design by which (i) the mutual information between the source random process and the reproduction (estimation) process is minimized, and (ii) the minimum mean-square estimation error meets a given distortion constraint. We show that such a sensor design problem is tractable by semidefinite programming. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.03026","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":"1709.03026","created_at":"2026-05-18T00:35:39.652692+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.03026v1","created_at":"2026-05-18T00:35:39.652692+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.03026","created_at":"2026-05-18T00:35:39.652692+00:00"},{"alias_kind":"pith_short_12","alias_value":"XOH7E5DJXZ2S","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"XOH7E5DJXZ2SNYBU","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"XOH7E5DJ","created_at":"2026-05-18T12:31:56.362134+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/XOH7E5DJXZ2SNYBUXYHH6OPNRO","json":"https://pith.science/pith/XOH7E5DJXZ2SNYBUXYHH6OPNRO.json","graph_json":"https://pith.science/api/pith-number/XOH7E5DJXZ2SNYBUXYHH6OPNRO/graph.json","events_json":"https://pith.science/api/pith-number/XOH7E5DJXZ2SNYBUXYHH6OPNRO/events.json","paper":"https://pith.science/paper/XOH7E5DJ"},"agent_actions":{"view_html":"https://pith.science/pith/XOH7E5DJXZ2SNYBUXYHH6OPNRO","download_json":"https://pith.science/pith/XOH7E5DJXZ2SNYBUXYHH6OPNRO.json","view_paper":"https://pith.science/paper/XOH7E5DJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.03026&json=true","fetch_graph":"https://pith.science/api/pith-number/XOH7E5DJXZ2SNYBUXYHH6OPNRO/graph.json","fetch_events":"https://pith.science/api/pith-number/XOH7E5DJXZ2SNYBUXYHH6OPNRO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XOH7E5DJXZ2SNYBUXYHH6OPNRO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XOH7E5DJXZ2SNYBUXYHH6OPNRO/action/storage_attestation","attest_author":"https://pith.science/pith/XOH7E5DJXZ2SNYBUXYHH6OPNRO/action/author_attestation","sign_citation":"https://pith.science/pith/XOH7E5DJXZ2SNYBUXYHH6OPNRO/action/citation_signature","submit_replication":"https://pith.science/pith/XOH7E5DJXZ2SNYBUXYHH6OPNRO/action/replication_record"}},"created_at":"2026-05-18T00:35:39.652692+00:00","updated_at":"2026-05-18T00:35:39.652692+00:00"}